Exploring communities in large profiled graphs

Exploring communities in large profiled graphs

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,...

Full description

Saved in:
Bibliographic Details
Main Authors: Chen, Yankai, Fang, Yixiang, Cheng, Reynold, Li, Yun, Chen, Xiaojun, Zhang, Jie
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2020
Subjects:
Engineering::Computer science and engineering
Community Search
Social Networks
Online Access:https://hdl.handle.net/10356/140797
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English

Internet

https://hdl.handle.net/10356/140797

Similar Items