{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00182736","sets":["934:989:9056:9194"]},"path":["9194"],"owner":"11","recid":"182736","title":["Enumeration of Maximally Frequent Ordered Tree Patterns with Wildcards for Edge Labels"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-07-19"},"_buckets":{"deposit":"03673114-9dd8-4ad5-a8d7-904bb0ff466c"},"_deposit":{"id":"182736","pid":{"type":"depid","value":"182736","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Enumeration of Maximally Frequent Ordered Tree Patterns with Wildcards for Edge Labels","author_link":["398844","398853","398846","398845","398852","398850","398847","398851","398849","398848"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Enumeration of Maximally Frequent Ordered Tree Patterns with Wildcards for Edge Labels"},{"subitem_title":"Enumeration of Maximally Frequent Ordered Tree Patterns with Wildcards for Edge Labels","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[オリジナル論文] ordered tree pattern, enumeration algorithm, tree structured feature","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2017-07-19","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University"},{"subitem_text_value":"Faculty of Contemporary Business, Kyushu International University"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University"},{"subitem_text_value":"Computer Centre, Gakushuin University"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Contemporary Business, Kyushu International University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Sciences, Hiroshima City University","subitem_text_language":"en"},{"subitem_text_value":"Computer Centre, Gakushuin University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/182736/files/IPSJ-TOM1002008.pdf","label":"IPSJ-TOM1002008.pdf"},"date":[{"dateType":"Available","dateValue":"2019-07-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM1002008.pdf","filesize":[{"value":"1.3 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":"b9faa52a-98bf-4b29-a35c-3f97cbe29cae","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2017 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tetsuhiro, Miyahara"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yusuke, Suzuki"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takayoshi, Shoudai"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tomoyuki, Uchida"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tetsuji, Kuboyama"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tetsuhiro, Miyahara","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yusuke, Suzuki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takayoshi, Shoudai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tomoyuki, Uchida","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tetsuji, Kuboyama","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We consider representing tree structured features of structured data which are represented by rooted trees with ordered children. As representations of tree structured features, we use ordered tree patterns, called ordered wildcard tree patterns, which have structures of rooted ordered trees, structured variables and wildcards for edge labels. A structured variable can be replaced with an arbitrary rooted ordered tree. First we show that it is hard to compute two types of optimum frequent ordered wildcard tree patterns. Then we present an algorithm for enumerating all maximally frequent ordered wildcard tree patterns. Finally we consider extended ordered wildcard tree patterns, called ordered tag tree patterns, which have structured variables, wildcards, tags and keywords, and present an algorithm for enumerating all maximally frequent ordered tag tree patterns.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We consider representing tree structured features of structured data which are represented by rooted trees with ordered children. As representations of tree structured features, we use ordered tree patterns, called ordered wildcard tree patterns, which have structures of rooted ordered trees, structured variables and wildcards for edge labels. A structured variable can be replaced with an arbitrary rooted ordered tree. First we show that it is hard to compute two types of optimum frequent ordered wildcard tree patterns. Then we present an algorithm for enumerating all maximally frequent ordered wildcard tree patterns. Finally we consider extended ordered wildcard tree patterns, called ordered tag tree patterns, which have structured variables, wildcards, tags and keywords, and present an algorithm for enumerating all maximally frequent ordered tag tree patterns.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"69","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"59","bibliographicIssueDates":{"bibliographicIssueDate":"2017-07-19","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"10"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":182736,"updated":"2025-01-20T03:58:15.424321+00:00","links":{},"created":"2025-01-19T00:50:19.145529+00:00"}