{"updated":"2025-01-19T10:45:22.289077+00:00","links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00231458","sets":["1164:2735:11166:11409"]},"path":["11409"],"owner":"44499","recid":"231458","title":["離散型マルコフ連鎖を用いたエルゴード的拠点ネットワーク構築アルゴリズムの提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-12-04"},"_buckets":{"deposit":"94fe174a-28de-4208-8cef-424cea947c8d"},"_deposit":{"id":"231458","pid":{"type":"depid","value":"231458","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"離散型マルコフ連鎖を用いたエルゴード的拠点ネットワーク構築アルゴリズムの提案","author_link":["624842","624841","624848","624843","624846","624845","624847","624844"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"離散型マルコフ連鎖を用いたエルゴード的拠点ネットワーク構築アルゴリズムの提案"},{"subitem_title":"Algorithm for Constructing Ergodic Location Networks using Discrete Markov Chains","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2023-12-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"順天堂大学"},{"subitem_text_value":"順天堂大学"},{"subitem_text_value":"神奈川工業大学"},{"subitem_text_value":"静岡理工科大学"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/231458/files/IPSJ-MPS23146004.pdf","label":"IPSJ-MPS23146004.pdf"},"date":[{"dateType":"Available","dateValue":"2025-12-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS23146004.pdf","filesize":[{"value":"1.5 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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"118026a7-ee5a-4f09-9c74-0b8fe8ce63e4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"水野, 信也"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大場, 春佳"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"定国, 伸吾"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"松田, 崇"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shinya, Mizuno","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Haruka, Ohba","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shingo, Sadakuni","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takashi, Matsuda","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本研究では，離散型マルコフ連鎖に対してエルゴード性を持つためのアルゴリズムをネットワーク中心性との関係を用いて提案した．複数のネットワーク中心性定義を利用して，エルゴード性を持つためまでの計算回数を比較し，対象ネットワークに対するネットワーク中心性の選択が可能となった．提案手法によって，ネットワーク内の中心的な拠点が明らかになり，どの拠点間推移確率を変更すればエルゴード的なネットワークになるかが明確になる．拠点ネットワークがエルゴード性を持てば，このマルコフ連鎖の定常分布が存在し，最適化の応用も期待できる．また数値計算によって，様々なネットワークに対応できることを示した．さらに WiFi ログを用いて，アクセスポイントを拠点としたネットワークに対しても，提案手法によってエルゴード性を持つようなネットワークを再構築できることを確認し，提案手法の社会応用での観点でも応用可能と示した．提案手法は，施設運営，観光活性化など現代社会における多様なネットワークの分析に利用可能である．施設運営では，人の動線管理や滞在分析に活用可能である．観光活性化では，観光地を拠点とし，分断されない観光ネットワークを構築するために，どの経路を充実すべきかが明確になり，包括的な観光ネットワークの構築と運営が可能となる．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-12-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"2023-MPS-146"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":231458,"created":"2025-01-19T01:31:46.501168+00:00"}