{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:42:03Z","timestamp":1777696923874,"version":"3.51.4"},"reference-count":35,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2016,3,1]]},"DOI":"10.3233\/ida-160807","type":"journal-article","created":{"date-parts":[[2016,3,8]],"date-time":"2016-03-08T10:50:03Z","timestamp":1457434203000},"page":"317-337","source":"Crossref","is-referenced-by-count":10,"title":["A new algorithm for computing reducts based on the binary discernibility matrix"],"prefix":"10.1177","volume":"20","author":[{"given":"Manuel S.","family":"Lazo-Cort\u00e9s","sequence":"first","affiliation":[{"name":"Instituto Nacional de Astrof\u00edsica, \u00d3ptica y Electr\u00f3nica, Puebla, M\u00e9xico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.Fco.","family":"Mart\u00ednez-Trinidad","sequence":"additional","affiliation":[{"name":"Instituto Nacional de Astrof\u00edsica, \u00d3ptica y Electr\u00f3nica, Puebla, M\u00e9xico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.A.","family":"Carrasco-Ochoa","sequence":"additional","affiliation":[{"name":"Instituto Nacional de Astrof\u00edsica, \u00d3ptica y Electr\u00f3nica, Puebla, M\u00e9xico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo Sanchez","family":"Diaz","sequence":"additional","affiliation":[{"name":"Universidad Aut\u00f3noma de San Luis Potos\u00ed, San Luis Potos\u00ed, M\u00e9xico"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-160807_ref1","first-page":"487","volume-title":"Fast algorithms for mining association rules in large databases","author":"Agrawal","year":"1994"},{"key":"10.3233\/IDA-160807_ref3","doi-asserted-by":"crossref","unstructured":"Bai X., Zhang M., Qiu Y. and Wu Q., Algorithm for decision rules reduction in incomplete information system based on binary discernibility matrix, Int Conf on Mechatronics and Automation ICMA 2009, (2009), 4061-4066.","DOI":"10.1109\/ICMA.2009.5246634"},{"key":"10.3233\/IDA-160807_ref4","doi-asserted-by":"crossref","unstructured":"Bazan J.G., Nguyen H.S., Nguyen S.H., Synak P. and Wr\u00f3blewski J., Rough set algorithms in classification problems, in: Rough Set Methods and Applications: New Developments in Knowledge Discovery in Information Systems, Studies in Fuzziness and Soft Computing, Vol. 56, L. Polkowski, T.Y. Lin and S. Tsumoto, eds, Springer-Verlag\/Physica-Verlag, Heidelberg, 2000, pp. 49-88.","DOI":"10.1007\/978-3-7908-1840-6_3"},{"key":"10.3233\/IDA-160807_ref5","doi-asserted-by":"crossref","unstructured":"Bazan J.G. and Szczuka M.S., RSES and RSESlib - a collection of tools for rough set computations, Proc of 2nd Int Conf Rough Sets and Current Trends in Computing, (2000), 106-113.","DOI":"10.1007\/3-540-45554-X_12"},{"issue":"17","key":"10.3233\/IDA-160807_ref6","doi-asserted-by":"crossref","first-page":"3500","DOI":"10.1016\/j.ins.2007.02.041","article-title":"A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets","volume":"177","author":"Chen","year":"2007","journal-title":"Information Sciences"},{"key":"10.3233\/IDA-160807_ref7","first-page":"949","article-title":"Knowledge reduction based on binary discernibility matrix in variable precision rough set","volume":"6","author":"Chen","year":"2006","journal-title":"Int Symp on Communications and Information Technologies ISCIT"},{"issue":"4","key":"10.3233\/IDA-160807_ref8","doi-asserted-by":"crossref","first-page":"2858","DOI":"10.1016\/j.eswa.2007.05.037","article-title":"An efficient bit-based feature selection method","volume":"34","author":"Chen","year":"2008","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-160807_ref9","doi-asserted-by":"crossref","unstructured":"Felix R. and Ushio T., Rough sets-based machine learning using a binary discernibility matrix, Proc 2th on Intelligent Processing and Manufacturing of Materials (1999), 299-305.","DOI":"10.1109\/IPMM.1999.792493"},{"issue":"2","key":"10.3233\/IDA-160807_ref10","first-page":"323","article-title":"Learning in relational databases: A rough set approach","volume":"11","author":"Hu","year":"1995","journal-title":"Computation Intelligence, An International Journal"},{"key":"10.3233\/IDA-160807_ref11","doi-asserted-by":"crossref","unstructured":"Jensen R. and Shen Q., A rough set-aided system for sorting WWW bookmarks, in: Web Intelligence: Research and Development, N. Zhong, Y. Yao, J. Liu and S. Ohsuga, eds, LNAI 2198, Springer-Verlag Berlin Heidelberg, 2001, pp. 95-105.","DOI":"10.1007\/3-540-45490-X_10"},{"issue":"7","key":"10.3233\/IDA-160807_ref12","doi-asserted-by":"crossref","first-page":"8229","DOI":"10.1016\/j.eswa.2011.01.002","article-title":"A boolean function approach to feature selection in consistent decision information systems","volume":"38","author":"Kahramanli","year":"2011","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.3233\/IDA-160807_ref13","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.ejor.2004.03.032","article-title":"Knowledge acquisition in incomplete information systems: A rough set approach","volume":"168","author":"Leung","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/IDA-160807_ref14","doi-asserted-by":"crossref","unstructured":"Li J., Wang X. and Fan X., Improved binary discernibility matrix attribute reduction algorithm in customer relationship management, Procedia Engineering 7 (2010), 473-476.","DOI":"10.1016\/j.proeng.2010.11.078"},{"issue":"3","key":"10.3233\/IDA-160807_ref15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ins.2003.07.004","article-title":"Approaches to knowledge reduction based on variable precision rough set model","volume":"159","author":"Mi","year":"2004","journal-title":"Information Sciences"},{"issue":"4","key":"10.3233\/IDA-160807_ref16","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/S1571-0661(04)80718-7","article-title":"On the decision table with maximal number of reducts","volume":"82","author":"Nguyen","year":"2003","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.3233\/IDA-160807_ref17","doi-asserted-by":"crossref","unstructured":"Nguyen H.S., Approximate Boolean reasoning: Foundations and applications in data mining, in: Transactions on Rough Sets V, J.F. Peters and A. Skowron, eds, LNCS 4100, Springer-Verlag Berlin Heidelberg, 2006, pp. 334-506.","DOI":"10.1007\/11847465_16"},{"key":"10.3233\/IDA-160807_ref18","unstructured":"Nguyen S.H. and Nguyen H.S., Some efficient algorithms for rough set methods, Proc Sixth Int Conf on Information Processing and Management of Uncertainty on Knowledge Based Systems (1996), 1451-1456."},{"key":"10.3233\/IDA-160807_ref19","first-page":"572","article-title":"The ROSETTA software system","volume":"19","author":"Ohrn","year":"1998","journal-title":"Rough Sets in Knowledge Discovery 1: Methodology and Applications"},{"issue":"5","key":"10.3233\/IDA-160807_ref20","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","author":"Pawlak","year":"1982","journal-title":"International Journal of Computer and Information Sciences"},{"issue":"1","key":"10.3233\/IDA-160807_ref22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ins.2006.06.007","article-title":"Rough sets and boolean reasoning","volume":"177","author":"Pawlak","year":"2007","journal-title":"Information Sciences"},{"issue":"1-4","key":"10.3233\/IDA-160807_ref23","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0020-0255(99)00075-4","article-title":"\u03b1-RST: A generalization of rough set theory","volume":"124","author":"Quafafou","year":"2000","journal-title":"Information Sciences"},{"issue":"3","key":"10.3233\/IDA-160807_ref24","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0952-1976(00)00010-5","article-title":"A modular approach to generating fuzzy rules with reduced attributes for the monitoring of complex systems","volume":"13","author":"Shen","year":"2000","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.3233\/IDA-160807_ref26","doi-asserted-by":"crossref","unstructured":"Skowron A. and Rauszer C., The discernibility matrices and functions in information systems, in: Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, System Theory, Knowledge Engineering and Problem Solving, Vol. 11, R. S\u019aowi\u0144ski, ed., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1992, pp. 331-362.","DOI":"10.1007\/978-94-015-7975-9_21"},{"key":"10.3233\/IDA-160807_ref27","first-page":"565","article-title":"Rough sets methods in feature reduction and classification","volume":"11","author":"Swiniarski","year":"2001","journal-title":"International Journal of Applied Mathematics and Computer Science"},{"key":"10.3233\/IDA-160807_ref28","doi-asserted-by":"crossref","unstructured":"Terlecki P., On the relation between jumping emerging patterns and rough set theory with application to data classification, in: Transactions on Rough Sets XII, J.F. Peters, A. Skowron, R. S\u019aowi\u0144ski, P. Lingras, D. Miao and S. Tsumoto, eds, LNCS 6190, Springer-Verlag Berlin Heidelberg, 2010, pp. 236-338.","DOI":"10.1007\/978-3-642-14467-7_13"},{"issue":"3","key":"10.3233\/IDA-160807_ref29","doi-asserted-by":"crossref","first-page":"270","DOI":"10.7763\/IJFCC.2012.V1.72","article-title":"Reduct generation from binary discernibility matrix: an hardware approach","volume":"1","author":"Tiwari","year":"2012","journal-title":"International Journal of Future Computer and Communication"},{"issue":"2","key":"10.3233\/IDA-160807_ref30","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02946606","article-title":"Analysis on attribute reduction strategies of rough set","volume":"13","author":"Wang","year":"1998","journal-title":"Journal of Computer Science and Technology"},{"issue":"6","key":"10.3233\/IDA-160807_ref31","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF02943234","article-title":"Reduction algorithms based on discernibility matrix: the ordered attributes method","volume":"16","author":"Wang","year":"2001","journal-title":"Journal of Computer Science and Technology"},{"key":"10.3233\/IDA-160807_ref32","unstructured":"Wr\u00f3blewski J., Finding minimal reducts using genetic algorithm (extended version), in: Proceedings of the International Workshop on Rough Sets Soft Computing at Second Annual Joint Conference on Information Sciences (JCIS'95), P.P. Wang, ed., Wrightsville Beach, NC, USA, 1995, pp. 186-189. See also: ICS Research Report 16\/95, Warsaw University of Technology."},{"key":"10.3233\/IDA-160807_ref33","doi-asserted-by":"crossref","unstructured":"Yao Y.Y., Zhao Y., Wang J. and Han S., A model of machine learning based on user preference of attributes, in: Rough Sets and Current Trends in Computing, S. Greco, Y. Hata, S. Hirano, M. Inuiguchi, S. Miyamoto, H.S. Nguyen and R. S\u019aowi\u0144ski, eds, LNAI 4259, Springer-Verlag Berlin Heidelberg, 2006, pp. 587-596.","DOI":"10.1007\/11908029_61"},{"issue":"7","key":"10.3233\/IDA-160807_ref34","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.ins.2008.11.020","article-title":"Discernibility matrix simplification for constructing attribute reducts","volume":"179","author":"Yao","year":"2009","journal-title":"Information Sciences"},{"issue":"4-6","key":"10.3233\/IDA-160807_ref35","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1016\/j.neucom.2007.09.003","article-title":"A novel condensing tree structure for rough set feature selection","volume":"71","author":"Yang","year":"2008","journal-title":"Neurocomputing"},{"key":"10.3233\/IDA-160807_ref36","unstructured":"Yang P., Li J. and Huang Y., An attribute reduction algorithm by rough set based on binary discernibility matrix, Proc Fifth Int Conf on Fuzzy Systems and Knowledge Discovery IEEE 2 (2008), 276-280."},{"issue":"5","key":"10.3233\/IDA-160807_ref37","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1007\/BF02948826","article-title":"A reduction algorithm meeting users' requirements","volume":"17","author":"Zhao","year":"2002","journal-title":"Journal of Computer Science and Technology"},{"key":"10.3233\/IDA-160807_ref38","unstructured":"Ziarko W., Rough set approaches for discovering rules and attribute dependencies, in: Handbook of Data Mining and Knowledge Discovery, Vol. 271, W. Kl\u00f6sgen and J.M. \u017bytkow, eds, Oxford University Press, Inc., New York, NY, USA, 2002, pp. 328-339."}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-160807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:21:20Z","timestamp":1777454480000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-160807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,1]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/ida-160807","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,1]]}}}