{"updated":"2025-01-23T01:13:29.812413+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00013481","sets":["581:729:740"]},"path":["740"],"owner":"1","recid":"13481","title":["ユーザのアクセスコストを最小化するハイパーテキストの構成法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1997-02-15"},"_buckets":{"deposit":"43b72197-af3b-4d6f-90a5-42aaaf2d4070"},"_deposit":{"id":"13481","pid":{"type":"depid","value":"13481","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":"A Construction Method of a Hypertext Which Minimizes the Access Cost of a User","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1997-02-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学基礎工学部情報工学科"},{"subitem_text_value":"大阪大学基礎工学部情報工学科"},{"subitem_text_value":"大阪大学基礎工学部情報工学科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and Computer Sciences, Faculty of Engineering Science, Osaka University","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/13481/files/IPSJ-JNL3802012.pdf"},"date":[{"dateType":"Available","dateValue":"1999-02-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL3802012.pdf","filesize":[{"value":"796.4 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"b114c40a-8fd8-452c-ab6f-a0d1e7d1c31f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1997 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":"Yoshiaki, Takata","creatorNameLang":"en"},{"creatorName":"Yoshihiro, Tsujino","creatorNameLang":"en"},{"creatorName":"Nobuki, Tokura","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":"ヘルプシステムやWWW(World Wide Web)など 計算機アプリケーションのいくつかの分野でハイパーテキストを利用したシステムがよく見られるようになってきている.ここでは 大量の情報(文書)が個別に提供され それらをユーザが効率良くアクセスできるように検索のためのメニューとその間のリンクを構築する問題を考える.ユーザが効率良くアクセスするためには 操作の手間が平均的に小さいことが必要になる.また キーワードとそれからアクセスできるページの集合(カテゴリ)は意味的に対応づけられ ユーザが目的のページを検索するのに途中のメニューで迷わないようにしなければならない.本論文では 与えられたキーワードとカテゴリの関係を保つリンク構造すべての中から平均アクセス時間が最小なリンク構造を求める効率の良いアルゴリズムを示す.","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Computer applications using hypertext becomes popular, e.g. an online help system and WWW (World Wide Web). The problem we concern is to construct a link structure of hyper-text which consists menus and links, when many documents are supplied independently, as in WWW. A link structure is useful if it minimizes average access cost, preserving the semantical relation between each keyword and the set of pages (category) accessed from the keyword. In this paper, we present an efficient algorithm to find the optimal link structure which minimizes the expected access time among all structures which preserve a given semantical relation between keywords and categories.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"298","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"290","bibliographicIssueDates":{"bibliographicIssueDate":"1997-02-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"38"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"テキスト処理"}]},"weko_creator_id":"1"},"created":"2025-01-18T22:47:33.314001+00:00","id":13481,"links":{}}