A new version of rough set exploration system

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

Volumn 2475, Issue , 2002, Pages 397-404

  Bazan, Jan G ^a   Szczuka, Marcin S ^b   Wróblewski, Jakub ^c  

^a UNIVERSITY OF RZESZÓW   (Poland)

^b UNIVERSITY OF WARSAW   (Poland)

^c POLISH JAPANESE INSTITUTE OF INFORMATION TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHICAL USER INTERFACES;

EXPLORATION SYSTEMS; ROUGH-SET BASED;

ROUGH SET THEORY;

EID: 84942889603     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45813-1_52     Document Type: Conference Paper

References (16)

1. Bay, S.D.: Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets. In: Proc. of 15 ICML, Morgan Kaufmann, Madison, 1998
2. Bazan J., A Comparison of Dynamic and non-Dynamic Rough Set Methods for Extracting Laws from Decision Tables, In [10], vol. 1, pp. 321–365
3. Bazan, J.G., Nguyen, H.S., Nguyen, S.H, Synak, P., Wróblewski, J.: Rough Set Algorithms in Classification Problem. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds), Rough Set Methods and Applications, Physica-Verlag, 2000 pp. 49–88.
4. Bazan J., Szczuka M. RSES and RSESlib–A Collection of Tools for Rough Set Computations, Proc. of RSCTC’2000, LNAI 2005, Springer Verlag, Berlin, 2001
5. Garey M., Johnson D., Computers and Intarctability: A Guide to the Theory of NP-completness, W.H. Freeman&Co., San Francisco, 1998, (twentieth print)
6. GrzymaIla-Busse J., A New Version of the Rule Induction System LERS Fundamenta Informaticae, Vol. 31(1), 1997, pp. 27–39
7. Nguyen Sinh Hoa, Nguyen Hung Son, Discretization Methods in Data Mining, In [10] vol. 1, pp. 451–482
8. Hoa S. Nguyen, A. Skowron and P. Synak, Discovery of Data Patterns with Applications to Decomposition and Classfification Problems. In [10] vol.2, pp. 55–97.
9. Michie D., Spiegelhalter D. J., Taylor C. C., Machine Learning, Neural and Statistical Classification, Ellis Horwood, London, 1994
10. Skowron A., Polkowski L.(ed.), Rough Sets in Knowledge Discovery vol. 1 and 2, Physica Verlag, Heidelberg, 1998
11. Ślȩzak D., Wróblewski J., Classification Algorithms Based on Linear Combinations of Features. In: Proc. of PKDD’99. LNAI 1704, Springer Verlag, Berlin, 1999, pp. 548–553.
12. Wróblewski J., Covering with Reducts–A Fast Algorithm for Rule Generation, Proceeding of RSCTC’98, LNAI 1424, Springer Verlag, Berlin, 1998, pp. 402–407
13. Wróblewski J.: Ensembles of classifiers based on approximate reducts, Fundamenta Informaticae 47 (3,4), IOS Press (2001) 351–360.
14. Bazan J., Szczuka M., The RSES Homepage, http://alfa.mimuw.edu.pl/~rses
15. Ørn A., The ROSETTA Homepage, http://www.idi.ntnu.no/~aleks/rosetta
16. Blake C.L., Merz C.J., UCI Repository of machine learning databases, Irvine, CA: University of California, 1998, http://www.ics.uci.edu/~mlearn