A Method for Constructing Concentration Boolean Matrix
DOI:
https://doi.org/10.54691/93qrxn37Keywords:
Rough Set; Discernibility Matrix; Boolean Matrix; Concentration Boolean Matrix.Abstract
Attribute reduction is a significant problem in rough set theory. It has been widely applied in fields such as pattern recognition and data mining. The research on attribute reduction algorithms based on discernibility matrices has attracted continuous attention from scholars. This paper proposes a method for constructing concentration Boolean matrices. By investigating the row sums of Boolean matrices, multiple discernibility elements can be simultaneously removed. Through case studies, it is demonstrated that this method can identify all minimal discernibility elements without the need for element-by-element comparison.
Downloads
References
[1] Z. Pawlak: Rough sets, International Journal of Computer and Information Sciences, Vol.11(1982) No.5, p.341-356.
[2] S. Greco, B. Matarazzo and R. Slowinski: Rough sets theory for multicriteria decision analysis, European Journal of Operational Research, Vol.129 (2001) No.1, p.1-47.
[3] R.W. Swiniarski, A. Skowron: Rough set methods in feature selection and recognition, Pattern Recognition Letters, Vol. 24 (2003) No.6, p.833-849.
[4] H.M. Chen, T.R. Li, C. Luo, S.J. Horng and G.Y. Wang: A decision-theoretic rough set approach for dynamic data mining, IEEE Transactions on Fuzzy Systems, Vol. 23(2015) No.6, p.1958-1970.
[5] Z. Pawlak: Some remarks on conflict analysis, European Journal of Operational Research, Vol. 166 (2003) No.3, p.649-654.
[6] S. Tsumoto: Automated extraction of medical expert system rules from clinical databases based on rough set theory, Information Sciences, Vol. 112 (1998) No.1-4, p.67-84.
[7] Y.H. Xie, X.W. Gao: Topological reduction approaches for relation decision systems, International Journal of Approximate Reasoning, Vol.157 (2023), p.33-48.
[8] J.Y. Chen, P. Zhu: Feature selection of dominance-based neighborhood rough set approach for processing hybrid ordered data, International Journal of Approximate Reasoning, Vol.167 (2024), p.109134.
[9] M.W. Ding, T.F. Zhang and F.M. Ma: Incremental Attribute Reduction Algorithm Based on Binary Discernibility Matrix. Computer Engineering Vol.43 (2017) No.1, p.201-206. (In Chinese).
[10] F.M. Ma, M.W. Ding, T.F. Zhang and J. Cao: Compressed binary discernibility matrix based incremental attribute reduction algorithm for group dynamic data, Neurocomputing, Vol.344 (2019) , p.20-27.
[11] D. Li: Research on attribute reduction algorithms for data mining based on rough set (MS., Harbin Engineering University, China 2008), p.20 – 25.
[12] Y.Q. Wang, N.B. Fan: Improved Algorithms for Attribute Reduction Based on Simple Binary Discernibility Matrix, Computer Science, Vol.42(2015) No.6, p.210-215. (In Chinese).
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Scientific Journal of Intelligent Systems Research
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
