{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00177446","sets":["1164:2735:9079:9080"]},"path":["9080"],"owner":"11","recid":"177446","title":["Linked Dataにおけるリンク切れ自動修復フレームワークの提案と評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-02-20"},"_buckets":{"deposit":"0b2e83e2-6305-4f98-9c7a-2b61f97d5734"},"_deposit":{"id":"177446","pid":{"type":"depid","value":"177446","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Linked Dataにおけるリンク切れ自動修復フレームワークの提案と評価","author_link":["376567","376565","376562","376563","376568","376560","376566","376564","376561","376559"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Linked Dataにおけるリンク切れ自動修復フレームワークの提案と評価"},{"subitem_title":"A Framework for Restoring Broken Links of Linked Data and Evaluation","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2017-02-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"岩手県立大学ソフトウェア情報学部"},{"subitem_text_value":"岩手県立大学大学院ソフトウェア情報学研究科"},{"subitem_text_value":"株式会社インターネットイニシアティブ"},{"subitem_text_value":"岩手県立大学ソフトウェア情報学部"},{"subitem_text_value":"岩手県立大学ソフトウェア情報学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Software and Information Science, Iwate Prefrctural University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Software and Information Science, Iwate Prefectural University","subitem_text_language":"en"},{"subitem_text_value":"Internet Initiative Japan Inc.","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Software and Information Science, Iwate Prefrctural University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Software and Information Science, Iwate Prefrctural University","subitem_text_language":"en"}]},"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/177446/files/IPSJ-MPS17112018.pdf","label":"IPSJ-MPS17112018.pdf"},"date":[{"dateType":"Available","dateValue":"2019-02-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS17112018.pdf","filesize":[{"value":"906.1 kB"}],"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":"cef87b33-d08f-47bf-9fe4-5e27eba652e4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2017 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":[{}]},{"creatorNames":[{"creatorName":"高田, 豊雄"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Eiichiro, Kodama","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shota, Tsuneki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kotaro, Shimizu","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Jiahong, Wang","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Toyoo, Takata","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":"近年，Linked Data に関する研究が盛んに行われている．Linked Data とは，外部から参照可能な RDF (Resource Description Framework) に従い記述されたデータのことであり，2006 年に Tim Berners-Lee によって提唱された概念である．Linked Data を利用したアプリケーションでは，リンクをたどって情報を提供することが多いため，Linked Data におけるリンクの保持は重要なものとなっている．しかし，Web 上でも発生しているリンク切れが Linked Data においても起こり得る．その多くは Linked Data の削除や移動によって発生し，移動によって起こるリンク切れは，リンク切れを検知し，リンクの再構築を行う必要がある．本研究では，このリンク切れの修復問題を解決するため，Linked Data をバイナリ特徴ベクトルで近似し，データサイズの縮小，実行の高速化を狙ったリンク切れ自動修復フレームワークの提案を行う．また，本提案フレームワークに対し，保有するデータ量削減に関する評価，精度に関する評価，スケーラビリティに関する評価を行ったので，その評価結果についても報告する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In recent years, researches on Linked Data are being actively conducted. Linked Data is a concept suggested by Tim Berners-Lee in 2006, and is such data that is represented in accordance with outside-referable RDF (Resource Description Framework). Since many applications using linked data acquire information by tracing the links, it is very important to maintain them functional all the time. As routinely occurs in Web, broken links also occur for the linked data. Broken links are generally caused by deleting or migrating linked data. For broken links caused by the linked data migration, finding and then restoring them are necessary. This paper addresses the subject of automatically restoring broken linked data, and proposes an effective framework for it. The proposed framework represents linked data as the binary feature vector, so that broken linked data could be restored with largely reduced metadata size and very high restoring speed. The proposed framework is evaluated in terms of level of reduced metadata size, accuracy of restored linked data, and scalability of the system that adapted the proposed framework. Evaluation results are reported and discussed.","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":"2017-02-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"18","bibliographicVolumeNumber":"2017-MPS-112"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:47:00.286061+00:00","updated":"2025-01-20T05:28:36.869441+00:00","id":177446}