Bingchen Fan — accepted AI-conference papers

2025

An Information-theoretic Perspective of Hierarchical Clustering on Graphs

Yicheng Pan, Bingchen Fan, Pengyu Long, Feng Zheng

UAI 2025

The seminal work of \citep{dasgupta2016cost} has introduced a combinatorial cost function for hierarchical graph clustering that has inspired numerous follow-up studies adopting similar combinatorial approaches. In this paper, we investigate this problem from the \emph{information-theoretic} perspec

Cited by 0 Source ↗PDF ↗code ↗Scholar ↗

2025

Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability

Yicheng Pan, Renjie Chen, Pengyu Long, Bingchen Fan

ICML 2025poster

Overlap and hierarchy are two prevalent phenomena in clustering, and usually coexist in a single system. There are several studies on each of them separately, but it is unclear how to characterize and evaluate the hybrid structures yet. To address this issue, we initiate the study of hierarchical ov…

Cited by 0 Source ↗PDF ↗Scholar ↗