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

Xincan Yu

dblp:363/8709 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › structured data mining › graph mining
community detection
0.912025
Tracking Latent Communities Evolution with Hierarchical Edge Partition Models · ICDM 2025
Data mining › structured data mining › graph mining › community detection
dynamic community detection
0.912025
Tracking Latent Communities Evolution with Hierarchical Edge Partition Models · ICDM 2025
Data mining › structured data mining › graph mining › dynamic network analysis
dynamic network model
0.912025
Tracking Latent Communities Evolution with Hierarchical Edge Partition Models · ICDM 2025
Data mining
pattern mining
0.912025
Tracking Latent Communities Evolution with Hierarchical Edge Partition Models · ICDM 2025

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

poisson-gamma edge partition model · 0.9hierarchical transition kernel · 0.9hierarchical graph prior · 0.9
YearPublicationVenuePosition
2025 Tracking Latent Communities Evolution with Hierarchical Edge Partition Models
abstract
A novel dynamic network model is proposed to capture evolving latent communities within temporal networks. To achieve this, we decompose each observed dynamic edge between vertices using a Poisson-gamma edge partition model, assigning each vertex to one or more latent communities through nonnegative vertex-community memberships. Specifically, hierarchical transition kernels are employed to model the interactions between these latent communities. A hierarchical graph prior is placed on the transition structure of the latent communities, allowing us to model how they evolve and interact over time. Consequently, our dynamic network model enables the inferred community structure to merge, split, and interact with one another, providing a comprehensive understanding of complex network dynamics. Experiments on various real-world network datasets demonstrate that the proposed model not only effectively uncovers interpretable latent structures but also surpasses other state-of-the-art dynamic network models in the tasks of link prediction and community detection.
Xincan Yu, Hao Liao, Sikun Yang
ICDM1