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

Jinqi Gong

dblp:219/1179 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · conflict

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 · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems › implicit feedback learning
implicit feedback denoising
0.812024
Double Correction Framework for Denoising Recommendation · KDD 2024
Recommender systems
implicit feedback learning
0.812024
Double Correction Framework for Denoising Recommendation · KDD 2024

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

loss reweighting · 0.8double correction · 0.8
YearPublicationVenuePosition
2024 Double Correction Framework for Denoising Recommendation
abstract
As its availability and generality in online services, implicit feedback is more commonly used in recommender systems. However, implicit feedback usually presents noisy samples in real-world recommendation scenarios (such as misclicks or non-preferential behaviors), which will affect precise user preference learning. To overcome the noisy samples problem, a popular solution is based on dropping noisy samples in the model training phase, which follows the observation that noisy samples have higher training losses than clean samples. Despite the effectiveness, we argue that this solution still has limits. (1) High training losses can result from model optimization instability or hard samples, not just noisy samples. (2) Completely dropping of noisy samples will aggravate the data sparsity, which lacks full data exploitation.
Zhuangzhuang He, Yifan Wang 0017, Yonghui Yang 0001, Peijie Sun, Le Wu 0001, Haoyue Bai 0002, Jinqi Gong, Richang Hong, Min Zhang 0006
KDD7