Decision algorithm for finding reduct based on approximation quality of rough set

Kongzhi yu Juece/Control and Decision

Volumn 18, Issue 3, 2003, Pages 313-316

  Xu, De You ^a   Hu, Shou Song ^a  

^a NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS   (China)

Author keywords

Approximation quality; Decision table; Reduct; Rough set; Set approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CLASSIFICATION (OF INFORMATION); MATHEMATICAL TECHNIQUES;

DECISION TABLE; REDUCT; ROUGH SET; SET APPROXIMATION;

ROUGH SET THEORY;

EID: 0042467427     PISSN: 10010920     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. Pawlak Z. Rough sets [J]. Int J of Information and Computer Science, 1982, 11(5): 341-356.
2. Ziarko W. The discovery, analysis and representation of data dependencies in databases [A]. Knowledge Discovery in Databases [C]. Cambridge: AAAI/MIT Press, 1990. 213-228.
3. Skowron A. The discernibility matrices and functions in information systems [A]. Intelligent Decision Suppot - Handbook of Advances and Applications of the Rough Set Theory [C]. Dordrecht, Boston, London: Kluwer Academic Publishers, 1992. 311-369.
4. Kryszkiewicz M, Rybinski H. Finding reducts in composed information systems [A]. Proc From Int Work-shop on Rough Sets and Knowledge Discovery RSKD'93 [C]. Banff, 1993. 259-268.
5. Sever H. Knowledge structuring for database mining and text retrieval using past optimal queries [D]. The University of Southwestern Louisiana, 1995.