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

Xiao Ming

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

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

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 · 56% Knowledge graphs · 44%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning
metric learning
0.512021
Where are we in embedding spaces? · KDD 2021
Recommender systems › representation learning for recommendation
embedding-based recommendation
0.512021
Where are we in embedding spaces? · KDD 2021
Knowledge graphs › knowledge graph embedding
hyperbolic embedding
0.512021
Where are we in embedding spaces? · KDD 2021
Recommender systems
item recommendation
0.112021
Where are we in embedding spaces? · KDD 2021

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

metric learning · 1.0latent space analysis · 1.0hyperbolic space · 1.0
YearPublicationVenuePosition
2021 Where are we in embedding spaces?
abstract
Hyperbolic space and hyperbolic embeddings are becoming a popular research field for recommender systems. However, it is not clear under what circumstances the hyperbolic space should be considered. To fill this gap, This paper provides theoretical analysis and empirical results on when and where to use hyperbolic space and hyperbolic embeddings in recommender systems. Specifically, we answer the questions that which type of models and datasets are more suited for hyperbolic space, as well as which latent size to choose. We evaluate our answers by comparing the performance of Euclidean space and hyperbolic space on different latent space models in both general item recommendation domain and social recommendation domain, with 6 widely used datasets and different latent sizes. Additionally, we propose a new metric learning based recommendation method called SCML and its hyperbolic version HSCML. We evaluate our conclusions regarding hyperbolic space on SCML and show the state-of-the-art performance of hyperbolic space by comparing HSCML with other baseline methods.
Sixiao Zhang, Hongxu Chen 0002, Xiao Ming, Li-Zhen Cui 0001, Hongzhi Yin, Guandong Xu
KDD3