A data pre-processing method using association rules of attributes for improving decision tree

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

Volumn 1574, Issue , 1999, Pages 143-147

  Terabe, Masahiro ^a   Katai, Osamu ^b   Sawaragi, Tetsuo ^b   Washio, Takashi ^c   Motoda, Hiroshi ^c  

^a MITSUBISHI RESEARCH INSTITUTE   (Japan)

^b KYOTO UNIVERSITY   (Japan)

^c OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; DATA HANDLING; DECISION TREES; LOGIC PROGRAMMING; PROCESSING; TREES (MATHEMATICS);

DATA PREPROCESSING; DATA-DRIVEN APPROACH; PRIORI KNOWLEDGE; RUNTIMES; SELECTION METHODS;

DATA MINING;

EID: 84947723384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48912-6_20     Document Type: Conference Paper

References (5)

1. Agrawal, R. et al.: Fast Algorithms for mining association rules. Proc. of the 20th VLDB Conference. (1994) 487-499.
2. Berry, M.J.A. et al.: Data Mining Techniques For Marketing, Sales, and Customer Support. Wiley. (1997)
3. Lavrac, N. et al.: A relevancy filter for constructive induction, IEEE Intelligent Systems & their applications 13 2 (1998) 50-56
4. Merz, C.J. et al.: UCI Repository of machine learning databases. (1998) [http://www.ics.uci.edu/mlearn/MLRepository.html]
5. Quinlan, R.: C4.5: Programs for Machine Learning. Morgan Kaufmann. (1993)