An effective method for community search in large directed attributed graphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Recently there is an increasing need for online community analysis on large scale graphs. Community search (CS), which can retrieve communities efficiently on a query request, has received significant research attention. However, existing CS methods leave edge direction and vertex attributes out of consideration, which results in poor performance of community accuracy and cohesiveness. In this paper, we propose DACQ (directed attribute community query), a novel framework of retrieving effective communities in directed attributed graphs. DACQ first supplements attributes according to the topological structure and generate attribute combinations, after which DACQ finds the strongly connected k-cores (k-SCS) with attributes in the directed graph. Finally, DACQ retrieves effective communities, which are cohesive in terms of the structure and attributes. Extensive experiments demonstrate the efficiency and effectiveness of our proposed algorithms in large scale directed attributed graphs.

Original languageEnglish
Title of host publicationMobile Ad-hoc and Sensor Networks - 13th International Conference, MSN 2017, Revised Selected Papers
EditorsLiehuang Zhu, Sheng Zhong
PublisherSpringer Verlag
Pages237-251
Number of pages15
ISBN (Print)9789811088896
DOIs
Publication statusPublished - 2018
Externally publishedYes
Event13th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2017 - Beijing, China
Duration: 17 Dec 201720 Dec 2017

Publication series

NameCommunications in Computer and Information Science
Volume747
ISSN (Print)1865-0929

Conference

Conference13th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2017
Country/TerritoryChina
CityBeijing
Period17/12/1720/12/17

Keywords

  • Attributed graph
  • Community search
  • Directed graph
  • Effective community

Fingerprint

Dive into the research topics of 'An effective method for community search in large directed attributed graphs'. Together they form a unique fingerprint.

Cite this