{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T10:50:43Z","timestamp":1773571843381,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2016,5,18]],"date-time":"2016-05-18T00:00:00Z","timestamp":1463529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61272021"],"award-info":[{"award-number":["61272021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61202206"],"award-info":[{"award-number":["61202206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61173181"],"award-info":[{"award-number":["61173181"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61573321"],"award-info":[{"award-number":["61573321"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00500-016-2173-3","type":"journal-article","created":{"date-parts":[[2016,5,18]],"date-time":"2016-05-18T09:50:23Z","timestamp":1463565023000},"page":"6159-6173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A set-cover-based approach for the test-cost-sensitive attribute reduction problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Anhui","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhi","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,18]]},"reference":[{"key":"2173_CR1","doi-asserted-by":"crossref","first-page":"2481","DOI":"10.1016\/j.patcog.2014.01.008","volume":"47","author":"V Bol\u00f3n-Canedo","year":"2014","unstructured":"Bol\u00f3n-Canedo V, Porto-D\u00edaz I, S\u00e1nchez-Maro\u00f1o N, Alonso-Betanzos A (2014) A framework for cost-based feature selection. Pattern Recogn 47:2481\u20132489","journal-title":"Pattern Recogn"},{"key":"2173_CR2","first-page":"27","volume":"13","author":"G Brown","year":"2012","unstructured":"Brown G, Pocock A, Zhao MJ, Luj\u00e1n M (2012) Conditional likelihood maximisation: a unifying framework for information theoretic feature selection. J Mach Learn Res 13:27\u201366","journal-title":"J Mach Learn Res"},{"key":"2173_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara A, Toth P, Fischetti M (2000) Algorithms for the set covering problem. Ann Oper Res 98:353\u2013371","journal-title":"Ann Oper Res"},{"key":"2173_CR4","first-page":"1","volume":"2","author":"CY Chen","year":"2004","unstructured":"Chen CY, Li ZG (2004) A study of reduction of attributes and set covering problem. Comput Eng Appl 2:1\u201314","journal-title":"Comput Eng Appl"},{"key":"2173_CR5","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1109\/TKDE.2011.89","volume":"24","author":"DG Chen","year":"2012","unstructured":"Chen DG, Zhao SY, Zhang L, Yang YP, Zhang X (2012) Sample pair selection for attribute reduction with rough set. IEEE Trans Knowl Data Eng 24:2080\u20132093","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2173_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.ins.2015.07.008","volume":"325","author":"JK Chen","year":"2015","unstructured":"Chen JK, Lin YJ, Lin GP, Li JJ, Ma ZM (2015) The relationship between attribute reducts in rough sets and minimal vertex covers of graphs. Inf Sci 325:87\u201397","journal-title":"Inf Sci"},{"key":"2173_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal V (1979) A greedy-heuristic for the set covering problem. Math Oper Res 4:233\u2013235","journal-title":"Math Oper Res"},{"key":"2173_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1770-x","author":"AJ Fan","year":"2015","unstructured":"Fan AJ, Zhao H, Zhu W (2015) Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model. Soft Comput. doi: 10.1007\/s00500-015-1770-x","journal-title":"Soft Comput"},{"key":"2173_CR9","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2015.05.038","volume":"246","author":"C Gao","year":"2015","unstructured":"Gao C, Yao X, Weise T, Li JL (2015) An efficient local search heuristic with row weighting for the unicost set covering problem. Eur J Oper Res 246:750\u2013761","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2173_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/TFUZZ.2011.2167235","volume":"20","author":"QH Hu","year":"2012","unstructured":"Hu QH, Pan WW, Zhang L, Zhang D, Song YP, Guo MZ, Yu DR (2012) Feature selection for monotonic classification. IEEE Trans Fuzzy Syst 20(1):69\u201381","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"2173_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.ins.2012.07.010","volume":"219","author":"XY Jia","year":"2013","unstructured":"Jia XY, Liao WH, Tang ZM, Shang L (2013) Minimum cost attribute reduction in decision-theoretic rough set models. Inf Sci 219:151\u2013167","journal-title":"Inf Sci"},{"issue":"7","key":"2173_CR12","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1007\/s00500-013-1150-3","volume":"18","author":"SY Jing","year":"2014","unstructured":"Jing SY (2014) A hybrid genetic algorithm for feature subset selection in rough set theory. Soft Comput 18(7):1373\u20131382","journal-title":"Soft Comput"},{"issue":"5","key":"2173_CR13","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s00500-009-0450-0","volume":"14","author":"Y Kusunoki","year":"2010","unstructured":"Kusunoki Y, Inuiguchi M (2010) A unified approach to reducts in dominance-based rough set approach. Soft Comput 14(5):507\u2013515","journal-title":"Soft Comput"},{"key":"2173_CR14","doi-asserted-by":"crossref","unstructured":"Lavrac N, Gamberger D, Turney P (1996) Cost-sensitive feature reduction applied to a hybrid genetic algorithm. In: Proceedings of the 7th international workshop on algorithmic learning theory, ALT","DOI":"10.1007\/3-540-61863-5_40"},{"key":"2173_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1142\/S0218488504002631","volume":"12","author":"JY Liang","year":"2004","unstructured":"Liang JY, Shi ZZ (2004) The information entropy, rough entropy and knowledge granulation in rough set theory. Int J Uncertain Fuzziness Knowl Based Syst 12:37\u201346","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"key":"2173_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ins.2014.02.023","volume":"275","author":"JNK Liu","year":"2014","unstructured":"Liu JNK, Hua YX, He YL (2014) A set covering based approach to find the reduct of variable precision rough set. Inf Sci 275:83\u2013100","journal-title":"Inf Sci"},{"key":"2173_CR17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s00500-010-0656-1","volume":"15","author":"JS Mi","year":"2011","unstructured":"Mi JS, Leung Y, Wu WZ (2011) Dependence-space-based attribute reduction in consistent decision tables. Soft Comput 15:261\u2013268","journal-title":"Soft Comput"},{"issue":"24","key":"2173_CR18","doi-asserted-by":"crossref","first-page":"4140","DOI":"10.1016\/j.ins.2009.08.020","volume":"179","author":"DQ Miao","year":"2009","unstructured":"Miao DQ, Zhao Y, Yao YY, Li H, Xu F (2009) Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model. Inf Sci 179(24):4140\u20134150","journal-title":"Inf Sci"},{"key":"2173_CR19","doi-asserted-by":"crossref","first-page":"2442","DOI":"10.1016\/j.ins.2009.03.007","volume":"179","author":"F Min","year":"2009","unstructured":"Min F, Liu QH (2009) A hierarchical model for test-cost-sensitive decision systems. Inf Sci 179:2442\u20132452","journal-title":"Inf Sci"},{"key":"2173_CR20","doi-asserted-by":"crossref","first-page":"4928","DOI":"10.1016\/j.ins.2011.07.010","volume":"181","author":"F Min","year":"2011","unstructured":"Min F, He HP, Qian YH, Zhu W (2011) Test-cost-sensitive attribute reduction. Inf Sci 181:4928\u20134942","journal-title":"Inf Sci"},{"key":"2173_CR21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.ins.2012.04.031","volume":"211","author":"F Min","year":"2012","unstructured":"Min F, Zhu W (2012) Attribute reduction of data with error ranges and test costs. Inf Sci 211:48\u201367","journal-title":"Inf Sci"},{"key":"2173_CR22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.ijar.2013.04.003","volume":"55","author":"F Min","year":"2014","unstructured":"Min F, Hu QH, Zhu W (2014) Feature selection with test cost constraint. Int J Approx Reason 55:167\u2013179","journal-title":"Int J Approx Reason"},{"key":"2173_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough sets: theoretical aspects of reasoning about data","author":"Z Pawlak","year":"1991","unstructured":"Pawlak Z (1991) Rough sets: theoretical aspects of reasoning about data. Kluwer, Dordrecht"},{"key":"2173_CR24","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.artint.2010.04.018","volume":"174","author":"YH Qian","year":"2010","unstructured":"Qian YH, Liang JY, Pedrycz W, Dang CY (2010) Positive approximation: an accelerator for attribute reduction in rough set theory. Artif Intell 174:597\u2013618","journal-title":"Artif Intell"},{"key":"2173_CR25","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TSMCA.2009.2035436","volume":"20","author":"YH Qian","year":"2010","unstructured":"Qian YH, Liang JY, Dang CY (2010) Incomplete multigranulation rough set. IEEE Trans Syst Man Cybern A 20:420\u2013431","journal-title":"IEEE Trans Syst Man Cybern A"},{"key":"2173_CR26","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.fss.2014.04.029","volume":"258","author":"YH Qian","year":"2015","unstructured":"Qian YH, Wang Q, Cheng HH, Liang JY, Dang CY (2015) Fuzzy-rough feature selection accelerator. Fuzzy Sets Syst 258:61\u201378","journal-title":"Fuzzy Sets Syst"},{"key":"2173_CR27","first-page":"156","volume":"9","author":"GR Quan","year":"1998","unstructured":"Quan GR, Hong BR, Ye F, Ren SJ (1998) A heuristic function algorithm for minimum set-covering problem. J Softw 9:156\u2013160","journal-title":"J Softw"},{"key":"2173_CR28","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-94-015-7975-9_21","volume-title":"Intelligent decision support, theory and decision library","author":"A Skowron","year":"1992","unstructured":"Skowron A, Rauszer C (1992) The discernibility matrices and functions in information systems. In: Slowinski R (ed) Intelligent decision support, theory and decision library, vol 11. Springer, Netherlands, pp 331\u2013362"},{"key":"2173_CR29","doi-asserted-by":"crossref","unstructured":"Slav\u00edk P (1996) A tight analysis of the greedy algorithm for set cover. In: Proceedings of the 28th annual ACM symposium on theory of computing, STOC \u201996, ACM, pp 435\u2013441","DOI":"10.1145\/237814.237991"},{"key":"2173_CR30","doi-asserted-by":"crossref","first-page":"365","DOI":"10.3233\/FUN-2002-533-409","volume":"53","author":"D Slezak","year":"2002","unstructured":"Slezak D (2002) Approximate entropy reducts. Fundam Informat 53:365\u2013390","journal-title":"Fundam Informat"},{"key":"2173_CR31","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1016\/j.knosys.2011.06.007","volume":"24","author":"YT Xu","year":"2011","unstructured":"Xu YT, Wang LS, Zhang RY (2011) A dynamic attribute reduction algorithm based on 0\u20131 integer programming. Knowl-Based Syst 24:1341\u20131347","journal-title":"Knowl-Based Syst"},{"key":"2173_CR32","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.ins.2013.06.057","volume":"250","author":"XB Yang","year":"2013","unstructured":"Yang XB, Qi YS, Song XN, Yang JY (2013) Test cost sensitive multigranulation rough set: model and minimal cost selection. Inf Sci 250:184\u2013199","journal-title":"Inf Sci"},{"key":"2173_CR33","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.ins.2008.11.020","volume":"179","author":"YY Yao","year":"2009","unstructured":"Yao YY, Zhao Y (2009) Discernibility matrix simplification for constructing attribute reducts. Inf Sci 179:867\u2013882","journal-title":"Inf Sci"},{"key":"2173_CR34","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.knosys.2014.04.009","volume":"65","author":"H Zhao","year":"2014","unstructured":"Zhao H, Zhu W (2014) Optimal cost-sensitive granularization based on rough sets for variable costs. Knowl-Based Syst 65:72\u201382","journal-title":"Knowl-Based Syst"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2173-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2173-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2173-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2173-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T15:06:23Z","timestamp":1748963183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2173-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,18]]},"references-count":34,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["2173"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2173-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,18]]}}}