Querying Intimate-Core Groups in Weighted Graphs

Dong Zheng, Jianquan Liu, Rong Hua Li, Cigdem Aslay, Yi Cheng Chen, Xin Huang

研究成果: 書貢獻/報告類型會議論文篇章同行評審

14 引文 斯高帕斯(Scopus)


The semantic intimacy of relations in many real-world networks (e.g., social, biological, and communication networks) can be modeled by weighted edges in which the more semantically intimate relations between the nodes translate to smaller edge weights. Recently, the problem of community search that aims to find the cohesive groups containing a given set of query nodes has attracted a great deal of attention. However, the bulk of literature on community search problem assumes a simple unweighted input graph, ignoring how semantically intimate the nodes have in retrieved communities. The discovered communities may have a highly cohesive structure, while they perform poorly in the semantic of intimate connections. In this paper, we investigate a novel problem of Querying Intimate-Core Groups (QICG): Given a weighted undirected graph G, a set of query nodes Q and a positive integer k, to find a connected subgraph of G in which each node has at least k neighbors, and the sum of weights on its edges is minimum among all such subgraphs. We show that the QICG problem is NP-hard. We develop efficient algorithms based on several practical heuristic strategies to enhance the retrieval efficiency. Extensive experiments are conducted on real-world datasets to evaluate efficiency and effectiveness of proposed algorithms. The results confirm that our intimate-core group model outperforms state-of-the-art models in weighted graphs.

主出版物標題Proceedings - IEEE 11th International Conference on Semantic Computing, ICSC 2017
發行者Institute of Electrical and Electronics Engineers Inc.
出版狀態已出版 - 29 3月 2017
事件11th IEEE International Conference on Semantic Computing, ICSC 2017 - San Diego, United States
持續時間: 30 1月 20171 2月 2017


名字Proceedings - IEEE 11th International Conference on Semantic Computing, ICSC 2017


???event.eventtypes.event.conference???11th IEEE International Conference on Semantic Computing, ICSC 2017
國家/地區United States
城市San Diego


深入研究「Querying Intimate-Core Groups in Weighted Graphs」主題。共同形成了獨特的指紋。