{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:04:52Z","timestamp":1768421092514,"version":"3.49.0"},"reference-count":47,"publisher":"International Academy Publishing (IAP)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSW"],"DOI":"10.4304\/jsw.7.11.2640-2648","type":"journal-article","created":{"date-parts":[[2012,11,27]],"date-time":"2012-11-27T19:36:55Z","timestamp":1354045015000},"source":"Crossref","is-referenced-by-count":3,"title":["An Attribute Reduction Algorithm Based on Genetic Algorithm and Discernibility Matrix"],"prefix":"10.17706","volume":"7","author":[{"given":"Zhengjiang","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingmin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2012,11,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01001956"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.31"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.39"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69115-4"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7908-1883-3","volume-title":"Rough Sets in Knowledge Discovery","volume":"1","author":"Polkowski","year":"1998","unstructured":"[6] L. Polkowski, A. Skowron (Eds.), Rough Sets in Knowledge Discovery, vol. 1, Physica-Verlag, Berlin, 1998."},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7908-1883-3","volume-title":"Rough Sets in Knowledge Discovery","volume":"2","author":"Polkowski","year":"1998","unstructured":"[7] L. Polkowski, A. Skowron (Eds.), Rough Sets in Knowledge Discovery, vol. 2, Physica-Verlag, Berlin, 1998."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.06.006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/69.842271"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1996-272311","article-title":"Tolerance approximation spaces","volume":"27","author":"Skowron","year":"1996","unstructured":"[10] A. Skowron, J. Stepaniuk, Tolerance approximation spaces, Fundamenta Informaticae. 1996, 27: 245\u2013253.","journal-title":"Fundamenta Informaticae"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.06.021"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.05.037"},{"key":"ref12","first-page":"298","volume-title":"On generalizing pawlak approximation operators","volume":"1424","author":"Yao","year":"1998","unstructured":"[13] Y.Y. Yao, On generalizing pawlak approximation operators, in: LNAI, vol. 1424, 1998, pp. 298\u2013307."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(98)10006-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(98)00012-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(97)10046-9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.01.006"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.09.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.11.013"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.06.009"},{"key":"ref20","article-title":"Relationship between generalized rough sets based on binary relation and coverings","author":"Zhu","year":"2008","unstructured":"[22] W. Zhu, Relationship between generalized rough sets based on binary relation and coverings, Information Sciences 2008.","journal-title":"Inf Sci","ISSN":"https:\/\/id.crossref.org\/issn\/0020-0255","issn-type":"print"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2006.12.104"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2007.03.018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.02.041"},{"issue":"1","key":"ref24","first-page":"130","article-title":"On the properties of covering rough sets model","volume":"33","author":"Xu","year":"2005","unstructured":"[26] Z. Xu, Q. Wang, On the properties of covering rough sets model, Journal of Henan Normal University (Natural Science) 2005. 33 (1): 130\u2013132.","journal-title":"Journal of Henan Normal University"},{"key":"ref25","first-page":"4200","article-title":"On the upper approximations of covering generalized rough sets","volume-title":"Proceedings of the 3rd International Conference on Machine Learning and Cybernetics","author":"Tsang","year":"2004","unstructured":"[27] E. Tsang, D. Chen, J. Lee, D.S. Yeung, On the upper approximations of covering generalized rough sets, in: Proceedings of the 3rd International Conference on Machine Learning and Cybernetics, 2004, pp. 4200\u20134203."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1044"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.05.024"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2006.10.043"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.03.017"},{"key":"ref30","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7975-9_21","article-title":"The discernibility matrices and functions in information systems","volume-title":"Intelligent Decision Support Handbook of Applications and Advances of the Rough Sets Theory","author":"Skowron","year":"1992","unstructured":"[33] A. Skowron, C. Rauszer. The discernibility matrices and functions in information systems, in: R. Slowi\u0144ski (Ed.), Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, Kluwer, 1992. Dordrecht ."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.11.020"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.06.031"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.03.032"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(98)00097-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0792-66"},{"key":"ref37","first-page":"265","article-title":"Understanding interactions among genetic algorithm parameters","volume-title":"Foundations of Genetic Algorithm 5","author":"Deb","year":"1998","unstructured":"[41] K. Deb, S. Agrawal, Understanding interactions among genetic algorithm parameters, in: W. Banzhaf, C. Reeves (Eds.) Foundations of Genetic Algorithm 5, Morgan Kaufmann, San Francisco, CA, 1998, pp. 265\u2013286."},{"key":"ref38","first-page":"1","volume-title":"Adaptation in Natural and Artificial Systems","author":"Holland","year":"1975","unstructured":"[42] Holland J H. Adaptation in Natural and Artificial Systems [M].Ann Arbor, Michigan: University of Michigan Press,1975,1-17."},{"key":"ref39","volume-title":"Rough sets Theoretical Aspects of Reasoning About Data","author":"Pawlak","year":"1991","unstructured":"[43] Z. Pawlak. Rough sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht, Boston 1991"},{"key":"ref40","volume-title":"Information Systems and Knowledge Discovery","author":"Zhang","year":"2003","unstructured":"[44] W.X. Zhang, Y. Leung, W.Z. Wu. Information Systems and Knowledge Discovery. Science Publishing Company, Beijing . 2003. (in Chinese.)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.06.007"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2009.11.001"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2011.08.278"},{"key":"ref43","doi-asserted-by":"crossref","unstructured":"[3] F. Hu, G.Y. Wang, H. Huang, a.l. et Incremental Attribute Reduction Based on Elementary Sets, RSFDGrC 2005, 3641, 2005, pp. 185\u2013193.","DOI":"10.1016\/j.proeng.2011.08.278"},{"key":"ref43","doi-asserted-by":"crossref","unstructured":"[17] E. Bryniarski, A calculus of rough sets of the first order, Bull. Pol. Acad. Sci. 1989, 36 (16) (1989) 71\u201377.","DOI":"10.1016\/j.proeng.2011.08.278"},{"key":"ref43","doi-asserted-by":"crossref","unstructured":"[28] W. Zhu, F.Y. Wang, A new type of covering rough sets, in: IEEE IS 2006, London, 4\u20136 September, 2006, pp. 444\u2013449.","DOI":"10.1016\/j.proeng.2011.08.278"},{"key":"ref43","doi-asserted-by":"crossref","unstructured":"[40] Wroblewski, J. Finding minimal reducts using genetic algorithms[C]\/\/ Proceedings of the Second Annual Joint Conference on Information Sciences. Wrightsville Beach, USA, 1995: 186-189.","DOI":"10.1016\/j.proeng.2011.08.278"}],"container-title":["Journal of Software"],"original-title":[],"deposited":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T01:36:47Z","timestamp":1594949807000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jsw\/article\/view\/8746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,1]]},"references-count":47,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2012,11,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jsw.7.11.2640-2648","relation":{},"ISSN":["1796-217X"],"issn-type":[{"value":"1796-217X","type":"print"}],"subject":[],"published":{"date-parts":[[2012,11,1]]}}}