Demo Data from EDBT 2026 / reviewers in the wild / expert
Ka Ho Kwok
dblp:368/9295
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0000-0130-483XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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 · 50% Data mining · 50% | |
| Artificial intelligence
1 paper |
Graph learning · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems
cold-start recommendation |
0.8 | 1 | 2024 | Feature Matching Machine for Cold-Start Recommendation · IEEE Trans. Serv. Comput. 2024 |
Data mining
representation learning |
0.8 | 1 | 2024 | Feature Matching Machine for Cold-Start Recommendation · IEEE Trans. Serv. Comput. 2024 |
Methods — techniques the papers use, named apart from their topics
multi-layer perceptron · 1.5hypergraph auto-encoder · 1.5feature matching · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Feature Matching Machine for Cold-Start RecommendationabstractIn recommendation systems, the cold-start issue is a long-standing problem where no historical interaction records are given for certain users or items. Under this circumstance, recommendations for new users or new items become challenging. To address this problem, most existing approaches seek to discover a latent common space for users and items. However, these methods require a strong assumption that a shared space exists where the distributions of users and items are identical, which may limit the recommendation performance. In this article, we propose a novel model called Feature Matching Machine (FMM) to learn latent informative user and item representations. Different from previous methods, for warm users (or items), FMM learns two kinds of latent features, i.e., one is constructed by a hypergraph auto-encoder based on historical interactions between users and items, and the other is built by a multi-layer perceptron based on users (or items). Subsequently, FMM matches these two latent feature representations so as to discover the relationships across users (or items) and cold-start items (or users). We conduct extensive experiments on several real-world datasets and compare the proposed method with well-known baseline methods. Promising results demonstrate the effectiveness and efficiency of the proposed model. Hanrui Wu, Nuosi Li, Ka Ho Kwok, Xuheng Cai, Jia Zhang 0019, Jinyi Long, Michael Kwok-Po Ng |
IEEE Trans. Serv. Comput. | 3 |