{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:07:31Z","timestamp":1759190851350,"version":"3.37.3"},"reference-count":45,"publisher":"Wiley","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61170128","2012J01294","20110106","JK2012028"],"award-info":[{"award-number":["61170128","2012J01294","20110106","JK2012028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Fujian Province, China","award":["61170128","2012J01294","20110106","JK2012028"],"award-info":[{"award-number":["61170128","2012J01294","20110106","JK2012028"]}]},{"name":"State Key Laboratory of Management and Control for Complex Systems Open Project","award":["61170128","2012J01294","20110106","JK2012028"],"award-info":[{"award-number":["61170128","2012J01294","20110106","JK2012028"]}]},{"name":"Fujian Province Foundation of Higher Education","award":["61170128","2012J01294","20110106","JK2012028"],"award-info":[{"award-number":["61170128","2012J01294","20110106","JK2012028"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>Feature selection is an essential process in data mining applications since it reduces a model\u2019s complexity. However, feature selection with various types of costs is still a new research topic. In this paper, we study the cost-sensitive feature selection problem of numeric data with measurement errors. The major contributions of this paper are fourfold. First, a new data model is built to address test costs and misclassification costs as well as error boundaries. It is distinguished from the existing models mainly on the error boundaries. Second, a covering-based rough set model with normal distribution measurement errors is constructed. With this model, coverings are constructed from data rather than assigned by users. Third, a new cost-sensitive feature selection problem is defined on this model. It is more realistic than the existing feature selection problems. Fourth, both backtracking and heuristic algorithms are proposed to deal with the new problem. Experimental results show the efficiency of the pruning techniques for the backtracking algorithm and the effectiveness of the heuristic algorithm. This study is a step toward realistic applications of the cost-sensitive learning.<\/jats:p>","DOI":"10.1155\/2013\/754698","type":"journal-article","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T17:00:45Z","timestamp":1366045245000},"page":"1-13","source":"Crossref","is-referenced-by-count":10,"title":["Cost-Sensitive Feature Selection of Numeric Data with Measurement Errors"],"prefix":"10.1155","volume":"2013","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9339-1829","authenticated-orcid":true,"given":"Hong","family":"Zhao","sequence":"first","affiliation":[{"name":"Laboratory of Granular Computing, Zhangzhou Normal University, Zhangzhou 363000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3290-1036","authenticated-orcid":true,"given":"Fan","family":"Min","sequence":"additional","affiliation":[{"name":"Laboratory of Granular Computing, Zhangzhou Normal University, Zhangzhou 363000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Zhu","sequence":"additional","affiliation":[{"name":"Laboratory of Granular Computing, Zhangzhou Normal University, Zhangzhou 363000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"issue":"4","key":"45","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.omega.2005.07.006","volume":"35","year":"2007","journal-title":"Omega"},{"issue":"3","key":"59","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011219601502","volume":"16","year":"2001","journal-title":"Journal of Intelligent Information Systems"},{"volume":"454","year":"1998","key":"25"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.01.035"},{"year":"1966","key":"11"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00209-6"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.11.008"},{"key":"29","doi-asserted-by":"crossref","first-page":"4928","DOI":"10.1016\/j.ins.2011.07.010","volume":"181","year":"2011","journal-title":"Information Sciences"},{"key":"43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/BFb0095132","volume-title":"Computation of minimal cost reducts","volume":"1609","year":"1999"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.03.007"},{"issue":"1","key":"46","first-page":"369","volume":"2","year":"1994","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"35","first-page":"231","volume":"6","year":"1991","journal-title":"Machine Learning"},{"issue":"1","key":"44","first-page":"7","volume":"13","year":"1993","journal-title":"Machine Learning"},{"key":"15"},{"volume":"4","year":"1992","key":"16"},{"key":"53","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-540-27794-1_11","volume":"3100","year":"2004","journal-title":"Transactions on Rough Sets I"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/946070"},{"volume":"2639","volume-title":"Granular computing\u2014structures, representations, and applications","year":"2003","key":"23"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2012.03.004"},{"key":"61","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.05.037"},{"key":"63","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(03)00056-2"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.04.031"},{"issue":"1","key":"60","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/TKDE.2006.17","volume":"18","year":"2006","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"57"},{"issue":"4","key":"19","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.dss.2009.11.008","volume":"48","year":"2010","journal-title":"Decision Support Systems"},{"issue":"1","key":"48","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.ejor.2004.03.031","volume":"166","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1007\/BF01001956"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2009.02.011"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(97)10046-9"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2009.02.003"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2009.06.002"},{"issue":"9-10","key":"40","first-page":"653","volume":"35","year":"1987","journal-title":"Bulletin of the Polish Academy of Sciences: Mathematics"},{"key":"52","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(98)00012-7"},{"issue":"2","key":"54","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ijar.2007.05.019","volume":"49","year":"2008","journal-title":"Journal of Approximate Reasoning"},{"issue":"40","key":"55","first-page":"761","volume":"16","year":"1983","journal-title":"Demonstratio Mathematica"},{"key":"62","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.02.013"},{"issue":"8","key":"65","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1109\/TKDE.2007.1044","volume":"19","year":"2007","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"5","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.ijar.2009.11.006","volume":"51","year":"2010","journal-title":"International Journal of Approximate Reasoning"},{"journal-title":"Intelligence and Security Informatics","first-page":"566","year":"2006","key":"64"},{"year":"1991","key":"38"},{"issue":"1\u20134","key":"6","first-page":"131","volume":"1","year":"1997","journal-title":"Intelligent Data Analysis"},{"issue":"4","key":"50","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.patrec.2006.09.003","volume":"28","year":"2007","journal-title":"Pattern Recognition Letters"},{"issue":"5","key":"41","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0167-8655(89)90037-8","volume":"10","year":"1989","journal-title":"Pattern Recognition Letters"},{"issue":"8","key":"26","first-page":"878","volume":"20","year":"2005","journal-title":"Control and Decision"},{"volume-title":"The discernibility matrices and functions in information systems","year":"1992","key":"42"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/754698.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/754698.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/754698.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T07:22:33Z","timestamp":1498029753000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jam\/2013\/754698\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":45,"alternative-id":["754698","754698"],"URL":"https:\/\/doi.org\/10.1155\/2013\/754698","relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"type":"print","value":"1110-757X"},{"type":"electronic","value":"1687-0042"}],"subject":[],"published":{"date-parts":[[2013]]}}}