{"created":"2021-03-01T07:07:50.460230+00:00","id":29358,"links":{},"metadata":{"_buckets":{"deposit":"45c4e10e-70e0-4a8d-8a3f-073b15d17167"},"_deposit":{"created_by":188,"id":"29358","owners":[188],"pid":{"revision_id":0,"type":"depid","value":"29358"},"status":"published"},"_oai":{"id":"oai:tsukuba.repo.nii.ac.jp:00029358","sets":["3:2658:2662"]},"author_link":["101846","101847"],"item_11_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2013-07","bibliographicIssueDateType":"Issued"}}]},"item_11_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"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\nnodes. 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.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_11_publisher_27":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"University of Tsukuba. Graduate School of Systems and Information Engineering. Doctoral Program in Social Systems & Management","subitem_publisher_language":"en"}]},"item_11_relation_36":{"attribute_name":"シリーズ","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_language":"en","subitem_relation_name_text":"Department of Social Systems and Management Discussion Paper Series;no.1309"}]}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"IZUNAGA, Yoichi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"YAMAMOTO, Yoshitsugu","creatorNameLang":"en"},{"creatorName":"山本, 芳嗣","creatorNameLang":"ja"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2013-12-25"}],"displaytype":"detail","filename":"1309.pdf","filesize":[{"value":"252.4 kB"}],"format":"application/pdf","mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://tsukuba.repo.nii.ac.jp/record/29358/files/1309.pdf"},"version_id":"b6007447-572a-44e3-a19b-c6e2b7f06a57"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"technical report","resourceuri":"http://purl.org/coar/resource_type/c_18gh"}]},"item_title":"A cutting plane algorithm for Modularity maximization with heuristics for separation problem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A cutting plane algorithm for Modularity maximization with heuristics for separation problem","subitem_title_language":"en"}]},"item_type_id":"11","owner":"188","path":["2662"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2013-09-11"},"publish_date":"2013-09-11","publish_status":"0","recid":"29358","relation_version_is_last":true,"title":["A cutting plane algorithm for Modularity maximization with heuristics for separation problem"],"weko_creator_id":"188","weko_shared_id":-1},"updated":"2024-03-21T04:17:58.525806+00:00"}