{"created":"2025-01-19T01:15:34.984136+00:00","updated":"2025-01-19T16:28:09.753914+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214785","sets":["6504:10735:10806"]},"path":["10806"],"owner":"44499","recid":"214785","title":["空間Web上のmCK検索問題における代表解の探索"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-04"},"_buckets":{"deposit":"2096ab76-f3c4-4b0d-ac8a-1bdcafd7808a"},"_deposit":{"id":"214785","pid":{"type":"depid","value":"214785","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"空間Web上のmCK検索問題における代表解の探索","author_link":["552197","552196","552195","552198","552199"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"空間Web上のmCK検索問題における代表解の探索"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"データとウェブ","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2021-03-04","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電通大"},{"subitem_text_value":"電通大"},{"subitem_text_value":"電通大"},{"subitem_text_value":"電通大"},{"subitem_text_value":"電通大"}]},"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/214785/files/IPSJ-Z83-4L-06.pdf","label":"IPSJ-Z83-4L-06.pdf"},"date":[{"dateType":"Available","dateValue":"2021-12-28"}],"format":"application/pdf","filename":"IPSJ-Z83-4L-06.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"1e4193a1-3b57-4c86-85c2-c7bb822fd7eb","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"西野, 良介"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"津野, 貴大"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大森, 匡"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"藤田, 秀之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"新谷, 隆彦"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"緯度経度情報つきのWebデータを用いた情報抽出は最近のデータベース研究の話題の一つであり，その一つにmCK検索がある．mCK検索とはキーワードm個の入力Qを与えたとき，Qを満たす高々m個のオブジェクト集合のうち、その要素の相互近接度が最も高い集合を求める問題である． mCK問題はオブジェクト組を答えとするため，相互近接度が小さい順にk個の解を列挙すると，地図上の一か所に解が集まりやすい．これを解決するため，本稿では，キーワードを満たすデータ集合から代表点を選び，その代表点を使ったmCKの代表解を列挙して空間上の解の出現場所のばらつきを向上させる手法を示す．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"358","bibliographic_titles":[{"bibliographic_title":"第83回全国大会講演論文集"}],"bibliographicPageStart":"357","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2021"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214785,"links":{}}