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

Haolan Zuo

dblp:363/9509 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0000-9175-1392ORCID · reported

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 2021Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
2 papers
Graph learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph representation learning
graph encoding
1.012026
Towards A Universal Graph Structural Encoder · WWW 2026
Machine learning › Graph learning
graph representation learning
1.012026
Towards A Universal Graph Structural Encoder · WWW 2026
Machine learning › Graph learning
hypergraph learning
0.812024
Learning High-Order Relationships of Brain Regions · ICML 2024
Medical and health informatics › neuroimaging
brain connectivity
0.812024
Learning High-Order Relationships of Brain Regions · ICML 2024
Medical and health informatics › neuroimaging
neuroimaging analysis
0.812024
Learning High-Order Relationships of Brain Regions · ICML 2024

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

multi-head drop-bottleneck · 1.5information bottleneck · 1.5graph neural network · 1.0
YearPublicationVenuePosition
2026 Towards A Universal Graph Structural Encoder
Haolan Zuo, Haoyu Wang 0004, Siqi Miao 0001, Pan Li 0005, Rex Ying
WWW2
2024 Learning High-Order Relationships of Brain Regions
abstract
Discovering reliable and informative relationships among brain regions from functional magnetic resonance imaging (fMRI) signals is essential in phenotypic predictions in neuroscience. Most of the current methods fail to accurately characterize those interactions because they only focus on pairwise connections and overlook the high-order relationships of brain regions. We propose that these high-order relationships should be *maximally informative and minimally redundant* (MIMR). However, identifying such high-order relationships is challenging and under-explored due to the exponential search space and the absence of a tractable objective. In response to this gap, we propose a novel method named HyBRiD, which aims to extract MIMR high-order relationships from fMRI data. HyBRiD employs a Constructor to identify hyperedge structures, and a Weighter to compute a weight for each hyperedge, which avoids searching in exponential space. HyBRiD achieves the MIMR objective through an innovative information bottleneck framework named multi-head drop-bottleneck with theoretical guarantees. Our comprehensive experiments demonstrate the effectiveness of our model. Our model outperforms the state-of-the-art predictive model by an average of 11.2%, regarding the quality of hyperedges measured by CPM, a standard protocol for studying brain connections.
Weikang Qiu, Huangrui Chu, Selena Wang, Haolan Zuo, Yize Zhao, Rex Ying
ICML4