Pairwise cores in information systems

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

Volumn 3641 LNAI, Issue , 2005, Pages 166-175

  Wróblewski, Jakub ^a  

^a POLISH JAPANESE INSTITUTE OF INFORMATION TECHNOLOGY   (Poland)

Author keywords

Core; Pairwise core; Reduct finding algorithms; Reducts

Indexed keywords

DATA MINING; GRAPHIC METHODS; INFORMATION SCIENCE; POLYNOMIALS;

CORE; CORE CONSTRUCTION; FINDING METHODS; GRAPH REPRESENTATION; PAIRWISE CORE; REDUCT FINDING ALGORITHMS; REDUCTS;

ALGORITHMS;

EID: 33646003573     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11548669_18     Document Type: Conference Paper

References (12)

1. Bazan J., Nguyen H.S., Nguyen S.H., Synak P., Wróblewski J.: Rough Set Algorithms in Classification Problem. In: L. Polkowski, S. Tsumoto, T.Y. Lin (ed.): Rough Set Methods and Applications. Physica-Verlag, Heidelberg, New York (2000) 49-88.
2. Garey M.R., Johnson D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco (1979).
3. Hu X., Lin T. Y., Han J.: A New Rough Sets Model Based on Database Systems. Fundamenta Informaticae 59 (2,3), IOS Press (2004) 135-152.
4. Kryszkiewicz M., Cichon K.: Towards Scalable Algorithms for Discovering Rough Set Reducts. In: J.F. Peters et al. (eds.), Transaction on Rough Sets vol. I. Springer (LNCS 3100), Berlin, Heidelberg (2004) 120-143.
5. UCI Machine Learning Rep.: http://www.ics.uci.edu/~mlearn/MLRepository. html.
6. Miao D., Hou L.: An Application of Rough Sets to Monk's Problems Solving. Proc. of the RSFDGrC2003, Springer (LNAI 2639), Berlin, Heidelberg (2003) 138-145.
7. Pawlak, Z.: Rough sets - Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Dordrecht (1991).
8. RSES - Rough Set Exploration System: http://logic.mimuw.edu.pl/~rses/
9. Skowron A., Rauszer C.: The discernibility matrices and functions in information systems. W: R. Slowinski (ed.). Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory. Kluwer, Dordrecht (1992) 311-362.
10. Wróblewski J.: Finding minimal reducts using genetic algorithms. Proc. of the Second Annual Join Conference on Information Sciences, Wrightsville Beach, NC (1995) 186-189, http://www.mimuw.edu.pl/~jakubw/bib/
11. Wróblewski J.: Covering with reducts - a fast algorithm for rule generation. Proc. of RSCTC'98, Warsaw, Poland. Springer-Verlag (LNAI 1424), Berlin Heidelberg (1998) 402-407, http://www.mimuw.edu.pl/~jakubw/bib/
12. Wróblewski J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae 47 (3,4), IOS Press (2001) 351-360.