The M-relative reduct problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4062 LNAI, Issue , 2006, Pages 170-175

  Min, Fan ^a   Liu, Qihe ^a   Tan, Hao ^a   Chen, Leiting ^a  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Discernibility matrix and function; M discerni bility matrix and function; M relative reduct and core; Reduct and core; Rough Sets

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; MATRIX ALGEBRA; ROUGH SET THEORY;

DISCERNIBILITY MATRIX AND FUNCTION; M-DISCERNIBILITY MATRIX AND FUNCTION; M-RELATIVE REDUCT AND CORE; REDUCT AND CORE;

PROBLEM SOLVING;

EID: 33746751463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11795131_25     Document Type: Conference Paper

References (6)

1. Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11 (1982) 341-356.
2. Wong, S.K.M., Ziarko, W.: On optimal decision rules in decision tables. Bulletin of polish academy of sciences 33 (1985) 693-696.
3. Wang, G., Yu, H., Yang, D.: Decision table reduction based on conditional information entropy. Chinese Journal of Computers 25(7) (2002) 1-8.
4. Min, F., Bai, Z., He, M., Liu, Q.: The reduct problem with specified attributes. In: Rough Sets and Soft Computing in Intelligent Agent and Web Technology, International Workshop at WI-IAT 2005. (2005) 36-42.
5. Pawlak, Z.: Some issues on rough sets. In Peters, J.F., Skowron, A., Grzymala-Busse, J.W., Kostek, B., Świniarski, R.W., Szczuka, M.S., eds.:Transactions on Rough Sets I. LNCS 3100. Springer-Verlag, Berlin Heidelberg (2004) 1-58.
6. Leung, Y., Li, D.: Maximal consistent block technique for rule acquisition in incomplete information systems. Information Sciences 153 (2003) 85-106.