Learning model trees from evolving data streams

Data Mining and Knowledge Discovery

Volumn 23, Issue 1, 2011, Pages 128-168

  Ikonomovska, Elena ^a,d   Gama, João ^b,c   Džeroski, Sašo ^a  

^a JO EF STEFAN INSTITUTE   (Slovenia)

^b UNIVERSITY OF PORTO   (Portugal)

^c UNIVERSITY OF PORTO   (Portugal)

^d SS CYRIL AND METHODIUS UNIVERSITY   (Macedonia)

Author keywords

Concept drift; Incremental algorithms; Model trees; Non stationary data streams; On line change detection; On line learning; Regression trees; Stream data mining

Indexed keywords

CONCEPT DRIFTS; INCREMENTAL ALGORITHM; MODEL TREES; NONSTATIONARY DATA; ONLINE CHANGE DETECTION; ONLINE LEARNING; REGRESSION TREES; STREAM DATA MINING;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; DATA MINING; PLANT EXTRACTS; REGRESSION ANALYSIS;

TREES (MATHEMATICS);

EID: 79960103750     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10618-010-0201-y     Document Type: Article

References (51)

1. Aggarwal CC (2006) Data streams: models and algorithms. Springer, New York
2. Basseville M, Nikiforov I (1993) Detection of abrupt changes: theory and applications. Prentice-Hall, Englewood Cliffs, NJ
3. Blake C, Keogh E, Merz C (1999) UCI repository of machine learning databases. http://archive.ics.uci.edu/ ml. Accessed 19 Jan 2010
4. Breiman L (1998) Arcing classifiers. Ann Stat 26(3):801-824
5. Breiman L, Friedman JH, Olshen RA, Stone CJ (1998) Classification and regression trees. CRC Press, Boca Raton, FL
6. Chaudhuri P, Huang M, Loh W, Yao R (1994) Piecewise polynomial regression trees. Stat Sin 4:143-167
7. Chen Y, Dong G, Han J, Wah BW, Wang J (2002) Multi-dimensional regression analysis of time-series data streams. In: Proc the 28th int conf on very large databases. Morgan Kaufmann, San Francisco, pp 323-334
8. CUBIST (2009) RuleQuest research. http://www.rulequest.com/cubist-info. html. Accessed 19 Jan 2010
9. Dasu T, Krishnan S, Lin D, Venkatasubramanian S, Yi K (2009) Change (detection) you can believe in: finding distributional shifts in data streams. In: Proc IDA'09. Springer, Berlin, pp 21-34
10. Data Expo (2009) ASA sections on statistical computing and statistical graphics. http://stat-computing.org/ dataexpo/2009. Accessed 19 Jan 2010
11. Dawid AP (1984) Statistical theory: the prequential approach. J R Stat Soc A 147:278-292
12. Dobra A, Gherke J (2002) SECRET: a scalable linear regression tree algorithm. In: Proc 8th ACMSIGKDD int conf on knowledge discovery and data mining. ACM Press, New York, pp 481-487
13. Domingos P, Hulten G (2000) Mining high speed data streams. In: Proc 6th ACM SIGKDD int conf on knowledge discovery and data mining. ACM Press, New York, pp 71-80
14. Friedman JH (1991) Multivariate adaptive regression splines. J Ann Stat 19(1):1-67. doi:10.1214/aos/ 1176347963
15. Gama J, Castillo G (2004) Learning with local drift detection. In: Proc 2nd int conf on advanced data mining and applications, LNCS, vol 4093. Springer, Berlin, pp 42-55 (Pubitemid 44503141)
16. Gama J, Rocha R, Medas P (2003) Accurate decision trees for mining high-speed data streams. In: Proc 9th ACM SIGKDD int conf on knowledge discovery and data mining. ACM Press, New York, pp 523-528
17. Gama J, Medas P, Rocha R (2004) Forest trees for on-line data. In: Proc 2004 ACMsymposium on applied computing. ACM Press, New York, pp 632-636
18. Gama J, Sebastiao R, Rodrigues PP (2009) Issues in evaluation of stream learning algorithms. In: Proc 16th ACM SIGKDD int conf on knowledge discovery and data mining. ACM Press, New York, pp 329-338
19. Gammerman A, Vovk V (2002) Prediction algorithms and confidence measures based on algorithmic randomness theory. J Theor Comput Sci 287:209-217 (Pubitemid 35019166)
20. Gammerman A, Vovk V (2007) Hedging predictions in machine learning. Comput J 50:151-163 (Pubitemid 46416421)
21. Gao J, Fan W, Han J, Yu PS (2007) A general framework for mining concept-drifting data streams with skewed distributions. In: Proc 7th int conf on data mining, SIAM, Philadelphia, PA
22. Geman S, Bienenstock E, Doursat R (1992) Neural networks and the bias/variance dilemma. J Neural Comput 4:1-58
23. Gratch J (1996) Sequential inductive learning. In: Proc 13th natl conf on artificial intelligence and 8th innovative applications of artificial intelligence conf, vol 1. AAAI Press, Menlo Park, CA, pp 779- 786
24. Hoeffding W (1963) Probability for sums of bounded random variables. J Am Stat Assoc 58:13-30
25. Hulten G, Spencer L, Domingos P (2001) Mining time-changing data streams. In: Proc 7th ACMSIGKDD int conf on knowledge discovery and data mining. ACM Press, New York, pp 97-106
26. Ikonomovska E, Gama J (2008) Learning model trees from data streams. In: Proc 11th int conf on discovery science, LNAI, vol. 5255. Springer, Berlin, pp 52-63
27. Ikonomovska E, Gama J, Sebastião R, Gjorgjevik D (2009) Regression trees from data streams with drift detection. In: Proc 11th int conf on discovery science, LNAI, vol 5808. Springer, Berlin, pp 121-135
28. Jin R, Agrawal G (2003) Efficient decision tree construction on streaming data. In: Proc 9th ACMSIGKDD int conf on knowledge discovery and data mining. ACM Press, New York, pp 571-576
29. Karalic A (1992) Employing linear regression in regression tree leaves. In: Proc 10th European conf on artificial intelligence. Wiley, New York, pp 440-441
30. Kifer D, Ben-David S, Gehrke J (2004) Detecting change in data streams. In: Proc 30th int conf on very large data bases. Morgan Kaufmann, San Francisco, pp 180-191
31. Klinkenberg R, Joachims T (2000) Detecting concept drift with support vector machines. In: Proc 17th int conf on machine learning. Morgan Kaufmann, San Francisco 487-494
32. Klinkenberg R, Renz I (1998) Adaptive information filtering: learning in the presence of concept drifts. In: Proc AAAI98/ICML-98 wshp on learning for text categorization. AAAI Press, Menlo Park, pp 33-40
33. Loh W (2002) Regression trees with unbiased variable selection and interaction detection (2002). Stat Sin 12:361-386 (Pubitemid 36116175)
34. Malerba D, Appice A, Ceci M, Monopoli M (2002) Trading-off local versus global effects of regression nodes in model trees. In: Proc 13th int symposium on foundations of intelligent systems, LNCS, vol 2366. Springer, Berlin, pp 393-402
35. Mouss H, Mouss D, Mouss N, Sefouhi L (2004) Test of Page-Hinckley, an approach for fault detection in an agro-alimentary production system. In: Proc 5th Asian control conference, vol 2. IEEE Computer Society, Los Alamitos, CA, pp 815-818 (Pubitemid 40455896)
36. Musick R, Catlett J, Russell S (1993) Decision theoretic sub-sampling for induction on large databases. In: Proc 10th int conf on machine learning. Morgan Kaufmann, San Francisco, pp 212-219
37. Pang KP, Ting KM (2005) Improving the centered CUSUMS statistic for structural break detection in time series. In: Proc 17th Australian joint conf on artificial intelligence, LNCS, vol 3339. Springer, Berlin, pp 402-413
38. Pfahringer B, Holmes G, Kirkby R (2008) Handling numeric attributes in Hoeffding trees. In: Proc 12th Pacific-Asian conf on knowledge discovery and data mining, LNCS, vol 5012. Springer, Berlin, pp 296-307 (Pubitemid 351776325)
39. Potts D, Sammut C (2005) Incremental learning of linear model trees. J Mach Learn 61:5-48. doi:10.1007/ s10994-005-1121-8 (Pubitemid 43049361)
40. Quinlan JR (1992) Learning with continuous classes. In: Proc 5th Australian joint conf on artificial intelligence. World Scientific, Singapore, pp 343-348
41. Rajaraman K, Tan (2001) A topic detection, tracking, and trend analysis using self-organizing neural networks. In: Proc 5th Pacific-Asian conf on knowledge discovery and data mining, LNCS, vol 2035. Springer, Berlin, pp 102-107 (Pubitemid 33255099)
42. Rodrigues PP, Gama J, Bosnic Z (2008) Online reliability estimates for individual predictions in data streams. In: Proc IEEE int conf on data mining workshops. IEEE Computer Society, Los Alamitos, CA, pp 36-45
43. Sebastiao R, Rodrigues PP, Gama J (2009) Change detection in climate data over the Iberian peninsula. In: Proc IEEE int conf on data mining workshops. IEEE Computer Society, Los Alamitos, CA, pp 248-253
44. Siciliano R, Mola F (1994) Modeling for recursive partitioning and variable selection. In: Proc int conf on computational statistics. Physica Verlag, Heidelberg, pp 172-177
45. Song X, Wu M, Jermaine C, Ranka S (2007) Statistical change detection for multidimensional data. In: Proc 13th ACM SIGKDD conf on knowledge discovery and data mining, pp 667-676 (Pubitemid 350229252)
46. Subramaniam S, Palpanas T, Papadopulous D, Kalogeraki V, Ginopulos D (2006) Online outlier detection in sensor data using non-parametric methods. In: Proc 32nd int conf on very large databases, ACM, New York, pp 187-198
47. Torgo L (1997) Functional models for regression tree leaves. In: Proc 14th int conf on machine learning. Morgan Kaufmann, San Francisco, pp 385-393
48. VFML (2003) A toolkit for mining high-speed time-changing data streams. http://www.cs.washington.edu/ dm/vfml. Accessed 19 Jan 2010
49. Vogel DS, Asparouhov O, Scheffer T (2007) Scalable look-ahead linear regression trees. In: Berkhin P, Caruana R, Wu X (eds) Proc 13th ACM SIGKDD int conf on knowledge discovery and data mining, KDD. ACMK, San Jose, CA, pp 757-764 (Pubitemid 350229261)
50. WEKA 3 (2005) Data Mining Software in Java. http://www.cs.waikato.ac.nz/ ml/weka. Accessed 19 Jan 2010
51. Widmer G, Kubat M (1996) Learning in the presence of concept drifts and hidden contexts. J Mach Learn 23:69-101. doi:10.1007/BF00116900 (Pubitemid 126737384)