著者

仲田 圭佑 村田 剛志

出版者

人工知能学会

雑誌

人工知能学会全国大会論文集 (ISSN:13479881)

巻号頁・発行日

vol.28, 2014

---

近年,爆発的に普及したソーシャルメディアや生体内の化学反応の連鎖などをグラフ理論に基づいて解析する手法が数多く提案されてきた.しかしその多くは教師なし学習であり,データの背後に存在する知識を活用していなかったため,半教師付き学習により背景知識を利用する方法が提案された.この発表では半教師付き学習を用いたネットワーク構造のコミュニティ抽出手法の高速化およびユーザとの対話的環境について考察する.

著者

仲田 圭佑 村田 剛志

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.30, no.1, pp.96-101, 2015-01-06 (Released:2015-01-06)

参考文献数

12

被引用文献数

1

---

Recent development of information technology and rise of social media enable us to access massive data. Large scale data such as hyperlink structure in WWW and friendship information in social media can be represented as networks based on graph theory. For analyzing such data, many methods have been proposed. Among them, the methods called community detection have advantages that they can make networks simple and easy to understand. However, most of them had not considered the background knowledge of data, thus some methods called constrained community detection which take such background knowledge into consideration have been proposed. Constrained community detection methods show robust performance on noisy data due to its background knowledge. In particular, constrained Hamiltonian-based community detection methods have advantages such as flexibility of output results. The Hamiltonian, energy in statistical mechanics, can be theoretically considered as a generalization of the Newman's modularity. In this paper, we propose a method for accelerating constrained community detection based on Hamiltonian. Our proposed method is a variant of Blondel's Louvain method which is known for its computational efficiency. We experimentally show that the proposed method is superior to the existing method based on simulated annealing in terms of computational efficiency, and its accuracy is as well as the existing method under the same conditions. Our method enables us to perform constrained community detection for larger networks compared with the existing method.