{"created":"2023-05-15T11:58:11.151167+00:00","id":4107,"links":{},"metadata":{"_buckets":{"deposit":"3f50ec4c-dc45-4712-90fe-36332f75b85d"},"_deposit":{"created_by":3,"id":"4107","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"4107"},"status":"published"},"_oai":{"id":"oai:kyutech.repo.nii.ac.jp:00004107","sets":["8:24"]},"author_link":["879"],"item_21_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2011-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicPageEnd":"3424","bibliographicPageStart":"3409","bibliographicVolumeNumber":"14","bibliographic_titles":[{"bibliographic_title":"Information"}]}]},"item_21_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The bump hunting is to find the regions where points we are interested in are located more densely than elsewhere and are hardly separable from other points. By specifying a pureness rate p for the points, a maximum capture rate c of the points could be obtained. Then, a trade-off curve between p and c can be constructed. Thus, to find the bump regions is equivalent to construct the trade-off curve. We adopt simpler boundary shapes for the bumps such as the box-shaped regions located parallel to variable axes for convenience. We use the genetic algorithm, specified to the tree structure, called the tree-GA, to obtain the maximum capture rates, because the conventional binary decision tree will not provide the maximum capture rates.Using the tree-GA tendency providing many local maxima for the capture rates, we can estimate the return period for the trade-off curve by using the extremevalue statistics. We have assessed the accuracy for the trade-off curve in typical fundamental cases that may be observed in real customer data cases, and found that the proposed tree-GA can construct the effective trade-off curve which is close to the optimal one.","subitem_description_type":"Abstract"}]},"item_21_description_60":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"Journal Article","subitem_description_type":"Other"}]},"item_21_link_62":{"attribute_name":"研究者情報","attribute_value_mlt":[{"subitem_link_url":"https://hyokadb02.jimu.kyutech.ac.jp/html/228_ja.html"}]},"item_21_publisher_7":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"International Information Institute"}]},"item_21_relation_14":{"attribute_name":"情報源","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"http://www.information-iii.org/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://www.information-iii.org/","subitem_relation_type_select":"URI"}}]},"item_21_rights_13":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"©2011 International Information Institute"}]},"item_21_select_59":{"attribute_name":"査読の有無","attribute_value_mlt":[{"subitem_select_item":"yes"}]},"item_21_source_id_8":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1343-4500","subitem_source_identifier_type":"ISSN"},{"subitem_source_identifier":"1344-8994","subitem_source_identifier_type":"ISSN"}]},"item_21_text_36":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Kyushu Institute of Technology, Department of Systems Design and Informatics"}]},"item_21_text_63":{"attribute_name":"連携ID","attribute_value_mlt":[{"subitem_text_value":"5040"}]},"item_21_version_type_58":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorAffiliations":[{"affiliationNameIdentifiers":[],"affiliationNames":[{"affiliationName":""}]}],"creatorNames":[{"creatorName":"Hirose, Hideo","creatorNameLang":"en"},{"creatorName":"廣瀬, 英雄","creatorNameLang":"ja"},{"creatorName":"ヒロセ, ヒデオ","creatorNameLang":"ja-Kana"}],"familyNames":[{},{},{}],"givenNames":[{},{},{}],"nameIdentifiers":[{},{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2015-01-06"}],"displaytype":"detail","filename":"INFO14_3409.pdf","filesize":[{"value":"1.3 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"INFO14_3409.pdf","url":"https://kyutech.repo.nii.ac.jp/record/4107/files/INFO14_3409.pdf"},"version_id":"6a4cc204-a102-4f44-85bc-2912670ef50a"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"data mining","subitem_subject_scheme":"Other"},{"subitem_subject":"decision tree","subitem_subject_scheme":"Other"},{"subitem_subject":"genetic algorithm","subitem_subject_scheme":"Other"},{"subitem_subject":"bump hunting","subitem_subject_scheme":"Other"},{"subitem_subject":"extreme-value statistics","subitem_subject_scheme":"Other"},{"subitem_subject":"trade-off curve","subitem_subject_scheme":"Other"},{"subitem_subject":"accuracy","subitem_subject_scheme":"Other"},{"subitem_subject":"return period","subitem_subject_scheme":"Other"},{"subitem_subject":"evaluation","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Bump Hunting using the Tree-GA","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Bump Hunting using the Tree-GA"}]},"item_type_id":"21","owner":"3","path":["24"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-01-06"},"publish_date":"2015-01-06","publish_status":"0","recid":"4107","relation_version_is_last":true,"title":["Bump Hunting using the Tree-GA"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-10-25T09:33:53.317665+00:00"}