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

Lucas Vinh Tran

dblp:242/7881 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0002-9446-461XORCID · corroborated

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

Databases, data management, data science and information retrieval · 3 · 2 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
4 papers
Recommender systems · 86% Machine learning and data management · 10% Web and social media mining · 3%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.822020
HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systems · WSDM 2020
Quaternion Collaborative Filtering for Recommendation · IJCAI 2019
Machine learning › Representation and self-supervised learning › representation learning
embedding learning
0.412020
HME: A Hyperbolic Metric Embedding Approach for Next-POI Recommendation · SIGIR 2020
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning › geometric representation learning
hyperbolic representation learning
0.412020
HME: A Hyperbolic Metric Embedding Approach for Next-POI Recommendation · SIGIR 2020
Recommender systems
hyperbolic representation learning
0.412020
HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systems · WSDM 2020
Machine learning and data management
metric learning
0.412020
HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systems · WSDM 2020
Recommender systems › point-of-interest recommendation
next POI recommendation
0.412020
HME: A Hyperbolic Metric Embedding Approach for Next-POI Recommendation · SIGIR 2020
Recommender systems
point-of-interest recommendation
0.412020
HME: A Hyperbolic Metric Embedding Approach for Next-POI Recommendation · SIGIR 2020
Recommender systems › neural recommendation
attention-based recommendation
0.412019
Interact and Decide: Medley of Sub-Attention Networks for Effective Group Recommendation · SIGIR 2019
Recommender systems
group recommendation
0.412019
Interact and Decide: Medley of Sub-Attention Networks for Effective Group Recommendation · SIGIR 2019
Recommender systems
neural recommendation
0.412019
Interact and Decide: Medley of Sub-Attention Networks for Effective Group Recommendation · SIGIR 2019
Recommender systems
representation learning for recommendation
0.412019
Quaternion Collaborative Filtering for Recommendation · IJCAI 2019
Web and social media mining › location-based social network analysis
check-in data analysis
0.112020
HME: A Hyperbolic Metric Embedding Approach for Next-POI Recommendation · SIGIR 2020

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

sequential modeling · 0.9hyperbolic metric embedding · 0.9mobius gyrovector space · 0.4metric learning · 0.4hyperbolic geometry · 0.4sub-attention networks · 0.4quaternion algebra · 0.4hamilton product · 0.4
YearPublicationVenuePosition
2020 HME: A Hyperbolic Metric Embedding Approach for Next-POI Recommendation
abstract
With the increasing popularity of location-aware social media services, next-Point-of-Interest (POI) recommendation has gained significant research interest. The key challenge of next-POI recommendation is to precisely learn users' sequential movements from sparse check-in data. To this end, various embedding methods have been proposed to learn the representations of check-in data in the Euclidean space. However, their ability to learn complex patterns, especially hierarchical structures, is limited by the dimensionality of the Euclidean space. To this end, we propose a new research direction that aims to learn the representations of check-in activities in a hyperbolic space, which yields two advantages. First, it can effectively capture the underlying hierarchical structures, which are implied by the power-law distributions of user movements. Second, it provides high representative strength and enables the check-in data to be effectively represented in a low-dimensional space. Specifically, to solve the next-POI recommendation task, we propose a novel hyperbolic metric embedding (HME) model, which projects the check-in data into a hyperbolic space. The HME jointly captures sequential transition, user preference, category and region information in a unified approach by learning embeddings in a shared hyperbolic space. To the best of our knowledge, this is the first study to explore a non-Euclidean embedding model for next-POI recommendation. We conduct extensive experiments on three check-in datasets to demonstrate the superiority of our hyperbolic embedding approach over the state-of-the-art next-POI recommendation algorithms. Moreover, we conduct experiments on another four online transaction datasets for next-item recommendation to further demonstrate the generality of our proposed model.
Shanshan Feng 0001, Lucas Vinh Tran, Gao Cong, Lisi Chen 0001, Jing Li 0034, Fan Li 0015
SIGIR2
2020 HyperML: A Boosting Metric Learning Approach in Hyperbolic Space for Recommender Systems
abstract
This paper investigates the notion of learning user and item representations in non-Euclidean space. Specifically, we study the connection between metric learning in hyperbolic space and collaborative filtering by exploring Mobius gyrovector spaces where the formalism of the spaces could be utilized to generalize the most common Euclidean vector operations. Overall, this work aims to bridge the gap between Euclidean and hyperbolic geometry in recommender systems through metric learning approach. We propose HyperML (Hyperbolic Metric Learning), a conceptually simple but highly effective model for boosting the performance. Via a series of extensive experiments, we show that our proposed HyperML not only outperforms their Euclidean counterparts, but also achieves state-of-the-art performance on multiple benchmark datasets, demonstrating the effectiveness of personalized recommendation in hyperbolic geometry.
Lucas Vinh Tran, Yi Tay, Shuai Zhang 0007, Gao Cong, Xiaoli Li 0001
WSDM1
2019 Quaternion Collaborative Filtering for Recommendation
abstract
This paper proposes Quaternion Collaborative Filtering (QCF), a novel representation learning method for recommendation. Our proposed QCF relies on and exploits computation with Quaternion algebra, benefiting from the expressiveness and rich representation learning capability of Hamilton products. Quaternion representations, based on hypercomplex numbers, enable rich inter-latent dependencies between imaginary components. This encourages intricate relations to be captured when learning user-item interactions, serving as a strong inductive bias as compared with the real-space inner product. All in all, we conduct extensive experiments on six real-world datasets, demonstrating the effectiveness of Quaternion algebra in recommender systems. The results exhibit that QCF outperforms a wide spectrum of strong neural baselines on all datasets. Ablative experiments confirm the effectiveness of Hamilton-based composition over multi-embedding composition in real space.
Shuai Zhang 0007, Lina Yao 0001, Lucas Vinh Tran, Aston Zhang, Yi Tay
IJCAI3
2019 Interact and Decide: Medley of Sub-Attention Networks for Effective Group Recommendation
abstract
This paper proposes Medley of Sub-Attention Networks (MoSAN), a new novel neural architecture for the group recommendation task. Group-level recommendation is known to be a challenging task, in which intricate group dynamics have to be considered. As such, this is to be contrasted with the standard recommendation problem where recommendations are personalized with respect to a single user. Our proposed approach hinges upon the key intuition that the decision making process (in groups) is generally dynamic, i.e., a user's decision is highly dependent on the other group members. All in all, our key motivation manifests in a form of an attentive neural model that captures fine-grained interactions between group members. In our MoSAN model, each sub-attention module is representative of a single member, which models a user's preference with respect to all other group members. Subsequently, a Medley of Sub-Attention modules is then used to collectively make the group's final decision. Overall, our proposed model is both expressive and effective. Via a series of extensive experiments, we show that MoSAN not only achieves state-of-the-art performance but also improves standard baselines by a considerable margin.
Lucas Vinh Tran, Tuan-Anh Nguyen Pham, Yi Tay, Gao Cong, Xiaoli Li 0001
SIGIR1