CAN: Chain of nodes approach to direct rule induction

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 29, Issue 6, 1999, Pages 758-770

  Kabakçioǧlu, Abdullah Mete ^a  

^a SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

Data analysis; Data mining; Entropy; Expert systems; Information theory; Knowledge discovery from databases; Machine learning; Optimal binary partitioning; Rule induction

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA MINING; DATA REDUCTION; DATABASE SYSTEMS;

CHAIN OF NODES (CAN) APPROACH;

LEARNING SYSTEMS;

EID: 0033280764     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.809030     Document Type: Article

References (46)

1. D. Aha, "Incremental constructive induction: An instance-based approach," Proc. 8th Int. Workshop Machine Learning, 1991, pp. 117-121.
2. F. Alonso, L. Maté, N. Juristo, P. L. Muñoz, and J. Pazos, "Applying metrics to machine-learning tools," AI Mag., vol. 15, Fall 1994.
3. O. Basarir, "Implementation and evaluation of CAN, a machine learning method, M.S. thesis, Univ. Miami, Coral Gables, FL, Aug. 1993.
4. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees. Los Angeles, CA: Wadsworth, 1984.
5. C. E. Brodley and P. E. Utgoff, "Multivariate decision trees," Mach. Learn., vol. 19, pp. 45-77, 1995.
6. D. Burshtein, V. D. Pietra, D. Kanevski, and A. Nadas, "A splitting theorem for tree construction, Tech. Rep. RC147574 (#66136), IBM, Yorktown Heights, NY, 1989.
7. J. Cendrowska, "PRISM: An algorithm for inducing modular rules," Int. J. Man-Mach. Stud., vol. 27, pp. 349-370, 1987.
8. G. Cestnik, I. Kononenko, and I. Bratko, "Assistant-86: A knowledge-elicitation tool for sophisticated users," in Progress in Machine Learning, Proc. 2nd European Working Session on Learning (EWSL-87, I. Bratko, N. Lavrac, Eds. Wilmslow, UK: Sigma, 1987, pp. 31-45.
9. K. C. C. Chan and A. K. C. Wong, "Performance analysis of a probabilistic inductive learning system," Machine Learning: Proc. 7th Int. Conf. Machine Learning. San Mateo, CA: Morgan Kaufman, 1990, pp. 16-23.
10. _, "APACS: A system for the automatic classification of conceptual patterns," Comput. Intell., vol. 6, pp. 119-131, 1989.
11. P. A. Chou, "Optimal partitioning for classification and regression trees," IEEE Trans. Pattern Anal. Machine Intell., vol. 13, no. 4, pp. 340-354, 1991.
12. P. Clark and R. Boswell, "Rule induction with C-V2: Some recent improvements," in Proc. 5th Eur. Machine Learning Conf. (EWSL-91), Y. Kodratoff, Ed. Berlin, Germany: Springer-Verlag, 1991, pp. 151-163.
13. P. Clark and T. Niblett, "The CN2 induction algorithm," Mach. Learn. J., vol. 3, no. 4, pp. 261-283, 1989.
14. _, "Induction in noisy domains," in Progress Machine Learning, Proc. 2nd Eur. Working Session Learning, I. Bratko and N. Lavrac, Eds. Wilmslow, U.K.: Sigma, 1987, pp. 11-30.
15. U. M. Fayyad, G. P. Shapiro, P. Smyth, and R. Uthumsamy, Advances in Knowledge Discovery and Data Mining. Cambridge, MA: MIT Press, 1996.
16. W. D. Fisher, "On grouping for maximum homogeneity," J. Amer. Stat. Assoc., vol. 53, pp. 789-798, 1958.
17. M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
18. C. R. P. Hartmann, P. K. Varshney, K. G. Mehrotra, and C. L. Gerberich, "Application of information theory to the construction of efficient decision trees," IEEE Trans. Inform. Theory, vol. IT-28, pp. 565-577, 1982.
19. R. C. Holte, "Very simple classification rules perform well on most commonly used datasets," Mach. Learn., vol. 11, no. 4, pp. 63-91, 1993.
20. L. Hyafi and R. L. Rivest, "Constructing optimal binary decision trees is NP-complete," Inf. Process. Lett., vol. 5, pp. 15-17, 1976.
21. A. M. Kabakçioǧlu, "TiEMPO: Temporal production system," IEEE Trans. Softw. Eng., to be published.
22. _, "Temporal learning," in Proc. Florida Artificial Intelligence Research Symp., Fort Lauderdale, FL, Apr. 1993.
23. _, "Induction of production rules for classification," in Proc. Florida Artificial Intelligence Research Symp., Fort Lauderdale, FL, 1992, pp. 206-211.
24. A. M. Kabakçiioǧlu, P. K. Varshney, and C. R. P. Hartmann, "Application of information theory to switching function minimization," Inst. Elect. Eng. Proc. Comput. Digital Techn., vol. 137, no. 5, pp. 389-393, 1990.
25. _, "An artificial intelligence approach to PLA optimization," in Proc. IEEE Int. Symp. Circuits Systems, Espoo, Finland, 1988.
26. A. M. Kabakçioǧlu "Switching function minimization by heuristic algorithms," M.S. thesis, Syracuse University, Syracuse, NY, 1984.
27. A. M. Kabakçioǧlu, P. K. Varshney, and C. R. P. Hartmann, "Application of information theory to switching function minimization," in Proc. IEEE Int. Symp. Information Theory, St. Jovite, Montreal, P.Q., Canada, 1983.
28. R. Kerber, "ChiMerge: Discretization of numeric attributes," in Proc. 10th Nat. Conf. Artificial Intelligence, 1992, pp. 123-128.
29. O. Mangasarian, R. Setiono, and W. Wolberg, "Pattern recognition via linear programming: Theory and application to medical diagnosis," Large-Scale Numerical Optimization, T. F. Coleman and Y. Li, Eds. Philadelphia, PA: SIAM, 1990.
30. M. Maza, "A prototype based symbolic concept learning system," ML'91: 8th Int. Workshop. San Mateo, CA: Morgan Kaufmann, 1991, pp. 117-121.
31. ∼mlearn/MLRepository.html, Irvine, CA: Dept. Inform. Comput. Sci., Univ. of Calif, 1996.
32. R. S. Michalski, I. Mozetic, J. Hong, and N. Lavrac, "The multi-purpose incremental learning system AQ15 and its testing application to three medical domains," in Proc. 5th Int. Conf. Artificial Intelligence, 1986, pp. 1041-1045.
33. R. S. Michalski and R. L. Chilausky, "Learning by being told and learning by examples: An experimental comparison of the two methods of knowledge acquisition in the context of developing an expert system for soybean disease diagnosis," J. Policy Anal. Inf. Syst., vol. 4, no. 2, 1980.
34. S. W. Norton, "Generating better decision trees," in Proc. 11th Int. Joint Conf. Artificial Intelligence, 1989, pp. 800-805.
35. I. Pitas, E. Milios, and A. N. Venetsanopoulos, "A minimum entropy approach to rule learning from examples," IEEE Trans. Syst, Man, Cybern., vol. 22, no. 4, 1992.
36. J. R. Quinlan, Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann, 1993.
37. _, "Decision trees and multi-valued attributes," Machine Intelligence, J. E. Hayes, D. Michie, and J. Richards, Eds. Oxford, U.K.: Oxford Univ. Press, 1988, vol. 11.
38. _, "Generating production rules from decision trees," in Proc. 10th Int. Joint Conf. Artificial Intelligence, 1987.
39. _, "Simplifying decision trees," Int. J. Man-Mach. Stud., vol. 27, pp. 221-234, 1987.
40. _, "The effect of noise on concept learning," Machine Learning: An Artificial Intelligence Approach, Michalski, Carbonell, and Mitchell, Eds. San Mateo, CA: Morgan Kaufmann, 1986, vol. 2, pp. 149-166, ch. 6.
41. _, "Learning efficient classification procedures and their application to chess end games," Machine Learning: An Artificial Intelligence Approach, Michalski, Carbonell, and Mitchell, Eds. Palo Alto, CA: Tioga, 1983.
42. P. Riddle, R. Segal, and O. Etzioni, "Representation design and brute-force induction in a Boeing manufacturing domain," Appl. Artif. Intell., vol. 8, pp. 125-147, 1994.
43. R. Rivest, "Learning decision trees," Mach. Learn., vol. 2, no. 3, pp. 229-246, 1987.
44. R. Segal and O. Etzioni, "Learning decision lists using homogeneous rules," AAAI-94, 1994.
45. P. Smyth and R. M. Goodman, "An information theoretic approach to rule induction from databases," IEEE Trans. Knowl. Data Eng., vol. 4, no. 4, 1992.
46. Y. Wu, S. Wang, and Q. Zhou, "An integrated framework of inducing rules from examples," Machine Learning: Proc. 7th Int. Conf. Machine Learning, San Mateo, CA: Morgan Kaufman, 1990, pp. 357-365.