Overlappping Community discovery based on Line Graph
| Project/Area Number |
18K11436
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Review Section |
Basic Section 61030:Intelligent informatics-related
|
|---|
| Research Institution | Nara Women's University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2018-04-01 – 2023-03-31
|
| Project Status |
Completed (Fiscal Year 2022)
|
| Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2020: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2019: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Fiscal Year 2018: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Keywords | 情報工学 / 機械学習 / 社会ネットワーク分析 / コミュニティ発見 |
|---|
| Outline of Final Research Achievements |
In order to cope with increasing quantity and variety of data, it is important to develop information technology which enables effective use of network data. We have developed a method for overlappping community discovery based on the line graph in graph theory. In the developed method, the relationship among nodes is represented as a line graph in graph theory, and the weights of the line graph is defined based on the weights in the original network. Under the framework of optimization learning, we have developed a overlapping community discovery algorithm based on the representation matrix of the given network. The algorithm has been implemented as a prototype system, and experiments over the prototype system were conducted over several real-world datasets. The results indicate the effectiveness of the developed learning method.
|
| Academic Significance and Societal Importance of the Research Achievements |
従来のアプローチではノードをそれぞれコミュニティに割り当てるノード分割を行うため，各ノードはひとつのコミュニティにしか所属できないという課題があった．しかし，実世界のネットワークにおいては，ノードに対応するユーザは関心や興味に応じて複数のコミュニティに所属することも多い．そこで，本研究ではノードやメッセージなどの内容ではなくネットワークの構造に基づいてリンクをコミュニティに割り当て，リンクの端点となるノードは接続するリンクが割り当てられたコミュニティにそれぞれ所属するとみなすことにより，ネットワークのリンク分割に基づく多重コミュニティ発見の実現に取り組んだ．
|
Report
(6 results)
Research Products
(4 results)
