WEKO3
アイテム
{"_buckets": {"deposit": "6a964cfe-7193-4adf-9f43-9f5a39cb912f"}, "_deposit": {"created_by": 13, "id": "8850", "owners": [13], "pid": {"revision_id": 0, "type": "depid", "value": "8850"}, "status": "published"}, "_oai": {"id": "oai:uec.repo.nii.ac.jp:00008850", "sets": ["6"]}, "author_link": ["24034", "24035", "24036"], "control_number": "8850", "item_10001_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2017-11-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "11", "bibliographicPageEnd": "939", "bibliographicPageStart": "934", "bibliographicVolumeNumber": "J100-B", "bibliographic_titles": [{"bibliographic_title": "電子情報通信学会論文誌 B", "bibliographic_titleLang": "ja"}]}]}, "item_10001_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "本論文はグラフの各点の媒介中心性を求める計算手法を提案する.それは次数が1である点をグラフから除き,圧縮されたグラフで計算する.提案手法が,従来の手法の次数が1である点が存在するグラフで生じる冗長な計算を回避し,計算量を削減することを示す.", "subitem_description_type": "Abstract"}, {"subitem_description": "This paper proposes a computation method to find a betweenness centrality of each vertex of a graph. The method compresses the original graph by removing vertices whose degree is one from the graph. The betweenness centrality is then calculated from the compressed graph. This avoids avoid blackundancy of the computation in the conventional method without the graph compression. As a result, the calculation time is blackuced.", "subitem_description_type": "Abstract"}]}, "item_10001_publisher_8": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "電子情報通信学会"}]}, "item_10001_relation_14": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "10.14923/transcomj.2017JBL4011", "subitem_relation_type_select": "DOI"}}]}, "item_10001_relation_17": {"attribute_name": "関連サイト", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "http://search.ieice.org/index.html", "subitem_relation_type_select": "URI"}}]}, "item_10001_rights_15": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright © 2017 IEICE"}]}, "item_10001_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1881-0209", "subitem_source_identifier_type": "ISSN"}]}, "item_10001_version_type_20": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "荒巻, 和治", "creatorNameLang": "ja"}, {"creatorName": "アラマキ, カズハル", "creatorNameLang": "ja-Kana"}, {"creatorName": "ARAMAKI, Kazuharu", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "24034", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "キットスワン, ナッタポン", "creatorNameLang": "ja"}, {"creatorName": "KITSUWAN, Nattapong", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "24035", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "大木, 英司", "creatorNameLang": "ja"}, {"creatorName": "オオキ, エイジ", "creatorNameLang": "ja-Kana"}, {"creatorName": "OKI, Eiji", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "24036", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2019-01-11"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "j100-b_11_934.pdf", "filesize": [{"value": "319.8 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 319800.0, "url": {"label": "j100-b_11_934", "url": "https://uec.repo.nii.ac.jp/record/8850/files/j100-b_11_934.pdf"}, "version_id": "1c3440d9-13cd-4caa-9bde-a40f4915fe42"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "媒介中心性", "subitem_subject_scheme": "Other"}, {"subitem_subject": "グラフ解析", "subitem_subject_scheme": "Other"}, {"subitem_subject": "グラフ圧縮", "subitem_subject_scheme": "Other"}, {"subitem_subject": "通信ネットワーク", "subitem_subject_scheme": "Other"}, {"subitem_subject": "betweenness centrality", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "graph analytics", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "graph compression", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}, {"subitem_subject": "communication network", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "グラフ圧縮による媒介中心性の計算手法", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "グラフ圧縮による媒介中心性の計算手法", "subitem_title_language": "ja"}, {"subitem_title": "Computation Method for Betweenness Using Graph Compression", "subitem_title_language": "en"}]}, "item_type_id": "10001", "owner": "13", "path": ["6"], "permalink_uri": "https://uec.repo.nii.ac.jp/records/8850", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2019-01-11"}, "publish_date": "2019-01-11", "publish_status": "0", "recid": "8850", "relation": {}, "relation_version_is_last": true, "title": ["グラフ圧縮による媒介中心性の計算手法"], "weko_shared_id": -1}
グラフ圧縮による媒介中心性の計算手法
https://uec.repo.nii.ac.jp/records/8850
https://uec.repo.nii.ac.jp/records/8850c50d2769-0bc7-4017-9a7b-adca22eaa943
名前 / ファイル | ライセンス | アクション |
---|---|---|
j100-b_11_934 (319.8 kB)
|
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2019-01-11 | |||||
タイトル | ||||||
言語 | ja | |||||
タイトル | グラフ圧縮による媒介中心性の計算手法 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Computation Method for Betweenness Using Graph Compression | |||||
言語 | ||||||
言語 | jpn | |||||
キーワード | ||||||
主題 | 媒介中心性 | |||||
キーワード | ||||||
主題 | グラフ解析 | |||||
キーワード | ||||||
主題 | グラフ圧縮 | |||||
キーワード | ||||||
主題 | 通信ネットワーク | |||||
キーワード | ||||||
言語 | en | |||||
主題 | betweenness centrality | |||||
キーワード | ||||||
言語 | en | |||||
主題 | graph analytics | |||||
キーワード | ||||||
言語 | en | |||||
主題 | graph compression | |||||
キーワード | ||||||
言語 | en | |||||
主題 | communication network | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
著者 |
荒巻, 和治
× 荒巻, 和治× キットスワン, ナッタポン× 大木, 英司 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | 本論文はグラフの各点の媒介中心性を求める計算手法を提案する.それは次数が1である点をグラフから除き,圧縮されたグラフで計算する.提案手法が,従来の手法の次数が1である点が存在するグラフで生じる冗長な計算を回避し,計算量を削減することを示す. | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | This paper proposes a computation method to find a betweenness centrality of each vertex of a graph. The method compresses the original graph by removing vertices whose degree is one from the graph. The betweenness centrality is then calculated from the compressed graph. This avoids avoid blackundancy of the computation in the conventional method without the graph compression. As a result, the calculation time is blackuced. | |||||
書誌情報 |
ja : 電子情報通信学会論文誌 B 巻 J100-B, 号 11, p. 934-939, 発行日 2017-11-01 |
|||||
出版者 | ||||||
出版者 | 電子情報通信学会 | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1881-0209 | |||||
DOI | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | DOI | |||||
関連識別子 | 10.14923/transcomj.2017JBL4011 | |||||
権利 | ||||||
権利情報 | Copyright © 2017 IEICE | |||||
関連サイト | ||||||
識別子タイプ | URI | |||||
関連識別子 | http://search.ieice.org/index.html | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 |