Efficient and effective (k, P)-core-based community search over attributed heterogeneous information networks

Yuxiang Wang, Chengjie Gu, Xiaoliang Xu, Xinjun Zeng, Xiangyu Ke, Tianxing Wu

Abstract: Highlights•We define a CS-AHIN problem based on (k,P)<math><mo stretchy="false" is="true">(</mo><mi is="true">k</mi><mo is="true">,</mo><mi is="true">P</mi><mo stretchy="false" is="true">)</mo></math>-core model, which is NP-hard.•We present a general greedy search framework with three efficient heuristic methods.•We improve heuristic methods via a cohesiveness-aware index atop proximity graph.•Extensive experiments show our method's superiority in effectiveness and efficiency.