COMET: An Interactive Framework for Efficient and Effective Community Search via Active Learning

In recent years, substantial advancements in query-dependent community search (CS) have been driven by growing demands in various downstream applications such as social network analysis, fraud detection, bioinformatics, and others. They require methods to identify structurally cohesive communities that are dependent on specific queries. Learning-based interactive CS (ICS) models the search process as multiround with human interaction, enhancing its practicality. Nonetheless, learning-based approaches for ICS face two challenges. First, current methods for narrowing the search space rely on either query information or fixed topological structures, resulting in insufficient robustness when querying communities on large-scale graphs. Second, there is an absence of an effective interaction strategy in ICS, where the algorithm should offer users choices of highly uncertain nodes to iteratively refine search quality. To address these issues, we propose COMET, an interactive community search framework designed for large-scale graphs. COMET consists of three key modules: First, it features a community-aware subgraph module tailored to each specific query based on Personalized PageRank (PPR), considering both query information and topological structure. Second, we conceptualize ICS as a series of binary classification tasks, employing a graph neural network (GNN) to propagate label information within the candidate subgraph in each round. Finally, a novel active learning–based node selection module uses entropy from GNN and PPR from the subgraph module to dynamically select the most crucial nodes for labeling in each round. Extensive experimental evaluations demonstrate that COMET significantly outperforms state-of-the-art learning-based CS and ICS methods across eight real-world data sets. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: K. Wang was supported by the National Natural Science Foundation of China [Grants 72221001 and 62302294]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0834 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0834 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Authors

Institutions

Publication Details

Journal
INFORMS journal on computing
Published
2025-09-09
DOI
https://doi.org/10.1287/ijoc.2024.0834
Citations
1
Primary Topic
Innovative Teaching and Learning Methods
Type
article
Field-Weighted Citation Impact
3.44
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

COMET: An Interactive Framework for Efficient and Effective Community Search via Active Learning

Kunpeng Zhang, Xuemin Lin, Jianwei Wang, Kai Wang et al.
1 citations
INFORMS journal on computing
Innovative Teaching and Learning Methods
3.44
article

COMET: An Interactive Framework for Efficient and Effective Community Search via Active Learning

Kunpeng Zhang, Xuemin Lin, Jianwei Wang, Kai Wang, Jiawei Zhou
article en
1 citations

Abstract

In recent years, substantial advancements in query-dependent community search (CS) have been driven by growing demands in various downstream applications such as social network analysis, fraud detection, bioinformatics, and others. They require methods to identify structurally cohesive communities that are dependent on specific queries. Learning-based interactive CS (ICS) models the search process as multiround with human interaction, enhancing its practicality. Nonetheless, learning-based approaches for ICS face two challenges. First, current methods for narrowing the search space rely on either query information or fixed topological structures, resulting in insufficient robustness when querying communities on large-scale graphs. Second, there is an absence of an effective interaction strategy in ICS, where the algorithm should offer users choices of highly uncertain nodes to iteratively refine search quality. To address these issues, we propose COMET, an interactive community search framework designed for large-scale graphs. COMET consists of three key modules: First, it features a community-aware subgraph module tailored to each specific query based on Personalized PageRank (PPR), considering both query information and topological structure. Second, we conceptualize ICS as a series of binary classification tasks, employing a graph neural network (GNN) to propagate label information within the candidate subgraph in each round. Finally, a novel active learning–based node selection module uses entropy from GNN and PPR from the subgraph module to dynamically select the most crucial nodes for labeling in each round. Extensive experimental evaluations demonstrate that COMET significantly outperforms state-of-the-art learning-based CS and ICS methods across eight real-world data sets. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: K. Wang was supported by the National Natural Science Foundation of China [Grants 72221001 and 62302294]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0834 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0834 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

INFORMS journal on computing
Shanghai Jiao Tong University (CN), UNSW Sydney (AU), University of Maryland, College Park (US)
Openalex Percentile: Top 7%
Innovative Teaching and Learning Methods
3.44
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.