Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
Fast Algorithm for Attributed Community Search
Shohei MatsuguHiroaki ShiokawaHiroyuki Kitagawa
Author information
JOURNALS FREE ACCESS

2021 Volume 29 Pages 188-196

Details
Abstract

Searching communities on attributed graphs has attracted much attention in recent years. The community search algorithm is currently an essential graph data management tool to find a community suited to a user-specified query node. Although community search algorithms are useful in various web-based applications and services, they have trouble handling attributed graphs due to the strict topological constraints of traditional algorithms. In this paper, we propose an accurate community search algorithm for attributed graphs. To relax the topological constraints, we proposed a new model of the community. And we defined the problem of finding them in an attributed graph class called the Flexible Attributed Truss Community (F-ATC). The F-ATC problem has the advantage of being applicable in many situations because it can explore diverse communities. Consequently, the community search accuracy is enhanced compared to traditional community search algorithms. Additionally, we present a novel heuristic algorithm to solve the F-ATC problem. This effective algorithm detects more accurate communities from attributed graphs than the traditional algorithms. For further optimization, we pre-processed the query response to make it faster. Finally, we conducted extensive experiments with real-world attributed graphs to demonstrate that our approach outperforms state-of-the-art methods.

Information related to the author
© 2021 by the Information Processing Society of Japan
Previous article Next article
feedback
Top