{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T18:39:02Z","timestamp":1768675142536,"version":"3.49.0"},"reference-count":41,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T00:00:00Z","timestamp":1594944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502538"],"award-info":[{"award-number":["61502538"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61273185"],"award-info":[{"award-number":["61273185"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61321003"],"award-info":[{"award-number":["61321003"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Attribute reduction is one of the challenging problems in rough set theory. To accomplish an efficient reduction algorithm, this paper analyzes the shortcomings of the traditional methods based on attribute significance, and suggests a novel reduction way where the traditional attribute significance calculation is replaced by a special core attribute calculation. A decision table called the positive region sort ascending decision table (PR-SADT) is defined to optimize some key steps of the novel reduction method, including the special core attribute calculation, positive region calculation, etc. On this basis, a fast reduction algorithm is presented to obtain a complete positive region reduct. Experimental tests demonstrate that the novel reduction algorithm achieves obviously high computational efficiency.<\/jats:p>","DOI":"10.3390\/sym12071189","type":"journal-article","created":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T05:10:30Z","timestamp":1595394630000},"page":"1189","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Fast Attribute Reduction Algorithm Based on a Positive Region Sort Ascending Decision Table"],"prefix":"10.3390","volume":"12","author":[{"given":"Linzi","family":"Yin","sequence":"first","affiliation":[{"name":"School of Physics and Electronics, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohui","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Automation, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,7,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.artint.2010.04.018","article-title":"Positive approximation: An accelerator for attribute reduction in rough set theory","volume":"174","author":"Qian","year":"2010","journal-title":"Artif. Intell."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.knosys.2007.07.001","article-title":"Mixed feature selection based on granulation and approximation","volume":"21","author":"Hu","year":"2008","journal-title":"Knowl. Based Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ijar.2015.01.005","article-title":"Monotonic uncertainty measures for attribute reduction in probabilistic rough set model","volume":"59","author":"Wang","year":"2015","journal-title":"Int. J. Approx. Reason."},{"key":"ref_4","first-page":"99","article-title":"A novel attribute reduction method based on rough sets and its application","volume":"4","author":"Chang","year":"2012","journal-title":"Int. J. Adv. Comput. Technol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.eswa.2006.10.043","article-title":"Neighborhood classifiers","volume":"34","author":"Hu","year":"2008","journal-title":"Expert Syst. Appl."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ijar.2012.02.004","article-title":"An efficient rough feature selection algorithm with a multi-granulation view","volume":"53","author":"Liang","year":"2012","journal-title":"Int. J. Approx. Reason."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.physa.2017.09.059","article-title":"Big data prediction of durations for online collective actions based on peak\u2019s timing","volume":"492","author":"Nie","year":"2018","journal-title":"Phys. A-Stat. Mech. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Skowron, A., Jankowski, A., and Swiniarski, R. (2013). 30 Years of Rough Sets and Future Perspectives, Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Springer.","DOI":"10.1007\/978-3-642-41218-9_1"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.physa.2018.09.090","article-title":"Trip destination prediction based on multi-day GPS data","volume":"515","author":"Zong","year":"2019","journal-title":"Phys. A-Stat. Mech. Appl."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ins.2013.04.002","article-title":"Core set analysis in inconsistent decision tables","volume":"241","author":"Yin","year":"2013","journal-title":"Inf. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/JAS.2015.7296538","article-title":"Security risk assessment of cyber physical power system based on rough set and gene expression programming","volume":"2","author":"Deng","year":"2015","journal-title":"IEEE\/CAA J. Autom. Sin."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3509","DOI":"10.1016\/j.patcog.2007.03.017","article-title":"Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation","volume":"40","author":"Hu","year":"2007","journal-title":"Pattern Recognit."},{"key":"ref_13","first-page":"1049","article-title":"Algorithms based on general discernibility matrix for computation of a core and attribute reduction","volume":"23","author":"Yang","year":"2008","journal-title":"Control Decis."},{"key":"ref_14","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":"Inf. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.patrec.2013.09.012","article-title":"A fast selection approach based on rough set boundary regions","volume":"36","author":"Lu","year":"2014","journal-title":"Pattern Recognit. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1142\/S0218488508005121","article-title":"Combination entropy and combination granulation in rough set theory","volume":"16","author":"Qian","year":"2008","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Wang, C., and Ou, F.F. (2008, January 20\u201322). An attribute reduction algorithm based on conditional entropy and frequency of attributes. Proceedings of the International Conference on Intelligent Computation Technology and Automation, Changsha, China.","DOI":"10.1109\/ICICTA.2008.95"},{"key":"ref_18","first-page":"289","article-title":"A comparative study of algebra viewpoint and information viewpoint in attribute reduction","volume":"68","author":"Wang","year":"2005","journal-title":"Fundam. Inform."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/j.ins.2014.04.019","article-title":"Parallel attribute reduction algorithms using MapReduce","volume":"279","author":"Qian","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.datak.2015.06.009","article-title":"An incremental approach to attribute reduction from dynamic incomplete decision systems in rough set theory","volume":"100","author":"Shu","year":"2015","journal-title":"Data Knowl. Eng."},{"key":"ref_21","first-page":"397","article-title":"An incremental algorithm for attribute reduction based on labeled discernibility matrix","volume":"40","author":"Yin","year":"2014","journal-title":"Acta Autom. Sin."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.3233\/FI-2013-895","article-title":"Duality in rough set theory based on the square of opposition","volume":"127","author":"Yao","year":"2013","journal-title":"Fundam. Inform."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.patrec.2009.10.013","article-title":"A rough set approach to feature selection based on ant colony optimization","volume":"31","author":"Chen","year":"2010","journal-title":"Pattern Recognit. Lett."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Yang, P., Li, J., and Huang, Y. (2008, January 18\u201320). An attribute reduction algorithm by rough set based on binary discernibility matrix. Proceedings of the Fuzzy Systems and Knowledge Discovery, Jinan, China.","DOI":"10.1109\/FSKD.2008.355"},{"key":"ref_25","first-page":"4","article-title":"Quick computing core algorithm based on discernibility matrix","volume":"42","author":"Xu","year":"2006","journal-title":"Comput. Eng. Appl."},{"key":"ref_26","first-page":"865","article-title":"Improvement of discernibility matrix and the computation of a core","volume":"43","author":"Yang","year":"2004","journal-title":"J. Fudan. Univ."},{"key":"ref_27","first-page":"208","article-title":"Quick algorithm for computing core of the positive region based on order relation","volume":"37","author":"Xu","year":"2010","journal-title":"Comput. Sci."},{"key":"ref_28","first-page":"524","article-title":"Research on efficient algorithms for rough set methods","volume":"26","author":"Liu","year":"2003","journal-title":"Chin. J. Comput."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Shen, J., and Lv, Y. (2010, January 25\u201327). A rapid algorithm for reduction based on positive region attribute significance. Proceedings of the Electrical and Control Engineering (ICECE), 2010 International Conference on, Wuhan, China.","DOI":"10.1109\/iCECE.2010.1195"},{"key":"ref_30","first-page":"391","article-title":"A Quick Attribute reduction algorithm with complexity of max (O(|C||U|,O(|C|2|U\/C|)))","volume":"29","author":"Xu","year":"2006","journal-title":"Chin. J. Comput."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhang, X.Y., and Xu, W.H. (2018). Lower approximation reduction based on discernibility information tree in inconsistent ordered decision information systems. Symmetry, 10.","DOI":"10.3390\/sym10120696"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"4959","DOI":"10.1016\/j.ins.2007.06.031","article-title":"Data analysis based on discernibility and indiscernibility","volume":"177","author":"Zhao","year":"2007","journal-title":"Inf. Sci."},{"key":"ref_33","first-page":"434","article-title":"Reduction method based on attribute repulsion matrix","volume":"28","author":"Yin","year":"2013","journal-title":"Control Decis."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1109\/JAS.2018.7511213","article-title":"Granular computing for data analytics: a manifesto of human-centric computing","volume":"5","author":"Witold","year":"2018","journal-title":"IEEE\/CAA J. Autom. Sin."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.ijar.2010.07.011","article-title":"Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation","volume":"52","author":"Qian","year":"2011","journal-title":"Int. J. Approx. Reason."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Yao, Y.Y., Zhao, Y., and Wang, J. (2006). On reduct construction algorithms. Rough Sets and Knowledge Technology, Springer.","DOI":"10.1007\/11795131_43"},{"key":"ref_37","first-page":"55","article-title":"An enhancement of major sorting algorithms","volume":"7","author":"Jehad","year":"2010","journal-title":"Int. Arab J. Inf. Technol."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"2774","DOI":"10.1016\/j.ins.2009.04.002","article-title":"A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets","volume":"179","author":"Meng","year":"2009","journal-title":"Inf. Sci."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1658","DOI":"10.1016\/j.patcog.2011.02.020","article-title":"An efficient accelerator for attribute reduction from incomplete data in rough set framework","volume":"44","author":"Qian","year":"2011","journal-title":"Pattern Recognit."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.ins.2013.08.038","article-title":"Quick attribute reduction in inconsistent decision tables","volume":"254","author":"Li","year":"2014","journal-title":"Inf. Sci."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Song, M., and Wu, Y.F. (2009). Handbook of Research on Text and Web Mining Technologies, IGI Global. Chapter XLIV.","DOI":"10.4018\/978-1-59904-990-8"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/7\/1189\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:49:23Z","timestamp":1760176163000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/7\/1189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,17]]},"references-count":41,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2020,7]]}},"alternative-id":["sym12071189"],"URL":"https:\/\/doi.org\/10.3390\/sym12071189","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,17]]}}}