References

  1. G. Cormode and S. Muthukrishnan (2010). An improved data stream summary: The Count-Min sketch and its applications. Journal of Algorithms, 55(1):58–75, 2005.
  2. João Gama (2010). Knowledge Discovery from Data Streams, Chapman and Hall / CRC Data Mining and Knowledge Discovery Series, CRC Press 2010, ISBN 978-1-4398-2611-9, pp. I-XIX, 1-237.
  3. B. Babcock, M. Datar, R. Motwani (2002). Sampling from a moving window over streaming data, in Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp.633–634, 2002.
  4. Bifet, A. and Gavalda, R. (2007). Learning from time-changing data with adaptive windowing. In Proceedings of SIAM int. conf. on Data Mining. SDM. 443–448.
  5. Vitter, J. (1985). Random sampling with a reservoir. ACM Trans. Math. Softw. 11, 1, 37–57.
  6. Gama, J., Medas, P., Castillo, G., and Rodrigues, P. (2004). Learning with drift detection. In Proceedings of the 17th Brazilian symp. on Artif. Intell. SBIA. 286–295.
  7. Gama, J., Sebastiao, R., and Rodrigues, P. 2013. On evaluating stream learning algorithms. Machine Learning 90, 3, 317–346.
  8. Domingos, P. and Hulten, G. (2000). Mining high-speed data streams. In Proceedings. of the 6th ACM SIGKDD int. conference on Knowledge discovery and data mining. KDD. 71–80.
  9. Oza, N. (2001). Online ensemble learning. Ph.D. thesis, University of California Berkeley.
  10. Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., Bouchachia, A. (2014). A Survey on Concept Drift Adaptation.ACM Computing Surveys 46(4), Article No. 44.
  11. Farnstrom, F., Lewis, J., and Elkan, C. (2000). Scalability for clustering algorithms revisited. SIGKDD Exploration, 51–57.
  12. Zhang, T., Ramakrishnan, R., and Livny, M. (1996). BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM Press, 103–114.
  13. Aggarwal, C. (2003). A Framework for Diagnosing Changes in Evolving Data Streams. In ACM SIGMOD Conference. 575–586.
  14. Chen, Y. and Tu, L. (2007). Density-based clustering for real-time stream data. In KDD '07: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. ACM Press, 133–142.
  15. Kremer, H., Kranen, P., Jansen, T., Seidl, T., Bifet, A., Holmes, G., and Pfahringer, B. (2011). An effective evaluation measure for clustering on evolving data streams. In proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. KDD '11. ACM, New York, NY, USA, 868–876.
  16. Mahdiraji, A. R. (2009). Clustering data stream: A survey of algorithms. International Journal of Knowledge-Based and Intelligent Engineering Systems, 39–44.
  17. F. Angiulli and F. Fassetti (2007). Detecting distance-based outliers in streams of data. In proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, CIKM '07, pages 811–820, New York, NY, USA, 2007. ACM.
  18. D. Yang, E. A. Rundensteiner, and M. O. Ward (2009). Neighbor-based pattern detection for windows over streaming data. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT '09, pages 529–540, New York, NY, USA, 2009. ACM.
  19. M. Kontaki, A. Gounaris, A. Papadopoulos, K. Tsichlas, and Y. Manolopoulos (2011). Continuous monitoring of distance-based outliers over data streams. In Data Engineering (ICDE), 2011 IEEE 27th International Conference on, pages 135–146, April 2011.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.137.210.143