{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:54:09Z","timestamp":1760597649568,"version":"3.41.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,3]],"date-time":"2015-05-03T00:00:00Z","timestamp":1430611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s13042-015-0365-2","type":"journal-article","created":{"date-parts":[[2015,5,2]],"date-time":"2015-05-02T08:01:05Z","timestamp":1430553665000},"page":"781-792","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A rough set method for the unicost set covering problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Qingyuan","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anhui","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaojin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,3]]},"reference":[{"key":"365_CR1","volume-title":"Class of location, distribution and scheduling problems: modeling and solution methods","author":"E Balas","year":"1982","unstructured":"Balas E (1982) Class of location, distribution and scheduling problems: modeling and solution methods. Carnegie Mellon University, Design Research Center, New York"},{"issue":"10","key":"365_CR2","doi-asserted-by":"crossref","first-page":"3162","DOI":"10.1016\/j.cor.2005.11.026","volume":"34","author":"J Bautista","year":"2007","unstructured":"Bautista J, Pereira J (2007) A GRASP algorithm to solve the unicost set covering problem. Comput Operation Res 34(10):3162\u20133173","journal-title":"Comput Operation Res"},{"key":"365_CR3","doi-asserted-by":"publisher","unstructured":"Bilal N, Galinier P, Guibault F (2013) A new formulation of the set covering problem for metaheuristic approaches. Hindawi Publishing Corporation, ISRN Operations Research, Volume 2013, Article ID 203032, p 10. doi: 10.1155\/2013\/203032","DOI":"10.1155\/2013\/203032"},{"issue":"5","key":"365_CR4","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A Caprara","year":"1999","unstructured":"Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Operat Res 47(5):730\u2013743","journal-title":"Operat Res"},{"issue":"11","key":"365_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 et al (2012) Sample pair selection for attribute reduction with rough set. IEEE Transac Know Data Eng 24(11):2080\u20132093","journal-title":"IEEE Transac Know Data Eng"},{"issue":"12","key":"365_CR6","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1016\/j.patrec.2012.03.028","volume":"33","author":"TQ Deng","year":"2012","unstructured":"Deng TQ, Yang CD, Wang XF (2012) A reduct derived from feature selection. Pattern Recogn Lett 33(12):1638\u20131646","journal-title":"Pattern Recogn Lett"},{"key":"365_CR7","doi-asserted-by":"crossref","unstructured":"Grzymala-Busse JW (1992) LERS-a system for learning from examples based on rough sets. In: Slowinski R (ed) Intelligent Decision Support: Handbook of Applications and Advances of the Rough Set Theory, Kluwer Academic Publishers, pp 3\u201318","DOI":"10.1007\/978-94-015-7975-9_1"},{"issue":"5","key":"365_CR8","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s13042-012-0115-7","volume":"4","author":"SM Gu","year":"2013","unstructured":"Gu SM, Wu WZ (2013) On knowledge acquisition in multi-scale decision systems. Int J Mach Learn Cybernet 4(5):477\u2013486","journal-title":"Int J Mach Learn Cybernet"},{"issue":"9","key":"365_CR9","doi-asserted-by":"crossref","first-page":"10737","DOI":"10.1016\/j.eswa.2011.01.023","volume":"38","author":"QH Hu","year":"2011","unstructured":"Hu QH, Zhang L, Zhang D et al (2011) Measuring relevance between discrete and continuous features based on neighborhood mutual information. Expert Syst Appl 38(9):10737\u201310750","journal-title":"Expert Syst Appl"},{"issue":"2","key":"365_CR10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1111\/j.1467-8640.1995.tb00035.x","volume":"11","author":"XH Hu","year":"1995","unstructured":"Hu XH, Cercone N (1995) Learning in relational databases: a rough set approach. Comput Intell 11(2):323\u2013338","journal-title":"Comput Intell"},{"key":"365_CR11","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"DS Johnson","year":"1979","unstructured":"Johnson DS, Garey MR (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman & Company, NewYork"},{"issue":"3","key":"365_CR12","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G Lan","year":"2007","unstructured":"Lan G, DePuy GW, Whitehouse GE (2007) An effective and simple heuristic for the set covering problem. Eur J Oper Res 176(3):1387\u20131403","journal-title":"Eur J Oper Res"},{"key":"365_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-014-0315-4","author":"GM Lang","year":"2014","unstructured":"Lang GM, Li QG, Cai MJ et al (2014) Incremental approaches to knowledge reduction based on characteristic matrices. Int J Mach Learn Cybernet. doi: 10.1007\/s13042-014-0315-4","journal-title":"Int J Mach Learn Cybernet"},{"issue":"4","key":"365_CR14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1080\/0308107021000013635","volume":"31","author":"JY Liang","year":"2002","unstructured":"Liang JY, Chin KS, Dang CY et al (2002) A new method for measuring uncertainty and fuzziness in rough set theory. Int J General Syst 31(4):331\u2013342","journal-title":"Int J General Syst"},{"issue":"10","key":"365_CR15","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1007\/s11432-008-0113-2","volume":"51","author":"JY Liang","year":"2008","unstructured":"Liang JY, Qian YH (2008) Information granules and entropy theory in information systems. Sci China Ser F Inform Sci 51(10):1427\u20131444","journal-title":"Sci China Ser F Inform Sci"},{"issue":"1","key":"365_CR16","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(1):37\u201346","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"key":"365_CR17","doi-asserted-by":"crossref","unstructured":"Lin TY (1988) Neighborhood systems and relational database. In: Proceedings of CSC\u201988","DOI":"10.1145\/322609.323183"},{"key":"365_CR18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-94-015-7975-9_18","volume-title":"Intelligent decision support: handbook of applications and advances of the rough sets theory","author":"TY Lin","year":"1992","unstructured":"Lin TY (1992) Topological and fuzzy rough sets. In: Slowinski R (ed) Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory. Kluwer Academic Publishers, Boston, pp 287\u2013304"},{"key":"365_CR19","unstructured":"Lin TY (1989) Neighborhood systems and approximation in relational databases and knowledge bases. Poster Session. In: Proceedings of the Fourth International Symposium on ethodologies of Intelligent Systems, pp 75\u201386"},{"key":"365_CR20","first-page":"4339","volume-title":"Granular computing: practices, theories, and future directions","author":"TY Lin","year":"2009","unstructured":"Lin TY (2009) Granular computing: practices, theories, and future directions. Springer, Encyclopedia on Complexity of Systems Science, pp 4339\u20134355"},{"key":"365_CR21","doi-asserted-by":"crossref","unstructured":"X. liu, Y.H. Qian, J.Y. Liang, A rule-extraction framework under multigranulation rough sets, Int J Mach Learn Cybernet 5 (2) (2014) 319\u2013326","DOI":"10.1007\/s13042-013-0194-0"},{"issue":"24","key":"365_CR22","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 et al (2009) Relative reducts in consistent and inconsistent decision tables of the pawlak rough set model. Inform Sci 179(24):4140\u20134150","journal-title":"Inform Sci"},{"issue":"22","key":"365_CR23","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. Inform Sci 181(22):4928\u20134942","journal-title":"Inform Sci"},{"issue":"1","key":"365_CR24","first-page":"33","volume":"60","author":"Z Pawlak","year":"2004","unstructured":"Pawlak Z (2004) Decision rules and dependencies. Fundam Inform 60(1):33\u201339","journal-title":"Fundam Inform"},{"issue":"5","key":"365_CR25","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough sets. Int J Comput Inform Sci 11(5):341\u2013356","journal-title":"Int J Comput Inform Sci"},{"key":"365_CR26","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 Academic Publishing, Dordrecht"},{"issue":"1","key":"365_CR27","doi-asserted-by":"crossref","first-page":"269","DOI":"10.3233\/FI-2000-43123414","volume":"43","author":"JF Peters","year":"2000","unstructured":"Peters JF, Skowron A, Suraj Z (2000) An application of rough set methods in control design. Fundam Inform 43(1):269\u2013290","journal-title":"Fundam Inform"},{"issue":"2","key":"365_CR28","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1142\/S0218488508005121","volume":"16","author":"YH Qian","year":"2008","unstructured":"Qian YH, Liang JY (2008) Combination entropy and combination granulation in rough set theory. Int J Uncertain Fuzziness Knowl Based Syst 16(2):179\u2013193","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"issue":"9\u201310","key":"365_CR29","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(9\u201310):597\u2013618","journal-title":"Artif Intell"},{"key":"365_CR30","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-94-015-7975-9_21","volume-title":"Intelligent decision support","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. Handbook of Applications and Advances of the Rough Sets Theory, Kluwer, pp 331\u2013362"},{"key":"365_CR31","unstructured":"Slezak D (1996) Approximate reducts in decision tables, Research report. Institute of Computer Science, Warsaw University of Technology"},{"issue":"3","key":"365_CR32","first-page":"365","volume":"53","author":"D Slezak","year":"2002","unstructured":"Slezak D (2002) Approximate entropy reducts. Fund Inform 53(3):365\u2013390","journal-title":"Fund Inform"},{"key":"365_CR33","volume-title":"Combinatorial optimization: algorithms and complexity","author":"K Steiglitz","year":"1982","unstructured":"Steiglitz K, Papadimitriou CH (1982) Combinatorial optimization: algorithms and complexity. Prentice-Hall, Englewood Cliffs"},{"key":"365_CR34","first-page":"559","volume-title":"Proceedings of the 1st ICEC94","author":"YF Sun","year":"1994","unstructured":"Sun YF, Wang ZT (1994) The genetic algorithm for 0\u20131 programming with linear constraints. In: Fogel DB (ed) Proceedings of the 1st ICEC94. Orlando, FL, pp 559\u2013564"},{"issue":"3","key":"365_CR35","first-page":"345","volume":"12","author":"S Sundar","year":"2012","unstructured":"Sundar S, Singh A (2012) A hybrid heuristic for the set covering problem. Oper Res 12(3):345\u2013365","journal-title":"Oper Res"},{"issue":"6","key":"365_CR36","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1016\/S0167-8655(02)00196-4","volume":"24","author":"RW Swiniarski","year":"2003","unstructured":"Swiniarski RW, Skowron A (2003) Rough set methods in feature selection and recognition. Pattern Recogn Lett 24(6):833\u2013849","journal-title":"Pattern Recogn Lett"},{"issue":"1","key":"365_CR37","first-page":"249","volume":"67","author":"P Synak","year":"2005","unstructured":"Synak P, Bazan JG, Skowron A, Peters JF (2005) Spatio-temporal approximate reasoning over complex objects. Fundam Inform 67(1):249\u2013269","journal-title":"Fundam Inform"},{"key":"365_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-014-0273-x","author":"AH Tan","year":"2014","unstructured":"Tan AH, Li JJ (2014) A kind of approximations of generalized rough set model. Int J Mach Learn Cybernet. doi: 10.1007\/s13042-014-0273-x","journal-title":"Int J Mach Learn Cybernet"},{"key":"365_CR39","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ijar.2014.09.001","volume":"56","author":"AH Tan","year":"2015","unstructured":"Tan AH, Li JJ, Lin GP (2015) Connections between covering-based rough sets and concept lattices. Int J Approx Reason 56:43\u201358","journal-title":"Int J Approx Reason"},{"issue":"6","key":"365_CR40","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1287\/opre.19.6.1363","volume":"19","author":"C Toregas","year":"1971","unstructured":"Toregas C, Swain R, ReVelle C, Bergman L (1971) The location of emergency service facilities. Oper Res 19(6):1363\u20131373","journal-title":"Oper Res"},{"issue":"7","key":"365_CR41","first-page":"759","volume":"25","author":"GY Wang","year":"2002","unstructured":"Wang GY, Yu H, Yang DC (2002) Decision table reduction based on conditional information entropy. Chinese J Comput 25(7):759\u2013766","journal-title":"Chinese J Comput"},{"issue":"3","key":"365_CR42","doi-asserted-by":"crossref","first-page":"289","DOI":"10.3233\/FUN-2005-68305","volume":"68","author":"GY Wang","year":"2005","unstructured":"Wang GY, Zhao J, An JJ, Wu Y (2005) A comparative study of algebra viewpoint and information viewpoint in attribute reduction. Fundam Inform 68(3):289\u2013301","journal-title":"Fundam Inform"},{"issue":"6","key":"365_CR43","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF02943234","volume":"16","author":"J Wang","year":"2001","unstructured":"Wang J, Wang J (2001) Reduction algorithms based on discernibility matrix: the ordered attributes method. J Comput Sci Technol 16(6):489\u2013504","journal-title":"J Comput Sci Technol"},{"key":"365_CR44","unstructured":"Wang XZ, Li CG, A new definition of sensitivity for RBFNN and its applications to feature reduction, Advances in Neural NetworksCISNN, (2005) Springer. Berlin Heidelberg 2005:81\u201386"},{"key":"365_CR45","first-page":"693","volume":"33","author":"SKM Wong","year":"1985","unstructured":"Wong SKM, Ziarko W (1985) On optimal decision rules in decision tables. Bull Polish Acad Sci 33:693\u2013696","journal-title":"Bull Polish Acad Sci"},{"issue":"3","key":"365_CR46","first-page":"557","volume":"2","author":"SX Wu","year":"2004","unstructured":"Wu SX, Li MQ, Huang WT, Liu SF (2004) An improved heuristic algorithm of attribute reduction in rough set. J Syst Sci Inform 2(3):557\u2013562","journal-title":"J Syst Sci Inform"},{"issue":"3","key":"365_CR47","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.ins.2004.09.002","volume":"174","author":"WZ Wu","year":"2005","unstructured":"Wu WZ, Zhang M, Li HZ, Mi JS (2005) Knowledge reduction in random information systems via dempster-shafer theory of evidence. Inform Sci 174(3):143\u2013164","journal-title":"Inform Sci"},{"issue":"3","key":"365_CR48","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s13042-011-0054-8","volume":"3","author":"XB Yang","year":"2012","unstructured":"Yang XB, Song XN, Chen ZH, Yang JY (2012) On multigranulation rough sets in incomplete information system. Int J Machine Learn Cybernet 3(3):223\u2013232","journal-title":"Int J Machine Learn Cybernet"},{"issue":"1","key":"365_CR49","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0020-0255(98)10006-3","volume":"111","author":"YY Yao","year":"1998","unstructured":"Yao YY (1998) Relational interpretations of neighborhood operators and rough set approximation operators. Inform Sci 111(1):239\u2013259","journal-title":"Inform Sci"},{"issue":"23","key":"365_CR50","doi-asserted-by":"crossref","first-page":"3431","DOI":"10.1016\/j.ins.2006.02.002","volume":"176","author":"YY Yao","year":"2006","unstructured":"Yao YY (2006) Neighborhood systems and approximate retrieval. Inform Sci 176(23):3431\u20133452","journal-title":"Inform Sci"},{"issue":"7","key":"365_CR51","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. Inform Sci 179(7):867\u2013882","journal-title":"Inform Sci"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0365-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-015-0365-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0365-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-015-0365-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T19:40:58Z","timestamp":1748374858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-015-0365-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,3]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["365"],"URL":"https:\/\/doi.org\/10.1007\/s13042-015-0365-2","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2015,5,3]]}}}