Rough computation based on similarity matrix

Authors:
Huang Bing;Guo Ling;He Xin;Xian-zhong Zhou
Affiliations:
Department of Computer Science & Technology, Nanjing Audit University, Nanjing, China;Department of Automation, Nanjing University of Science & Technology, Nanjing, China;Department of Automation, Nanjing University of Science & Technology, Nanjing, China;School of Engineering Management, Nanjing University, Nanjing, China
Venue:
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
Year:
2005

Citing 3
Cited 0

Rough set approach to incomplete information systems

Information Sciences: an International Journal
A Generalized Definition of Rough Approximations Based on Similarity

IEEE Transactions on Knowledge and Data Engineering
Approaches to approximation reducts in inconsistent decision tables

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Knowledge reduction is one of the most important tasks in rough set theory, and most types of reductions in this area are based on complete information systems. However, many information systems are not complete in real world. Though several extended relations have been presented under incomplete information systems, not all reduction approaches to these extended models have been examined. Based on similarity relation, the similarity matrix and the upper/lower approximation reduction are defined under incomplete information systems. To present similarity relation with similarity matrix, the rough computational methods based on similarity relation are studied. The heuristic algorithms for non-decision and decision incomplete information systems based on similarity matrix are proposed, and the time complexity of algorithms is analyzed. Finally, an example is given to illustrate the validity of these algorithms presented.