Discovering personalized characteristic communities in attributed graphs

• المؤلفون الرئيسيون: NIU, Yudong, LI, Yuchen, KARRAS, Panagiotis, WANG, Yanhao, LI, Zhao
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2024
• الموضوعات: Databases and Information Systems; Numerical Analysis and Scientific Computing
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/9335; https://ink.library.smu.edu.sg/context/sis_research/article/10335/viewcontent/PersonalizedCharComm_AG_av.pdf

What is the widest community in which a person exercises a strong impact? Although extensive attention has been devoted to searching communities containing given individuals, the problem of finding their unique communities of influence has barely been examined. In this paper, we study the novel problem of Characteristic cOmmunity Discovery (COD) in attributed graphs. Our goal is to identify the largest community, taking into account the query attribute, in which the query node has a significant impact. The key challenge of the COD problem is that it requires evaluating the influence of the query node over a large number of hierarchically structured communities. We first propose a novel compressed COD evaluation approach to accelerate the influence estimation by eliminating redundant computations for overlapping communities. Then, we further devise a local hierarchical reclustering method to alleviate the skewness of hierarchical communities generated by global clustering for a specific query attribute. Extensive experiments confirm the effectiveness and efficiency of our solutions to COD: they find characteristic communities better than existing community search methods by several quality measures and achieve up to 25 x speedups against well-crafted baselines.