{"created":"2025-01-19T01:19:53.864117+00:00","updated":"2025-01-19T14:45:42.804018+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00219840","sets":["1164:3865:10834:10975"]},"path":["10975"],"owner":"44499","recid":"219840","title":["複数の経路から利用者所望の経路を作成する乗換案内インタフェース"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-08-29"},"_buckets":{"deposit":"569a17ba-d50c-4513-93fd-5fcef80789b5"},"_deposit":{"id":"219840","pid":{"type":"depid","value":"219840","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"複数の経路から利用者所望の経路を作成する乗換案内インタフェース","author_link":["573859","573860"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"複数の経路から利用者所望の経路を作成する乗換案内インタフェース"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウエア・システム","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2022-08-29","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"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/219840/files/IPSJ-MBL22104023.pdf","label":"IPSJ-MBL22104023.pdf"},"date":[{"dateType":"Available","dateValue":"2024-08-29"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MBL22104023.pdf","filesize":[{"value":"3.1 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":"35"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"833e7608-4b15-420b-80da-10f13c7f40b5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11851388","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-8817","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"既存の乗換案内サービスの多くは，時間が早い順，料金が安い順，乗り換え回数が少ない順の 3 つの指標の中から選択された 1 つの指標をもとに移動が単純である効率的な経路が利用者に提示されるようになっている．しかし，全ての利用者が効率的な経路を求めているわけではなく，移動が複雑になってでも非効率的な経路を求める場面も考えられる．そこで本研究では，地図上で複数の経路を選択肢として比較表示することで利用者自身で任意の1経路を作成できる乗換案内インタフェースの提案を行う．検索した経路内から別路線への乗り換え可能な駅を表示し，その駅に乗り入れする路線を全て比較表示することで，利用者自身が利用したいと考える区間のみで構成される経路を作成できるようなインタフェースになっている．提案した再検索を行うインタフェースがどのような経路の条件で有用なのかを評価実験を行うことで明らかにする．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告モバイルコンピューティングとパーベイシブシステム（MBL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-08-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"23","bibliographicVolumeNumber":"2022-MBL-104"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":219840,"links":{}}