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

Yanpeng Lin

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

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

Databases, data management, data science and information retrieval · 3 · 1 first-author · 2 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
3 papers
Recommender systems · 84% Information retrieval · 16%

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

TopicWeightPapersLastEvidence papers
Recommender systems › factorization models
factorization machines
1.222023
Enhancing Factorization Machines with Generalized Metric Learning (Extended Abstract) · ICDE 2023
Enhancing Factorization Machines With Generalized Metric Learning · IEEE Trans. Knowl. Data Eng. 2022
Recommender systems
cold-start recommendation
0.612022
Enhancing Factorization Machines With Generalized Metric Learning · IEEE Trans. Knowl. Data Eng. 2022
Information retrieval › ranking
learning to rank
0.412020
User Modeling Towards Stateful Learning to Rank · SIGIR 2020
Recommender systems
user modeling
0.412020
User Modeling Towards Stateful Learning to Rank · SIGIR 2020

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

mahalanobis distance · 1.2deep neural network · 1.2generalized metric learning · 0.6markov decision process · 0.4click modeling · 0.4
YearPublicationVenuePosition
2023 Enhancing Factorization Machines with Generalized Metric Learning (Extended Abstract)
abstract
Factorization Machines (FMs) have been proven effective in modeling the second-order interactions between attributes. Nevertheless, existing methods often fall short of learning the complex and rich intra-attribute feature interactions, which are abundantly exhibited in real-world recommendation data. To address this problem, we propose an FM framework equipped with generalized metric learning to better handle the essential feature correlations. In particular, based on this framework, we present a Mahalanobis distance and a deep neural network method, which can effectively model the linear and non-linear correlations between features, respectively. Besides, we design an efficient approach for simplifying the model functions. Experiments on several benchmark datasets demonstrate that our proposed framework outperforms several state-of-the-art baselines by a significant margin.
Zhiyong Cheng 0001, Jiazheng Jing, Yanpeng Lin, Liqiang Nie, Meng Wang 0001
ICDE4
2022 Enhancing Factorization Machines With Generalized Metric Learning
abstract
Factorization Machines (FMs) are effective in incorporating side information to overcome the cold-start and data sparsity problems in recommender systems. Traditional FMs adopt the inner product to model the second-order interactions between different attributes, which are represented via feature vectors. The problem is that the inner product violates the triangle inequality property of feature vectors. As a result, it cannot well capture fine-grained attribute interactions, resulting in sub-optimal performance. Recently, the euclidean distance is exploited in FMs to replace the inner product and has delivered better performance. However, previous FM methods including the ones equipped with the euclidean distance all focus on the attribute-level interaction modeling, ignoring the critical intrinsic feature correlations inside attributes. Thereby, they fail to model the complex and rich interactions exhibited in the real-world data. To tackle this problem, in this paper, we propose a FM framework equipped with generalized metric learning techniques to better capture these feature correlations. In particular, based on this framework, we present a Mahalanobis distance and a deep neural network (DNN) methods, which can effectively model the linear and non-linear correlations between features, respectively. Besides, we design an efficient approach for simplifying the model functions. Experiments on several benchmark datasets demonstrate that our proposed framework outperforms several state-of-the-art baselines by a large margin. Moreover, we collect a new large-scale dataset on second-hand trading to justify the effectiveness of our method over cold-start and data sparsity problems in recommender systems.
Zhiyong Cheng 0001, Jiazheng Jing, Yanpeng Lin, Liqiang Nie, Meng Wang 0001
IEEE Trans. Knowl. Data Eng.4
2020 User Modeling Towards Stateful Learning to Rank
abstract
Modeling user behaviors in an interactive information seeking process is key to understand user information need. Two prime characteristics of interactive information seeking are statefulness and participant initiatives. There are many work focus on click modeling using a search session log. However, such a search session of user queries and clicks lacks initiative information between user and system to model user state. In this research proposal, we focus on product search in E-commerce. We augment the search session with generalized initiative information. We integrate long term user features into search sessions and formulate user modeling as a Markov Decision Process (MDP). We further investigate how proposed user modeling would benefit Learning to Rank (LTR) in interactive stateful information seeking process.
Yanpeng Lin
SIGIR1