WEKO3
アイテム
グラフの木分割を用いたコミュニティ発見手法
https://ipsj.ixsq.nii.ac.jp/records/78291
https://ipsj.ixsq.nii.ac.jp/records/782915423ec22-ac58-441f-8297-815b1b6f7e36
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 2011 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | SIG Technical Reports(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2011-10-27 | |||||||
タイトル | ||||||||
タイトル | グラフの木分割を用いたコミュニティ発見手法 | |||||||
言語 | ||||||||
言語 | eng | |||||||
キーワード | ||||||||
主題Scheme | Other | |||||||
主題 | ソーシャルデータ | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
資源タイプ | technical report | |||||||
著者所属 | ||||||||
早稲田大学大学院情報生産システム研究科 | ||||||||
著者所属 | ||||||||
早稲田大学大学院情報生産システム研究科 | ||||||||
著者名 |
付興艶
× 付興艶
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | 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. | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | 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. | |||||||
書誌レコードID | ||||||||
収録物識別子タイプ | NCID | |||||||
収録物識別子 | AN10112482 | |||||||
書誌情報 |
研究報告データベースシステム(DBS) 巻 2011-DBS-153, 号 21, p. 1-8, 発行日 2011-10-27 |
|||||||
Notice | ||||||||
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
出版者 | ||||||||
言語 | ja | |||||||
出版者 | 情報処理学会 |