Exploring communities in large profiled graphs

• المؤلفون الرئيسيون: Chen, Yankai, Fang, Yixiang, Cheng, Reynold, Li, Yun, Chen, Xiaojun, Zhang, Jie
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2020
• الموضوعات: Engineering::Computer science and engineering; Community Search; Social Networks
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/140797
• المؤسسة: Nanyang Technological University

Given a graph G and a vertex q∈G, the community search (CS) problem aims to efficiently find a subgraph of G whose vertices are closely related to q. Communities are prevalent in social and biological networks, and can be used in product advertisement and social event recommendation. In this paper,...