Local attribute value grouping for lazy rule induction

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

Volumn 2475, Issue , 2002, Pages 405-412

  Góra, Grzegorz ^a   Wojna, Arkadiusz ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ATTRIBUTE VALUES; DISCRETISATION; REAL VALUES; RULE INDUCTION; RULE INDUCTION ALGORITHMS; SYMBOLIC ATTRIBUTES; TIME COMPLEXITY;

ROUGH SET THEORY;

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

References (10)

1. Bazan, J.G. (1998). Discovery of decision rules by matching new objects against data tables. In: L. Polkowski, A. Skowron (eds.), Proceedings of the First International Conference on Rough Sets and Current Trends in Computing (RSCTC-98), Warsaw, Poland, pp. 521–528.
2. Bazan, J.G., Szczuka, M. (2000). RSES and RSESlib - A Collection of Tools for Rough Set Computations. In: W. Ziarko, Y. Yao (eds.), Proceedings of the Second International Conference on Rough Sets and Current Trends in Computing (RSCTC-2000), Banf, Canada, pp. 106–113.
3. Biberman, Y. (1994). A context similarity measure. Proceedings of the Ninth European Conference on Machine Learning, pp. 49–63, Catania, Italy: Springer-Verlag.
4. Friedman, J.H., Kohavi, R., Yun, Y. (1996). Lazy Decision Trees. Proceedings of the Thirteenth National Conference on Artificial Intelligence, Cambridge, pp. 717–724, MA: MIT Press.
5. Grzymala-Busse, J.W. (1992). LERS – A system for learning from examples based on rough sets. In: R. Slowinski (Ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory. Kluwer Academic Publishers, Dordrecht, Boston, London, pp. 3–18.
6. Grzymala-Busse, J.W., Stefanowski, J. (1997). Discretization of numerical attributes by direct use of the LEM2 induction algorithm with interval extension. Proceedings of the VI Int. Symp. on Intelligent Information Systems, Zakopane, IPI PAN Press, pp. 149–158.
7. Michalski, R.S. (1983). A theory and methodology of inductive learning. Artificial Intelligence, 20, pp. 111–161.
8. Nguyen, H. Son and Nguyen, S. Hoa. (1998). Discretization Methods in Data Mining In: Polkowski, L., Skowron A. (eds.) Rough sets in knowledge discovery 1 - methodology and applications, Physica-Verlag, Heidelberg, pp. 451–482.
9. Nguyen, S. Hoa (1999). Regularity analysis and its applications in data mining Ph.D Dissertation, Warsaw University.
10. Skowron, A. and Rauszer, C. (1992). The Discernibility Matrices and Functions in Information Systems. R. SHlowiński (ed.), Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, pp. 331–362, Dordrecht: Kluwer.