Discernibility matrix based algorithm for reduction of attributes

Proceedings - 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT 2006 Workshops Proceedings)

Volumn , Issue , 2006, Pages 477-480

  Wang, Ruizhi ^a   Miao, Duoqian ^a   Hu, Guirong ^a  

^a TONGJI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DECISION TABLES; INFORMATION SYSTEMS; MATRIX ALGEBRA; ONLINE SEARCHING; ROUGH SET THEORY;

DISCERNIBILITY MATRIX; MINIMAL REDUCT ALGORITHMS;

ALGORITHMS;

EID: 34250775975     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI-IATW.2006.58     Document Type: Conference Paper

References (6)

1. Pawlak, Z., Rough Sets - Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Dordrecht ,1991.
2. Ziarko, W.P.,"The Discovery, Analysis, and Representation of Data Dependencies in Databases", Piatesky-Shapiro, G. and Frawley, WJ. (eds.), Knowledge Discovery in Databases, AAAI Press/MIT Press, 1991, pp. 177-195.
3. Skowron, A., Rauszer, C., "The discemibility matrices and functions in information systems", Sl/owi nski, R., editor, Intelligent decision support: Handbook of applications and advances of rough set theory, Kluwer Academic Publishers, Dordrecht, volume 11, 1992, pp. 331-362.
4. Miao, D.Q., Rough Sets and Its Application in Machine Learning[D], Institute of Automation Chinese Academy of Sciences, Beijing, 1997.
5. Miao, D.Q., Wang J., "Analysis on Attribute Reduction Strategies of Rough Set", Chinese Journal of Computer Science and Technology, 1998, 13(2): 189-192.
6. Ye, D.Y., Chen, Z.J., "A New Discemibility Matrix and the Computation of a Core", Chinese Journal of Electronics, 2002, 30(7):1086-1088.