{"id":103134,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00103134","sets":["1164:2735:7461:7669"]},"path":["7669"],"owner":"11","recid":"103134","title":["An exhaustive search and stability of sparse estimation for feature selection problem"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-09-18"},"_buckets":{"deposit":"84c026a5-012f-4af3-8d28-51bf5ad6af7e"},"_deposit":{"id":"103134","pid":{"type":"depid","value":"103134","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"An exhaustive search and stability of sparse estimation for feature selection problem","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"An exhaustive search and stability of sparse estimation for feature selection problem"},{"subitem_title":"An exhaustive search and stability of sparse estimation for feature selection problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2014-09-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"The University of Tokyo"},{"subitem_text_value":"Kobe University"},{"subitem_text_value":"Nikon Corporation"},{"subitem_text_value":"Fukushima Medical University"},{"subitem_text_value":"the University of Toyama"},{"subitem_text_value":"The University of Tokyo"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Kobe University","subitem_text_language":"en"},{"subitem_text_value":"Nikon Corporation","subitem_text_language":"en"},{"subitem_text_value":"Fukushima Medical University","subitem_text_language":"en"},{"subitem_text_value":"the University of Toyama","subitem_text_language":"en"},{"subitem_text_value":"The University of Tokyo","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/103134/files/IPSJ-MPS14100010.pdf"},"date":[{"dateType":"Available","dateValue":"2016-09-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS14100010.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":"ce1950ae-f947-4ba2-bd33-463471f362d4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kenji, Nagata"},{"creatorName":"Jun, Kitazono"},{"creatorName":"Shin-ichiNakajima"},{"creatorName":"Satoshi, Eifuku"},{"creatorName":"Ryoi, Tamura"},{"creatorName":"Masato, Okada"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kenji, Nagata","creatorNameLang":"en"},{"creatorName":"Jun, Kitazono","creatorNameLang":"en"},{"creatorName":"Shin-ichi, Nakajima","creatorNameLang":"en"},{"creatorName":"Satoshi, Eifuku","creatorNameLang":"en"},{"creatorName":"Ryoi, Tamura","creatorNameLang":"en"},{"creatorName":"Masato, Okada","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Feature selection problem has been widely used for various fields. In particular, the sparse estimation has the advantage that its computational cost is the polynomial order of the number of features. However, it has the problem that the obtained solution varies as the dataset has changed a little. The goal of this paper is to exhaustively search the solutions which minimize the generalization error for feature selection problem to investigate the problem of sparse estimation. We calculate the generalization errors for all combinations of features in order to get the histogram of generalization error by using the cross validation method. By using this histogram, we propose a method to verify whether the given data include information for binary classification by comparing the histogram of predictive error for random guessing. Moreover, we propose a statistical mechanical method in order to efficiently calculate the histogram of generalization error by the exchange Monte Carlo (EMC) method and the multiple histogram method. We apply our proposed method to the feature selection problem for selecting the relevant neurons for face identification.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Feature selection problem has been widely used for various fields. In particular, the sparse estimation has the advantage that its computational cost is the polynomial order of the number of features. However, it has the problem that the obtained solution varies as the dataset has changed a little. The goal of this paper is to exhaustively search the solutions which minimize the generalization error for feature selection problem to investigate the problem of sparse estimation. We calculate the generalization errors for all combinations of features in order to get the histogram of generalization error by using the cross validation method. By using this histogram, we propose a method to verify whether the given data include information for binary classification by comparing the histogram of predictive error for random guessing. Moreover, we propose a statistical mechanical method in order to efficiently calculate the histogram of generalization error by the exchange Monte Carlo (EMC) method and the multiple histogram method. We apply our proposed method to the feature selection problem for selecting the relevant neurons for face identification.","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":"2014-09-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicVolumeNumber":"2014-MPS-100"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"updated":"2025-01-21T10:31:58.214161+00:00","created":"2025-01-18T23:48:12.972623+00:00","links":{}}