ESC: Edge-attributed Skyline Community Search in Large-scale Bipartite Graphs

• Published in: arXiv.org 2024-01
• Main Authors: Guo, Fangda, Luo, Xuanpu, Liu, Yanghao, Chen, Guoxin, Wang, Yongqing, Shen, Huawei, Cheng, Xueqi
• Format: Article
• Language: English
• Subjects: Apexes; Codes; Graph theory; Graphs; Search algorithms; Upper bounds
• ISSN: 2331-8422

Due to the ability of modeling relationships between two different types of entities, bipartite graphs are naturally employed in many real-world applications. Community Search in bipartite graphs is a fundamental problem and has gained much attention. However, existing studies focus on measuring the structural cohesiveness between two sets of vertices, while either completely ignoring the edge attributes or only considering one-dimensional importance in forming communities. In this paper, we introduce a novel community model, named edge-attributed skyline community (ESC), which not only preserves the structural cohesiveness but unravels the inherent dominance brought about by multi-dimensional attributes on the edges of bipartite graphs. To search the ESCs, we develop an elegant peeling algorithm by iteratively deleting edges with the minimum attribute in each dimension. In addition, we also devise a more efficient expanding algorithm to further reduce the search space and speed up the filtering of unpromising vertices, where a upper bound is proposed and proven. Extensive experiments on real-world large-scale datasets demonstrate the efficiency, effectiveness, and scalability of the proposed ESC search algorithms. A case study was conducted to compare with existing community models, substantiating that our approach facilitates the precision and diversity of results.