Demo Data from SIGIR 2026 / reviewers in the wild / expert
Albert Jiongqian Liang
dblp:348/6498
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-3794-5393ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, 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 |
Information retrieval · 100% | |
| Artificial intelligence
1 paper |
Graph learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
sparse feature learning |
0.7 | 1 | 2023 | HyperFormer: Learning Expressive Sparse Feature Representations via Hypergraph Transformer · SIGIR 2023 |
Machine learning › Graph learning
hypergraph learning |
0.2 | 1 | 2023 | HyperFormer: Learning Expressive Sparse Feature Representations via Hypergraph Transformer · SIGIR 2023 |
Methods — techniques the papers use, named apart from their topics
message passing · 1.3hypergraph transformer · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | HyperFormer: Learning Expressive Sparse Feature Representations via Hypergraph TransformerabstractLearning expressive representations for high-dimensional yet sparse features has been a longstanding problem in information retrieval. Though recent deep learning methods can partially solve the problem, they often fail to handle the numerous sparse features, particularly those tail feature values with infrequent occurrences in the training data. Worse still, existing methods cannot explicitly leverage the correlations among different instances to help further improve the representation learning on sparse features since such relational prior knowledge is not provided. To address these challenges, in this paper, we tackle the problem of representation learning on feature-sparse data from a graph learning perspective. Specifically, we propose to model the sparse features of different instances using hypergraphs where each node represents a data instance and each hyperedge denotes a distinct feature value. By passing messages on the constructed hypergraphs based on our Hypergraph Transformer (HyperFormer), the learned feature representations capture not only the correlations among different instances but also the correlations among features. Our experiments demonstrate that the proposed approach can effectively improve feature representation learning on sparse features. Kaize Ding, Albert Jiongqian Liang, Bryan Perozzi, Lichan Hong, Ed H. Chi, Huan Liu 0001, Zhiyuan Cheng 0002 |
SIGIR | 2 |