Boolean Matrices and their Applications to Covering Reductions

• Autorzy: Zhu K. , Liu G. , Feng Y.

Identyfikatory

DOI

10.3233/FI-2015-1241

• Języki publikacji: EN

Abstrakty

EN

This paper proposes two different covering reduction algorithms by means of Boolean matrices. We define a dual notion of product on Boolean matrices and establish the relationship between characteristic matrix of a covering and relational matrices of two covering-induced relations, i.e. the minimum and the maximum relations in a covering. This paper shows that relational matrices of minimum and maximum relations in a covering can be written as intersection and union of many “elementary” matrices and each “elementary” matrix is corresponding to one element in the covering, respectively. Finally, as an application of this result, we propose two types of covering reduction algorithms.

Słowa kluczowe

EN

Boolean matrix; Boolean coproduct; covering-induced relation; covering reduction; rough set

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2015
• Tom: Vol. 139, nr 4
• Strony: 421--433
• Opis fizyczny: Bibliogr. 26 poz.

Twórcy

autor

Zhu K.

• School of Information Science Beijing Language and Culture University Beijing 100083, China

autor

Liu G.

• School of Information Science Beijing Language and Culture University Beijing 100083, China

autor

Feng Y.

• School of Information Science Beijing Language and Culture University Beijing 100083, China

Bibliografia

• [1] M. Beynon, Reducts within the variable precision rough sets model: a further investigation, European Journal of Operational Research 134 (2001) 592-605.
• [2] T. Fan, C. Liau, D. Liu, A relational perspective of attribute reduction in rough set-based data analysis, European Journal of Operational Research 213(2011) 270-278.
• [3] Q. He, C. Wu, D. Chen, S. Zhao, Fuzzy rough set based attribute reduction for information systems with fuzzy decisions, Knowledge-Based Systems 5 (2011) 689-696.
• [4] Q. Hu, D. Yu, Z. Xie, Neighborhood classifiers, Expert Systems with Applications 34 (2008) 866-876
• [5] B. Kolman, R. Busby, S.C. Ross, Discrete Mathematical structures(6th Edition), Pearson, Prentice Hall, 2009.
• [6] M. Kryszkiewicz, Rough set approach to incomplete information systems, Information Sciences 112 (1998) 39-49.
• [7] M. Kryszkiewicz, Comparative study of alternative type of knowledge reduction ininconsistent systems, International Journal of Intelligent Systems 16 (2001) 105-120.
• [8] Y. Leung, W. Wu, W. Zhang, Knowledge acquisition in incomplete information systems: A rough set approach, European Journal of Operational Research, 168(2006) 164-180.
• [9] G. Liu, W. Zhu Approximations in Rough Sets vs Granular Computing for Coverings, International Journal of Cognitive Informatics and Natural Intelligence 4(2)61-74.
• [10] E. Marczewski, A general scheme of independence in mathematics, Bulletin de L Academie Polonaise des Sciences–Serie des Sciences Mathematiques Astronomiques et Physiques 6(1958) 731-736.
• [11] J. Mi, W. Wu, W. Zhang, Approaches to knowledge reduction based on variable precision rough set model, Information Sciences, 159 (2004) 255-272.
• [12] S. Milici, Coverings of a complete graph with five-vertex and five-edge graphs, Discrete Mathematics 284(2004) 225-229.
• [13] Z. Pawlak, Rough sets, International journal of computer and information science 11(1982) 341-356.
• [14] Y. Qian, J. Liang, D. Li, F.Wang, N.Ma, Approximation reduction in inconsistent incomplete decision tables, Knowledge-Based Systems 5 (2010) 427-433.
• [15] A. Skowron, C. Rauszer, The discernibility matrices and functions in information systems, in: R. Slowinski (Ed.), Intelligent Decision Support, Handbook of Applications and Advances of the Rough Sets Theory, Kluwer, Academic, Dordrecht, 1992, pp. 331-362.
• [16] J. Stefanowski, On rough set based approaches to induction of decision rules, in: J. Polkowski, A. Skowron (Eds.), Rough Sets in Knowledge Discovery, vol. 1, Physica-Verlag, Heidelberg, 1998, pp. 500-529.
• [17] E.C.C. Tsang, D. Chen, D.S. Yeung, Approximations and reducts with covering generalized rough sets, Computers and Mathematics with Applications 56 (2008) 279-289.
• [18] C. Wang, C. Wu, D. Chen, A systematic study on attribute reduction with rough sets based on general binary relations, Information Sciences 178(2008) 2237-2261.
• [19] S. Wang, W. Zhu, Q. Zhu, F. Min, Characteristic matrix of covering and its application to Boolean matrix decomposition, Information Sciences 263(2014) 186-197.
• [20] Y. Xu, L. Wang, R. Zhang, A dynamic attribute reduction algorithm based on 0-1 integer programming, Knowledge-Based Systems 8(2011) 1341-1347.
• [21] T. Yan, Q. Li, Reduction about approximation spaces of covering generalized rough sets, International Journal of Approximate Reasoning 51(2010) 335-345.
• [22] Y. Yao, Constructive and algebraic methods of theory of rough sets, Information Sciences 109 (1998) 21-47.
• [23] Z. Yun, X. Ge, X. Bai, Axiomatization and conditions for neighborhoods in a covering to form a partition, Information Sciences 181(2011) 1735-1740.
• [24] P. Zhu, Covering rough sets based on neighborhoods: An approach without using neighborhoods, International Journal of Approximate Reasoning 52(2011) 461-472.
• [25] W. Zhu, F. Wang, Reduction and axiomiztion of covering generalized rough sets, Information Sciences 152(2003) 217-230.
• [26] W. Zhu, F. Wang, On three types of covering-based rough sets, IEEE Transactions on Knowledge and Data Engineering 19(2007) 1131-1143.