WEKO3
アイテム
A cutting plane algorithm for Modularity maximization with heuristics for separation problem
http://hdl.handle.net/2241/119693
http://hdl.handle.net/2241/119693ff5267eb-6363-4676-b658-131164eaecd5
名前 / ファイル | ライセンス | アクション |
---|---|---|
1309.pdf (252.4 kB)
|
|
Item type | Technical Report(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2013-09-11 | |||||
タイトル | ||||||
タイトル | A cutting plane algorithm for Modularity maximization with heuristics for separation problem | |||||
言語 | en | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||
資源タイプ | technical report | |||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
著者 |
IZUNAGA, Yoichi
× IZUNAGA, Yoichi× 山本, 芳嗣 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | The modularity proposed by Newman and Girvan is the most commonly used measure when the nodes of a graph are grouped into communities consisting of tightly connected nodes. We formulate the modularity maximization problem as a set partitioning problem, and propose an algorithm for the problem based on the linear programming relaxation. We solve the dual of the linear programming relaxation by using a cutting plane method. To mediate the slow convergence that cutting plane methods usually suffer, we propose a method for finding and simultaneously adding multiple cutting planes which may complement well each other. |
|||||
言語 | en | |||||
書誌情報 |
発行日 2013-07 |
|||||
出版者 | ||||||
出版者 | University of Tsukuba. Graduate School of Systems and Information Engineering. Doctoral Program in Social Systems & Management | |||||
言語 | en | |||||
シリーズ | ||||||
言語 | en | |||||
関連名称 | Department of Social Systems and Management Discussion Paper Series;no.1309 |