Improving the performance of an incremental algorithm driven by error margins

Intelligent Data Analysis

Volumn 12, Issue 3, 2008, Pages 305-318

  del Campo Ávilaa, José ^a   Ramos Jiméneza, Gonzalo ^a   Gamab, Joào ^b   Morales Buenoa, Rafael ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

Chernoff and Hoeffding bounds; Continuous attributes; Data mining; Decision trees; Functional leaves; Incremental learning; No example memory

Indexed keywords

EID: 51849158878     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2008-12305     Document Type: Article

References (30)

1. C. Blake and C.J. Merz, UCI repository of machine learning databases. University of California, Department of Information and Computer Science, 2000.
2. G. Castillo and J. Gama, An adaptive prequential learning framework for bayesian network classifiers, Lecture Notes in Artificial Intelligence 4123 (2006), 67-78.
3. N. Cesa-Bianchi, C. Gentile and L. Zaniboni, Incremental algorithms for hierarchical classification, Journal of Machine Learning Research 7 (2006), 31-54.
4. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sums of observations, Annals of Mathematical Statistics 23 (1952), 493-507.
5. P. Domingos and G. Hulten, Mining high-speed data streams. In Proc. of the 6th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, ACM Press, 2000, 71-80.
6. D.H. Fisher and J.C. Schlimmer, Models of incremental concept learning: A coupled research proposal. Technical Report CS-88-05, Vanderbilt University, 1998.
7. G. Folino, C. Pizzuti and G. Spezzano, A cellular genetic programming approach to classification. In Proc. of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann Publishers, 1999, 1015-1020.
8. J. Gama, Functional trees, Machine Learning 55(3) (2004), 18-32.
9. J. Gama, R. Rocha and P. Medas, Accurate decision trees for mining high-speed data streams, In Proc. of the 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, ACM Press, 2003, 523-528.
10. C. Giraud-Carrier, A note on the utility of incremental learning, AI Communications 13(4) (2000), 215-223.
11. W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963), 13-30.
12. R. Kohavi, Scaling up the accuracy of Naive-Bayes classifiers: A decision tree hybrid. In Proc. of the 2nd Int. Conf. on Knowledge Discovery and Data Mining, 1996, 202-207.
13. M.A. Maloof and R.S. Michalski, Selecting examples for partial memory learning, Machine Learning 41(1) (2000), 27-52.
14. M. Mehta, R. Agrawal and J. Rissanen, SLIQ: A fast scalable classifier for data mining, Lecture Notes in Computer Science 1057 (1996), 18-32.
15. R.S. Michalski, Knowledge repair mechanisms: Evolution vs. revolution. In Proc. 3rd Int. Workshop on Machine Learning, Skytop, PA., 1985, 116-119.
16. C. Perlich, F. Provost and J.S. Simonoff, Tree induction vs. logistic regression: A learningcurve analysis, Journal of Machine Learning Research 4(2003), 211-255.
17. R. Polikar, L. Udpa, S. Udpa and V. Honavar, Learn++: An incremental learning algorithm for supervised neural networks, IEEE Transactions on Systems, Man, and Cybernetics 31 (2001), 497-508.
18. J.R. Quinlan. Induction of decision trees, Machine Learning 1 (1986), 81-106.
19. J.R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann (1993).
20. G. Ramos-Jiménez, J. del Campo- Ávila and R. Morales-Bueno, Incremental algorithm driven by error margins, Lecture Notes in Artificial Intelligence 4265 (2006), 358-362.
21. R.E. Reinke and R.S. Michalski, Incremental learning of concept descriptions: A method and experimental results, In Machine Intelligence 11 (1988), Oxford University Press, 435-454.
22. J.C. Schlimmer and D.H. Fisher, A case study of incremental concept induction. In Proc. 5th Nat. Conf. on Artificial Intelligence, Philadelphia, Morgan Kaufmann, 1986, 496-501.
23. P. Sen, Estimates of the regression coefficient based on kendalls tau, Journal of the American Statistical Association 63 (1968), 1379-1389.
24. J.C. Shafer, R. Agrawal and M. Mehta, SPRINT: A scalable parallel classifier for data mining. In Proc. 22th Int. Conf. on Very Large Data Bases, Morgan Kaufmann Publishers, 1996, 544-555.
25. E.E. Smith and D.L. Medin, Categories and Concepts. Harvard University Press, 1981.
26. P. Utgoff, Perceptron trees: A case study in hybrid concept representations. In Proc. of the 7th National Conference on Artificial Intelligence, Morgan Kaufmann, 1988, 601-606.
27. P.E. Utgoff, N.C. Berkman and J.A. Clouse, Decision tree induction based on efficient tree restructuring, Machine Learning 29(1) (1997), 5-44.
28. H. Wang, W. Fan, P.S. Yu and J. Han, Mining concept-drifting data streams using ensemble classifiers. In Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, ACM Press, 2003, 226-235.
29. Ian H. Witten and Eibe Frank, Data Mining: Practical machine learning tools with Java implementations. Morgan Kaufmann, San Francisco, 2000.
30. J. Yang, W. Wang, P.S. Yu and J. Han, Mining long sequential patterns in a noisy environment. In Proc. ACM SIGMOD Int. Conf. on Management of Data, ACM Press, 2002, 406-417.