グラフの木分割を用いたコミュニティ発見手法
スポンサーリンク
概要
- 論文の詳細を見る
A number of researches in graph mining have been devoted in the discovery of communities. In this report, we study a query-dependent variant of the community-detection problem based on the tree decomposition methodology. In the tree decomposition of a graph, each tree node is labeled with a set of graph vertices, and each clique in the graph is always contained by a tree node. Also, tree nodes containing an identical graph vertex are always connected. Using such properties, we discuss an algorithm that finds a community that contains a given query node. By pre-computing tree decomposition, the task of finding a community can be reduced. We show the experimental results on community detection over real data sets.
- 2011-10-27
論文 | ランダム
- 個人から考える「文化」・「社会」--ラング・パロール往還文化論の実践
- ラング・パロール往還文化論序説--新しい「日本事情」教育の可能性
- MEGA Studyの実際と今後の活用 (特集 臨床研究・大規模研究の進め方)
- セルモールドの採用の事例 (特集 家電製品の包装)
- 日本発の大規模臨床試験--MEGA Study (特集/我が国の虚血性心臓病 心筋梗塞と狭心症の診療の進歩)