Communications of the Korean Institute of Information Scientists and Engineers (정보과학회지)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Stream Data Mining

스트림 데이터 마이닝

  • Published : 2003.10.01
Download PDF
⟨ Previous Next ⟩

Abstract

Keywords

References

  1. JCSS v.58 no.1 The Space Complexity of Approximating the Frequency Monent Noga Alon;Yossi Matias;Mario Szegedy
  2. SIGMOD Record v.30 no.3 Continuous Queries over Data Streams Shivnath Babu;Jennifer Widom
  3. PODS 2002 Models and Issues in Data Stream Systems Brian Babcock;Shivnath Babu;Mayur Datar;Rajeev Motwani;Jennifer Widom
  4. STOC 2003 Better streaming algorithms for clustering problems Moses Charikar;Liadan O`Callaghan;Rina Panigrahy
  5. KDD 2000 Mining high-speed data streams Pedro Domingos;Geoff Hulten
  6. FOCS 1999 An Approximate L1-Difference Algorithm for Massive Joan Feigenbaum;Sampath Kannan;Martin Strauss;Mahesh Viswanathan
  7. JCSS v.31 no.2 Probabilistic Counting Algorithms for Data Base Applications Philippe Flajolet;G. Nigel Martin
  8. STOC 2002 Fast, small-space algorithms for approximate histogram maintenance Anna C. Gilbert;Sudipto Guha;Piotr Indyk;Yannis Kotidis;S. Muthukrishnan;Martin Strauss
  9. TKDE v.13 no.1 DEMON: Mining and Monitoring Evolving Data Venkatesh Ganti;Johannes Gehrke;Raghu Ramakrishnan
  10. SODA 1999 Synopsis Data Structures for Massive Data Sets Phillip B. Gibbons;Yossi Matias
  11. SIGMOD Conference 2001 Space-Efficient Online Computation of Quantile Summaries Michael Greenwald;Sanjeev Khanna
  12. ICDE 2002 Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation Sudipto Guha;Nick Koudas
  13. STOC 2001 Data-streams and histograms Sudipto Guha;Nick Koudas;Kyuseok Shim
  14. FOCS 2000 Clustering Data Streams Sudipto Guha;Nina Mishra;Rajeev Motwani;Liadan O`Callaghan
  15. SIGMOD Conference 1998 CURE: An Efficient Clustering Algorithm for Large Databases Sudipto Guha;Rajeev Rastogi;Kyuseok Shim
  16. JCSS v.52 no.3 Selectivity and Cost Estimation for Joins Based on Random Sampling Peter J. Haas;Jeffrey F. Naughton;S. Seshadri;Arun N. Swami
  17. FOCS 2000 Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation Piotr Indyk
  18. VLDB 2002 Approximate Frequency Count over Data Streams Gurmeet Singh Manku;Rajeev Motwani
  19. SIGMOD Conference 1998 Approximate Medians and other Quantiles in One Pass and with Limited Memory Gurmeet Singh Manku;Sridhar Rajagopalan;Bruce G. Lindsay
  20. TCS v.12 Selection andSorting with Limited Storage J. Ian Munro;Mike Paterson
  21. ICDE 2002 Streaming-Data Algorithms for High-Quality Clustering Liadan O`Callaghan;Adam Meyerson;Rajeev Motwani;Nina Mishra;Sudipto Guha
  22. TOMS v.11 no.1 Random Sampling with a Resercoir Jeffrey Scott Vitter
  23. SIGMOD Conference 1996 BIRCH: An Efficient Data Clustering Method for Very Large Databases Tian Zhang;Raghu Ramakrishnan;Miron Livny
  24. VLDB 2002 StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time Yunyue Zhu;Dennis Shasha