{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:39:44Z","timestamp":1759847984837},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2014,7,24]],"date-time":"2014-07-24T00:00:00Z","timestamp":1406160000000},"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":["Soft Comput"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00500-014-1382-x","type":"journal-article","created":{"date-parts":[[2014,7,23]],"date-time":"2014-07-23T03:47:02Z","timestamp":1406087222000},"page":"1973-1986","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Bidirectional heuristic attribute reduction based on conflict region"],"prefix":"10.1007","volume":"19","author":[{"given":"Hao","family":"Ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longshu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuanjian","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,24]]},"reference":[{"issue":"1\u20132","key":"1382_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0304-3975(97)00115-1","volume":"209","author":"E Amaldi","year":"1998","unstructured":"Amaldi E, Kann V (1998) On the approximation of minimizing non zero variables or unsatisfied relations in linear systems. Theor Comput Sci 209(1\u20132):237\u2013260","journal-title":"Theor Comput Sci"},{"issue":"9","key":"1382_CR2","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1080\/088395101753210773","volume":"15","author":"A Chouchoulas","year":"2001","unstructured":"Chouchoulas A, Shen Q (2001) Rough set-aided key word reduction for text categorization. Appl Artif Intell 15(9):843\u2013873","journal-title":"Appl Artif Intell"},{"issue":"1\u20132","key":"1382_CR3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0004-3702(03)00079-1","volume":"151","author":"M Dash","year":"2003","unstructured":"Dash M, Liu H (2003) Consistency-based search in feature selection. Artif Intell 151(1\u20132):155\u2013176","journal-title":"Artif Intell"},{"issue":"1","key":"1382_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0004-3702(98)00091-5","volume":"106","author":"I D\u00fcntsch","year":"1998","unstructured":"D\u00fcntsch I, Gediga G (1998) Uncertainty measures of rough set prediction. Artif Intell 106(1):109\u2013137","journal-title":"Artif Intell"},{"key":"1382_CR5","volume-title":"Advances in knowledge discovery and data mining","author":"UM Fayyad","year":"1996","unstructured":"Fayyad UM, Shapiro LP, Smyth P, Uthurusamy R (1996) Advances in knowledge discovery and data mining. MIT Press, California"},{"issue":"2","key":"1382_CR6","doi-asserted-by":"crossref","first-page":"342","DOI":"10.3724\/SP.J.1016.2012.00342","volume":"35","author":"H Ge","year":"2012","unstructured":"Ge H, Li LS, Yang CJ (2012) A efficient attribute reduction algorithm based on conflict region. Chin J Comput 35(2):342\u2013350","journal-title":"Chin J Comput"},{"key":"1382_CR7","unstructured":"Guan LH (2007) A new algorithm for attribute reduction based on discernibility matrix. In: Proceedings of the second international conference of fuzzy information and engineering, pp 373\u2013381"},{"issue":"3","key":"1382_CR8","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon I, Elisseeff A (2003) An introduction to variable feature selection. J Mach Learn Res 3(3):1157\u20131182","journal-title":"J Mach Learn Res"},{"issue":"2","key":"1382_CR9","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. Int J Comput Intel 11(2):323\u2013338","journal-title":"Int J Comput Intel"},{"issue":"1","key":"1382_CR10","first-page":"224","volume":"22","author":"AK Jain","year":"2000","unstructured":"Jain AK, Duin RPW, Mao JC (2000) Statistical pattern recognition: a review. IEEE Trans Pattern Anal 22(1):224\u201337","journal-title":"IEEE Trans Pattern Anal"},{"issue":"1\u20132","key":"1382_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0004-3702(97)00043-X","volume":"97","author":"R Kohavi","year":"1997","unstructured":"Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97(1\u20132):273\u2013324","journal-title":"Artif Intell"},{"key":"1382_CR12","doi-asserted-by":"crossref","unstructured":"Korze M, Jaroszewicz S (2005) Finding reducts without building the discernibility matrix. In: Proceedings of 5th international conference on intelligent systems design and applications, pp 450\u2013455","DOI":"10.1109\/ISDA.2005.45"},{"issue":"1","key":"1382_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/1098-111X(200101)16:1<105::AID-INT8>3.0.CO;2-S","volume":"16","author":"M Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz M (2001) Comparative studies of alternative type of knowledge reduction in inconsistent systems. Int J Intell Syst 16(1):105\u2013120","journal-title":"Int J Intell Syst"},{"key":"1382_CR14","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M (2007) Certain, generalized decision, and membership distribution reducts versus functional dependencies in incomplete systems. In: Proceedings of rough sets and intelligent systems paradigms, pp 162\u2013174","DOI":"10.1007\/978-3-540-73451-2_18"},{"key":"1382_CR15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.ins.2013.08.038","volume":"254","author":"M Li","year":"2014","unstructured":"Li M, Shang CX, Feng SZ, Fan JP (2014) Quick attribute reduction in inconsistent decision tables. Inf Sci 254:155\u2013180","journal-title":"Inf Sci"},{"issue":"1","key":"1382_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/S021848850200134X","volume":"10","author":"JY Liang","year":"2002","unstructured":"Liang JY, Xu ZB (2002) The algorithm on knowledge reduction in incomplete information systems. Int J Uncert Fuzziness Knowl-Based Syst 10(1):95\u2013103","journal-title":"Int J Uncert Fuzziness Knowl-Based Syst"},{"key":"1382_CR17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.knosys.2013.01.027","volume":"44","author":"JY Liang","year":"2013","unstructured":"Liang JY, Mi JR, Wei W, Wang F (2013) An accelerator for attribute reduction based on perspective of objects and attributes. Knowl-Based Syst 44:90\u2013100","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"1382_CR18","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ijar.2012.02.004","volume":"53","author":"JY Liang","year":"2012","unstructured":"Liang JY, Wang F, Deng CY, Qian YH (2012) An efficient rough feature selection algorithm with a multi-granulation view. Int J Approx Reson 53(6):912\u2013926","journal-title":"Int J Approx Reson"},{"key":"1382_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5689-3","volume-title":"Feature selection for knowledge discovery and data mining","author":"H Liu","year":"1998","unstructured":"Liu H, Motoda H (1998) Feature selection for knowledge discovery and data mining. Kluwer, Boston"},{"key":"1382_CR20","doi-asserted-by":"crossref","unstructured":"Liu H, Yu L (2005) Toward integrating feature selection algorithms for classification and clustering. IEEE Trans Knowl Data Eng 17(4):491\u2013502","DOI":"10.1109\/TKDE.2005.66"},{"key":"1382_CR21","unstructured":"Liu QH, Cai HB, Min F, Wang GW (2005) Knowledge reduction in a new information view. In: Proceedings of international conference on communications, pp 1051\u20131055"},{"issue":"5","key":"1382_CR22","first-page":"524","volume":"26","author":"SH Liu","year":"2003","unstructured":"Liu SH, Seng QJ, Wu B, Shi ZZ, Hu F (2003) Research on efficient algorithms for rough set methods. Chin J Comput 26(5):524\u2013529","journal-title":"Chin J Comput"},{"key":"1382_CR23","doi-asserted-by":"crossref","unstructured":"Liu Y, Huang WL, Jiang YL, Zeng ZY (2014) Quick attribute reduct algorithm for neighborhood rough set model. Inf Sci. doi: 10.1016\/j.ins.2014.02.093","DOI":"10.1016\/j.ins.2014.02.093"},{"issue":"8","key":"1382_CR24","first-page":"1494","volume":"32","author":"Y Liu","year":"2009","unstructured":"Liu Y, Xiong R, Chu J (2009) Quick attribute reduction algorithm with hash. Chin J Comput 32(8):1494\u20131499","journal-title":"Chin J Comput"},{"issue":"7","key":"1382_CR25","first-page":"1249","volume":"30","author":"ZQ Meng","year":"2009","unstructured":"Meng ZQ, Shi ZZ (2009) Novel heuristic algorithm for knowledge reduction. J Chin Comput Syst 30(7):1249\u20131255","journal-title":"J Chin Comput Syst"},{"issue":"6","key":"1382_CR26","first-page":"681","volume":"36","author":"DQ Miao","year":"1996","unstructured":"Miao DQ, Hu GR (1996) A heuristic algorithm for reduction of knowledge. Chin J Comput Res Develop 36(6):681\u2013684","journal-title":"Chin J Comput Res Develop"},{"issue":"2","key":"1382_CR27","first-page":"113","volume":"10","author":"DQ Miao","year":"1999","unstructured":"Miao DQ, Wang J (1999) An information representation of the concepts and operations in rough set theory. Chin J Soft 10(2):113\u2013116","journal-title":"Chin J Soft"},{"issue":"24","key":"1382_CR28","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 HX, Xu FF (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":"1382_CR29","doi-asserted-by":"crossref","unstructured":"Modrzejewski M (1993) Feature selection using rough sets theory. In: Proceedings of the European conference on machine learning, pp 213\u2013226","DOI":"10.1007\/3-540-56602-3_138"},{"key":"1382_CR30","unstructured":"Nguyen SH, Nguyen HS (1996) Some efficient algorithms for rough set methods. In: Proceedings of the international conference on information processing and management of uncertainty on knowledge based systems, pp 1451\u20131456"},{"issue":"11","key":"1382_CR31","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"5","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 5(11):341\u2013356","journal-title":"Int J Comput Inf Sci"},{"key":"1382_CR32","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, Boston"},{"issue":"1\u20134","key":"1382_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0255(02)00197-4","volume":"147","author":"Z Pawlak","year":"2002","unstructured":"Pawlak Z (2002) Rough sets and intelligent data analysis. Inf Sci 147(1\u20134):1\u201312","journal-title":"Inf Sci"},{"issue":"8","key":"1382_CR34","doi-asserted-by":"crossref","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng H, Long F, Ding C (2005) Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans Pattern Anal Mach Intell 27(8):1226\u20131238","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"1382_CR35","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 Uncert Fuzziness Knowle-Based Syst 16(2):179\u2013193","journal-title":"Int J Uncert Fuzziness Knowle-Based Syst"},{"key":"1382_CR36","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"},{"issue":"8","key":"1382_CR37","doi-asserted-by":"crossref","first-page":"1658","DOI":"10.1016\/j.patcog.2011.02.020","volume":"44","author":"YH Qian","year":"2011","unstructured":"Qian YH, Liang JY, Pedrycz W, Dang CY (2011a) An efficient accelerator for attribute reduction from incomplete data in rough set framework. Pattern Recogn 44(8):1658\u20131670","journal-title":"Pattern Recogn"},{"issue":"2","key":"1382_CR38","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.ijar.2010.07.011","volume":"52","author":"J Qian","year":"2011","unstructured":"Qian J, Miao DQ, Zhang ZH, Li W (2011b) Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation. Int J Approx Reason 52(2):212\u2013230","journal-title":"Int J Approx Reason"},{"issue":"1","key":"1382_CR39","first-page":"81","volume":"1","author":"R Quinlan","year":"1986","unstructured":"Quinlan R (1986) Induction of decision rules. Mach Learn 1(1):81\u2013106","journal-title":"Mach Learn"},{"issue":"19","key":"1382_CR40","doi-asserted-by":"crossref","first-page":"2507","DOI":"10.1093\/bioinformatics\/btm344","volume":"23","author":"Y Saeys","year":"2007","unstructured":"Saeys Y, Inza I, Larra\u00f1aga P (2007) A review of feature selection techniques in bioinformatics. Bioinformatics 23(19):2507\u20132517","journal-title":"Bioinformatics"},{"issue":"3","key":"1382_CR41","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0952-1976(00)00010-5","volume":"13","author":"Q Shen","year":"2000","unstructured":"Shen Q, Chouchoulas A (2000) A modular approach to generating fuzzy rules with reduced attributes for the monitoring of complex systems. Eng Appl Artif Intell 13(3):263\u2013278","journal-title":"Eng Appl Artif Intell"},{"issue":"11","key":"1382_CR42","doi-asserted-by":"crossref","first-page":"2438","DOI":"10.1016\/S0031-3203(01)00229-1","volume":"35","author":"Q Shen","year":"2002","unstructured":"Shen Q, Chouchoulas A (2002) A rough-fuzzy approach for generating classification rules. Pattern Recogn 35(11):2438\u20132452","journal-title":"Pattern Recogn"},{"issue":"7","key":"1382_CR43","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1016\/j.patcog.2003.10.016","volume":"37","author":"Q Shen","year":"2004","unstructured":"Shen Q, Jensen R (2004) Selecting informative features with fuzzy-rough sets and its application for complex systems monitoring. Pattern Recogn 37(7):1351\u20131363","journal-title":"Pattern Recogn"},{"key":"1382_CR44","first-page":"331","volume-title":"The discernibility matrices and functions in information systems. Intelligent decision support, handbook of applications and advances of the rough sets theory","author":"A Skowron","year":"1992","unstructured":"Skowron A, Rauszer C (1992) The discernibility matrices and functions in information systems. Intelligent decision support, handbook of applications and advances of the rough sets theory. Kluwer, Dordrecht, pp 331\u2013362"},{"issue":"3\u20134","key":"1382_CR45","first-page":"365","volume":"53","author":"D Slezak","year":"2002","unstructured":"Slezak D (2002) Approximate entropy reducts. Fund Inf 53(3\u20134):365\u2013390","journal-title":"Fund Inf"},{"issue":"6","key":"1382_CR46","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"},{"key":"1382_CR47","doi-asserted-by":"crossref","unstructured":"Wang GY, Hu F (2007) Quick knowledge reduction based on divide and conquer method in huge data sets. In: Proceedings of the 2nd international conference on pattern recognition and machine intelligence, pp 312\u2013315","DOI":"10.1007\/978-3-540-77046-6_39"},{"issue":"7","key":"1382_CR48","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. Chin J Comput 25(7):759\u2013766","journal-title":"Chin J Comput"},{"issue":"3","key":"1382_CR49","first-page":"289","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. Fund Inform 68(3):289\u2013301","journal-title":"Fund Inform"},{"issue":"5","key":"1382_CR50","first-page":"393","volume":"21","author":"J Wang","year":"1998","unstructured":"Wang J, Wang R, Miao DQ, Guo M, Ruan YS, Yuan XH, Zhao K (1998) Data enriching based on rough set theory. C J Comput 21(5):393\u2013400","journal-title":"C J Comput"},{"issue":"6","key":"1382_CR51","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\u201304","journal-title":"J Comput Sci Technol"},{"key":"1382_CR52","unstructured":"Wong S, Ziarko W (1985) On optimal decision rules in decision tables. University of Regina, Department of Computer Science, pp 693\u2013696"},{"key":"1382_CR53","unstructured":"Xu ZY, Liu ZP, Yang BR, Song W (2006) A quick attribute reduction algorithm with complexity of max(O( $$\\vert C\\vert \\vert U\\vert )$$ | C | | U | ) , O( $$\\vert C\\vert ^{2}\\vert U$$ | C | 2 | U \/ $$C\\vert ))$$ C | ) ) . Chin J Comput 29(3):611\u2013615"},{"key":"1382_CR54","doi-asserted-by":"crossref","unstructured":"Yao YY, Zhao Y (2009) Discernibility matrix simplification for constructing attribute reducts. Inf Sci 179(7):867\u2013882","DOI":"10.1016\/j.ins.2008.11.020"},{"key":"1382_CR55","volume-title":"A new heuristic reduct algorithm base on rough sets theory. LNCS 2762","author":"J Zhang","year":"2003","unstructured":"Zhang J, Wang J, Li D, He H, Sun J (2003a) A new heuristic reduct algorithm base on rough sets theory. LNCS 2762. Springer, Berlin"},{"issue":"9","key":"1382_CR56","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1002\/int.10128","volume":"18","author":"WX Zhang","year":"2003","unstructured":"Zhang WX, Mi JS, Wu WZ (2003b) Approaches to knowledge reductions in inconsistent systems. Int J Intell Syst 18(9):989\u20131000","journal-title":"Int J Intell Syst"},{"key":"1382_CR57","first-page":"12","volume":"1","author":"WX Zhang","year":"2003","unstructured":"Zhang WX, Mi JS, Wu WZ (2003c) Knowledge reduction in inconsistent information systems. Chin J Comput 1:12\u201318","journal-title":"Chin J Comput"},{"issue":"3","key":"1382_CR58","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10115-010-0306-z","volume":"27","author":"Z Zhang","year":"2011","unstructured":"Zhang Z, Ye N (2011) Locality preserving multimodal discriminative learning for supervised feature selection. Knowl Inf Syst 27(3):473\u2013490","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"1382_CR59","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011219601502","volume":"16","author":"N Zhong","year":"2001","unstructured":"Zhong N, Dong J, Ohsuga S (2001) Using rough sets with heuristics for feature selection. J Int Inform Syst 16(3):199\u2013214","journal-title":"J Int Inform Syst"},{"key":"1382_CR60","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1007\/s00500-011-0690-7","volume":"15","author":"J Zhou","year":"2011","unstructured":"Zhou J, Miao DQ, Pedrycz W, Zhang HY (2011) Analysis of alternative objective functions for attribute reduction in complete decision tables. Soft Comput 15:1601\u20131616","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1382-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1382-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1382-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:43:40Z","timestamp":1559079820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1382-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,24]]},"references-count":60,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1382"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1382-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,24]]}}}