Efficient instance-based learning on data streams

Intelligent Data Analysis

Volumn 11, Issue 6, 2007, Pages 627-650

  Beringer, Jürgen ^a   Hüllermeier, Eyke ^b  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

Classification; Concept drift; Data streams; Instance based learning

Indexed keywords

EID: 51349124012     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2007-11604     Document Type: Article

References (57)

1. C.C. Aggarwal (editor), Data Streams: Models and Algorithms, Springer-Verlag, Berlin, 2006.
2. C.C. Aggarwal, J. Han, J. Wang and P.S. Yu, A framework for clustering evolving data streams. In Proc. VLDB, Int. Conf. on Very Large Data Bases, Berlin, Germany, 2003.
3. D.W. Aha, editor, Lazy Learning. Kluwer Academic Publ., 1997.
4. D.W. Aha, D. Kibler and M.K. Albert, Instance-based learning algorithms, Machine Learning 6(1) (1991), 37-66.
5. B. Babcock, S. Babu, M. Datar, R. Motwani and J. Widom, Models and issues in data stream systems. In Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, Madison, Wisconsin, USA, ACM, 2002, 1-16.
6. S. Ben-David, J. Gehrke and D. Kifer, Detecting change in data streams. In Proc. VLDB-04, 2004.
7. J. Bercken, B. Blohsfeld, J. Dittrich, J. Krämer, T. Schäfer, M. Schneider and B. Seeger, XXL - a library approach to supporting effcient implementations of advanced database queries. In Proceedings of the VLDB, 2001, 39-48.
8. M. Cherniack, H. Balakrishnan, M. Balazinska, D. Carney, U. Cetintemel, Y. Xing and S. Zdonik, Scalable distributed stream processing. In Proceedings CIDR-03: FirstBiennial Conference on Innovative Database Systems, Asilomar, CA, 2003.
9. P. Ciaccia, M. Patella, F. Rabitti and P. Zezula, Indexing metric spaces with M-tree. In Matteo Cristiani and Letizia Tanca, editors, Atti del Quinto Convegno Nazionale su Sistemi Evoluti per Basi di Dati (SEBD'97) Verona, Italy, June 1997, 67-86.
10. J. Considine, F. Li, G. Kollios and J.W. Byers, Approximate aggregation techniques for sensor databases. In ICDE-04: 20th IEEE Int'l Conference on Data Engineering, 2004.
11. G. Cormode and S. Muthukrishnan, What's hot and what's not: Tracking most frequent items dynamically. In Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, ACM Press, 2003, 296-306.
12. M. Dash and W. Ng, Efficient Reservoir Sampling for Transactional Data Streams. Sixth IEEE International Conference on Data Mining (ICDM) - Workshops, Hong Kong, 2006, 662-666.
13. A. Das, J. Gehrke and M. Riedewald, Approximate join processing over data streams. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, ACM Press, 2003, 40-51.
14. B.V. Dasarathy, editor, Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos, California, 1991.
15. M. Datar, A. Gionis, P. Indyk and R. Motwani, Maintaining stream statistics over sliding windows. In Proc. of the Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), 2002.
16. M. Datar and S. Muthukrishnan, Estimating rarity and similarity over data stream windows. In Algorithms - ESA 2002, Springer, 2002, 323-334.
17. P. Domingos, Rule induction and instance-based learning: A unified approach, in: Proceedings IJCAI-95, 14th International Joint Conference on Artificial Intelligence, C.S. Mellish, ed., Montreal, Morgan Kaufmann, 1995, pp. 1226-1232.
18. P. Domingos, Unifying instance-based and rule-based induction, Machine Learning 24 (1996), 141-168.
19. P. Domingos and G. Hulten, A general method for scaling up machine learning algorithms and its application to clustering. In Proceedings of the Eighteenth International Conference on Machine Learning, Williamstown, MA, 2001, 106-113.
20. P. Domingos and G. Hulten, A general framework for mining massive data streams. Journal of Computational and Graphical Statistics 12 (2003).
21. P. Domingos and G. Hulten, Mining high-speed data streams. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM Press, 2000, 71-80.
22. F. Ferrer-Troyano, J.S. Aguilar-Ruiz and J.C. Riquelme, Data streams classification by incremental rule learning with parameterized generalization. In Proceedings of the 2006 ACM Symposium on Applied computing, Dijon, France, 2006, 657-661.
23. F. Ferrer-Troyano, J.S. Aguilar-Ruiz and J.C. Riquelme, Incremental rule learning based on example nearness from numerical data streams. In Proceedings of the 2005 ACM Symposium on Applied computing, Santa Fe, New Mexico, USA, 2005, 568-572.
24. F. Ferrer-Troyano, J.S. Aguilar-Ruiz and J.C. Riquelme, Discovering decision rules from numerical data streams. In Proceedings of the 2004 ACM Symposium on Applied computing, Nicosia, Cyprus, 2004, 649-653.
25. M.M. Gaber, A. Zaslavsky and S. Krishnaswamy, Mining data streams: A review, ACM SIGMOD Record 34(1) (2005).
26. M.M. Gaber, S. Krishnaswamy and A. Zaslavsky, Cost-efficient mining techniques for data streams. In Proceedings of the 2nd Workshop on Australasian Information Security, Data Mining and Web Intelligence, and Software Internationalisation, Australian Computer Society, Inc., 2004, 109-114.
27. J. Gama, P. Medas, G. Castillo and P. Rodrigues, Learning with drift detection. In Proc. SBIA-04, 2004, 286-295.
28. J. Gama, P. Medas and P. Rodrigues, Learning decision trees from dynamic data streams. In SAC '05: Proceedings of the 2005 ACM symposium on Applied computing, New York, NY, USA, ACM Press, 2005, 573-577.
29. M. Garofalakis, J. Gehrke and R. Rastogi, Querying and mining data streams: You only get one look. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, ACM Press, 2002, 635-635.
30. C. Giannella, J. Han, J. Peia, X. Yan and P.S. Yu, Mining frequent patterns in data streams at multiple time granularities, in: Next Generation Data Mining, H. Kargupta, A. Joshi, K. Sivakumar and Y. Yesha, eds, AAAI/MIT, 2003.
31. L. Golab and M. Tamer, Issues in data stream management, SIGMOD Rec 32(2) (2003), 5-14.
32. S. Guha, N. Mishra, R. Motwani and L. O'Callaghan, Clustering data streams. In IEEE Symposium on Foundations of Computer Science, 2000, 359-366.
33. D.P. Helmhold and P.M. Long, Tracking drifting concepts by minimizing disagreements, Machine Learning 14 (1994), 27-45.
34. G. Hulten, L. Spencer and P. Domingos, Mining time-changing data streams. In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, ACM Press, 2001, 97-106.
35. E. Keogh and S. Kasetty, On the need for time series data mining benchmarks: A survey and empirical demonstration. In 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 2002, 102-111.
36. R. Klinkenberg and T. Joachims, Detecting concept drift with support vector machines. In Proc. ICML, 17th Int. Conf. on Machine Learning San Francisco, CA, 2000, 487-494.
37. R. Klinkenberg, Learning drifting concepts: Example selection vs. example weighting. Intelligent Data Analysis (IDA), Special Issue on Incremental Learning Systems Capable of Dealing with Concept Drift 8(3) (2004), 281-300.
38. J.L. Kolodner, Case-based Reasoning, Morgan Kaufmann, San Mateo, 1993.
39. J.Z. Kolter and M.A. Maloof, Dynamic weighted majority: A new ensemble method for tracking concept drift. Technical Report CSTR-20030610-3, Department of Computer Science, Georgetown University, Washington, DC, June 2003.
40. M. Kubat and G. Widmer, Adapting to drift in continuous domains, Lecture Notes in Computer Science 912 (1995), 307ff.
41. Y.N. Law and C. Zaniolo, An adaptive nearest neighbor classification algorithm for data streams. In Proc. PKDD-05, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, 2005.
42. M.A. Maloof and R.S. Michalski, Incremental learning with partial instance memory, Artificial Intelligence 154 (2004), 95-126.
43. E. McKenna and B. Smyth, Competence-guided editing methods for lazy learning. In ECAI, 2000, 60-64.
44. L. O'Callaghan, N. Mishra, A. Meyerson, S. Guha and R. Motwani, Streaming-data algorithms for high-quality clustering, 2002.
45. S. Papadimitriou, C. Faloutsos and A. Brockwell, Adaptive, hands-off stream mining. In 29th International Conference on Very Large Data Bases, 2003.
46. M. Salganicoff, Tolerating concept and sampling shift in lazy learning using prediction error context switching, Artif Intell Rev 11 (1-5) (1997), 133-155.
47. S. Salzberg, A nearest hyperrectangle learning method, Machine Learning 6 (1991), 251-276.
48. J.C. Schlimmer and Jr. R.H. Granger, Incremental learning from noisy data, Mach Learn 1(3) (1986), 317-354.
49. C. Stanfil and D. Waltz, Toward memory-based reasoning, Communications of the ACM 29 (1986), 1213-1228.
50. K.O. Stanley, Learning concept drift with a committee of decision trees. Technical Report AI-TR-03-302, Department of Computer Science, University of Texas at Austin, USA, 2003.
51. A. Tsymbal, The problem of concept drift: Definitions and related work. Technical Report TCD-CS-2004-15, Department of Computer Science, Trinity College Dublin, Ireland, 2004.
52. P.E. Utgoff, Incremental induction of decision trees, Machine Learning 4 (1989), 161-186.
53. H. Wang, W. Fan, P.S. Yu and J. Han, Mining concept-driffing data streams using ensemble classifiers. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM Press, 2003, 226-235.
54. G. Widmer and M. Kubat, Effective learning in dynamic environments by explicit context tracking. In Machine Learning: ECML-93, European Conference on Machine Learning, Proceedings, volume 667, Springer-Verlag, 1993, 227-243.
55. G. Widmer and M. Kubat, Learning in the presence of concept drift and hidden contexts, Mach Learn 23(1) (1996), 69-101.
56. I.H. Witten and E. Frank, Data Mining: Practical machine learning tools and techniques, Morgan Kaufmann, San Francisco, 2 edition, 2005.
57. Y. Zhu and D. Shasha, Statstream: Statistical monitoring of thousands of data streams in real time. In Proc. 28th VLDB Conference, Hong Kong, China, 2002, 358-369.