{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00011133","sets":["581:651:655"]},"path":["655"],"owner":"1","recid":"11133","title":["クロスエントロピー最小化に基づくネットワークデータの埋め込み"],"pubdate":{"attribute_name":"公開日","attribute_value":"2003-09-15"},"_buckets":{"deposit":"e3fb4e6c-76c3-49b5-a118-d563c0953076"},"_deposit":{"id":"11133","pid":{"type":"depid","value":"11133","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"クロスエントロピー最小化に基づくネットワークデータの埋め込み","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"クロスエントロピー最小化に基づくネットワークデータの埋め込み"},{"subitem_title":"Embedding Network Data based on Cross-Entropy Minimization","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2003-09-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTTコミュニケーション科学基礎研究所"},{"subitem_text_value":"NTTコミュニケーション科学基礎研究所"},{"subitem_text_value":"NTTコミュニケーション科学基礎研究所"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"},{"subitem_text_value":"NTT Communication Science Laboratories","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/11133/files/IPSJ-JNL4409013.pdf"},"date":[{"dateType":"Available","dateValue":"2005-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4409013.pdf","filesize":[{"value":"1.3 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"b19ec864-7a07-4906-82ef-d6db0df0f539","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2003 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山田, 武士"},{"creatorName":"斉藤, 和己"},{"creatorName":"上田, 修功"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takeshi, Yamada","creatorNameLang":"en"},{"creatorName":"Kazumi, Saito","creatorNameLang":"en"},{"creatorName":"Naonori, Ueda","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ネットワークで表現されたデータを低次元ユークリッド空間へ埋め込む新たな方法を提案する．本手法では，ネットワークの隣接行列が定義するノード間の離散類似度と，現在の埋め込み配置から導かれる連続類似度との間のクロスエントロピーを最小にすることによって最適な配置を求める．さらに，与えられた埋め込みにおいてにおいて，ノードの接続関係がいかに忠実に再現されているかを定量的に評価する新たな評価尺度を提案する．最後に実際のネットワークデータを用いた実験によって，本手法の有効性を検証した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We present a novel approach to embed  network data into a low dimensional Euclidean space. Theproposed method attempts to minimize cross-entropy between the discrete node similarity measure induced by theadjacency matrix and the continuous node similarity function derivedfrom current embedded node positions.We also propose a natural criterion to effectively evaluate an embeddednetwork layout in terms of how well node connectivities are preserved.Experiments using real network data show the effectiveness of theproposed method.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2408","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2401","bibliographicIssueDates":{"bibliographicIssueDate":"2003-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"44"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"知識処理"}]},"weko_creator_id":"1"},"id":11133,"updated":"2025-01-23T02:25:03.402205+00:00","links":{},"created":"2025-01-18T22:45:50.955072+00:00"}