A New Incremental Updating Algorithm for Core Based on Simplified Discernibility Matrix

Article Preview

Abstract:

Firstly, the concept of simplified information system is introduced, the notion of simplified discerniblity matrix is put forward and the method for computing core based on the simplified discerniblity matrix, which can well deal with inconsistent information system. And it is proved that core based on the simplified discernibility matrix is equivalent to that based on the previous one, on the basis of that, an efficient algorithm incremental updating for core is presented, which only need to analyze the updating parts of discernibility matrix and doesn’t need to re-calculate discerniblily matrix, when a new object is added to information system. Finally, Theoretical analysis and example results show that the algorithm is efficient and feasible.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

931-936

Citation:

Online since:

June 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Pawlak Z, Skowron A. Rudiments of rough sets [J]. Information Science, 117(1): 3-37. (2007).

Google Scholar

[2] Skowron A. Rauszer C. The discernibility matrix and function in information systems [A]. In: Slowinski R. Intelligent Decision Support Handbook of Applications and Advances of the Rough Sets Theory [M]. Dordrecht. Kluwer Press, 331-362. (1992).

DOI: 10.1007/978-94-015-7975-9_21

Google Scholar

[3] Wang G. Y., Yu H., Yang D. C. Decision table reduction based on information entropy [J]. Chinese Journal of Computers, 2002, 25(7): 759-766.

Google Scholar

[4] Ye D. Y., Chen Z. J. A new discernibility matrix and the computation of a core[J]. Acata Electronica Sinica, 30(7): 1086-1088. (2002).

Google Scholar

[5] Ge H., Li L. S., Yang C.J. Quick algorithms for computing the core attribute [J]. Control and Decision, 24 (5): 738-742. (2009).

Google Scholar

[6] Yang M. An incremental updating algorithm of the computation of a core based on the imp roved discernibility matrix [J]. Chinese Journal of Computer, 29(3): 407-413. (2006).

Google Scholar

[7] Shen D. S. An incremental updating algorithm of the computation of a core based on the discernibility matrix[J]. Journal of Hangzhou Teachers College, 54(4): 37-40. (2007).

Google Scholar

[8] Xu Z. Y., Yang B. R. A quick attribution reduction algorithm with complexity of max {O (|U| |C|), O (|C| 2 |U /C|} [J]. Chinese Journal of Computer, 29 (3): 391-399. (2006).

Google Scholar