Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Renee Sweeney

dblp:242/9183 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › representation learning for recommendation
metric learning for recommendation
0.412019
Adversarial Mahalanobis Distance-based Attentive Song Recommender for Automatic Playlist Continuation · SIGIR 2019
Recommender systems › music recommendation
playlist continuation
0.412019
Adversarial Mahalanobis Distance-based Attentive Song Recommender for Automatic Playlist Continuation · SIGIR 2019

Methods — techniques the papers use, named apart from their topics

mahalanobis distance · 0.4attention mechanism · 0.4adversarial personalized ranking · 0.4
YearPublicationVenuePosition
2019 Adversarial Mahalanobis Distance-based Attentive Song Recommender for Automatic Playlist Continuation
abstract
In this paper, we aim to solve the automatic playlist continuation (APC) problem by modeling complex interactions among users, playlists, and songs using only their interaction data. Prior methods mainly rely on dot product to account for similarities, which is not ideal as dot product is not metric learning, so it does not convey the important inequality property. Based on this observation, we propose three novel deep learning approaches that utilize Mahalanobis distance. Our first approach uses user-playlist-song interactions, and combines Mahalanobis distance scores between (i) a target user and a target song, and (ii) between a target playlist and the target song to account for both the user's preference and the playlist's theme. Our second approach measures song-song similarities by considering Mahalanobis distance scores between the target song and each member song (i.e., existing song) in the target playlist. The contribution of each distance score is measured by our proposed memory metric-based attention mechanism. In the third approach, we fuse the two previous models into a unified model to further enhance their performance. In addition, we adopt and customize Adversarial Personalized Ranking (APR) for our three approaches to further improve their robustness and predictive capabilities. Through extensive experiments, we show that our proposed models outperform eight state-of-the-art models in two large-scale real-world datasets.
Thanh Tran 0005, Renee Sweeney, Kyumin Lee
SIGIR2