Skip to main content
SpringerLink
Log in

An Overview on Learning from Data Streams

  • Preface
  • Published:
New Generation Computing Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Aggarwal, C., Han, J., Wang, J., Yu P., “A Framework for Clustering Evolving Data Streams,” in VLDB 2003, Proc. of Twenty-Ninth International Conference on Very Large Data Bases, pp. 81–92, Morgan Kaufmann, 2003.

  2. Alon, N., Matias, Y. and Szegedy, M., “The Space Complexity of Approximating the Fequency Moments,” in Proc. 28th ACM Symposium on Theory of Computing, pp. 20–29, 1996.

  3. Babcock, B., Babu, S., Datar, M., Motwani, R. and Widom, J., “Models and Issues in Data Stream Systems,” in Proc. of the 21nd Symposium on Principles of Database Systems (Kolaitis, P. ed.), pp. 1–16, ACM Press, 2002.

  4. Ferrer, F., Aguilar, J. and Riquelme. J., “Incremental Rule Learning and Border Examples Selection from Numerical Data Streams,” Journ. of Universal Computer Science, 11, 8, pp. 1426–1439, 2005.

    Google Scholar 

  5. Flajolet, P. and Martin, G., “Probabilistic Counting Algorithms for Data Base Applications,” Journ. of Computer and System Sciences, 31, 2, pp. 182–209, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  6. Gama, J. Fernandes, R. Rocha, R. “Decision Ttrees for Mining Data Streams,” Intelligent Data Analysis, 10, 1, pp. 23–46, 2006.

    Google Scholar 

  7. Gama, J., Medas, P. and Rodrigues, P., “Learning Decision Trees from Dynamic Data Streams,” in Proc. of the 2005 ACM Symposium on Applied Computing (Haddad, H., Liebrock, L., Omicini, A. and Wainwright, R. eds.), pp. 573–577, ACM Press, March, 2005.

  8. Gibbons, P.B. and Matias, Y., “Synopsis Data Structures for Massive Data Sets,” in ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999.

  9. Gilbert, A.C., Kotidis, Y., Muthukrishnan, S. and Strauss, M., “Surfing Wavelets on Streams: One-pass Summaries for Approximate Aggregate Queries,” in VLDB, pp. 79–88, 2001.

  10. Guha, S., Rastogi, R. and Shim, K., “CURE: An Efficient Clustering Algorithm for Large Databases,” in Proc. of the 1998 ACM SIGMOD International Conference on Management of Data (Laura M. Haas, L.M. and Tiwary, A. eds.), pp. 73–84, ACM Press, 1998.

  11. Guha, S., Shim, K. and Woo. J., “Rehist: Relative Error Histogram Construction Algorithms,” in VLDB 04, Proc. of the 30th International Conference on Very Large Data Bases, pp. 288–299, Morgan Kaufmann Publishers Inc., 2004.

  12. Han, J. and Kamber, M., Data Mining Concepts and Techniques, Morgan Kaufmann, 2006.

  13. Hulten G. and Domingos, P., “Catching Up with the Data: Research Issues in Mining Data Streams,” in Proc. of Workshop on Research issues in Data Mining and Knowledge Discovery, 2001.

  14. Hulten, G., Spencer, L. and Domingos, P., “Mining Time-changing Data Streams,” in Proc. of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 97–106, ACM Press, 2001.

  15. Kifer, D., Ben-David, S. and Gehrke, J., “Detecting Change in Data Streams,” in VLDB 04, Proc. of the 30th International Conference on Very Large Data Bases, pp. 180–191, Morgan Kaufmann Publishers Inc., 2004.

  16. Domingos, P. and Hulten, G., “Mining High-speed Data Streams,” in Proc. of the ACM Sixth International Conference on Knowledge Discovery and Data Mining, pp. 71–80, ACM Press, 2000.

  17. Rodrigues, P., Gama, J. and Pedroso, J., Odac, “Hierarchical Clustering of Time Series Data Streams,” in Proc. of the Sixth SIAM International Conference on Data Mining (Ghosh, J., Lambert, D., Skillicorn, D. and Srivastava, J. eds.), pp. 499–503, Society for Industrial and Applied Mathematics, 2006.

  18. Muthukrishnan, S., Data Sstreams: Algorithms and Applications, Now Publishers, 2005.

  19. Sheikholeslami, G., Chatterjee, S. and Zhang, A., “WaveCluster: A Multi-resolution Clustering Approach for Very Llarge Spatial Databases,” in Proc. of the Twenty-fourth International Conference on Very Large Data Bases, pp. 428–439, ACM Press, 1998.

  20. Zhang, T., Ramakrishnan, R. and Livny, M., “BIRCH: an Efficient Data Clustering Method for Very Large Databases,” in Proc. of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 103–114, ACM Press, 1996.

Download references

Author information

Authors and Affiliations

  1. LIACC, University of Porto, 4050, Porto, Portugal

    João Gama & Pedro Rodrigues

  2. University Pablo Olavide, Seville, Spain

    Jesús Aguilar-Ruiz

Authors
  1. João Gama
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro Rodrigues
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jesús Aguilar-Ruiz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to João Gama.

About this article

Cite this article

Gama, J., Rodrigues, P. & Aguilar-Ruiz, J. An Overview on Learning from Data Streams. New Gener. Comput. 25, 1–4 (2006). https://doi.org/10.1007/s00354-006-0001-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00354-006-0001-5

Keywords

Search

Navigation