Detecting Change in Data Streams

Proceedings 2004 VLDB Conference: The 30th International Conference on Very Large Databases (VLDB)

Volumn , Issue , 2004, Pages 180-191

  Kifer, Daniel ^a   Ben David, Shai ^a   Gehrke, Johannes ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85123650840     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012088469-8.50019-X     Document Type: Chapter

References (24)

1. C. Aggarwal, J. Han, J. Wang and P.S. Yu (2003) A framework for clustering evolving data streams. VLDB
2. M. Anthony and J. Shawe-Taylor (1993) A result of vapnik with applications. Discrete Applied Mathematics 47(2), 207-217.
3. B. Babcock, S. Babu, M. Datar, R. Motwani and J. Widom (2002) Models and issues in data stream systems. PODS
4. T. Batu, L. Fortnow, R. Rubinfeld, W. D. Smith, and P. White. Testing that distributions are close. In FOCS 2000.
5. P.J. Bickel and K. Doksum (1977) Mathematical Statistics: Basic Ideas and Selected Topics Holden-Day, Inc.
6. E. Carlstein, H.-G. Müller and D. Siegmund (Eds) (1994) Change-point problems Hayward, California: Institute of Mathematical Statistics
7. S. Chakrabarti, S. Sarawagi and B. Dom (1998) Mining surprising patterns using temporal description length. VLDB
8. S.S. Chawathe, S. Abiteboul and J. Widom (1998) Representing and querying changes in semistructured data. ICDE
9. S.S. Chawathe and H. Garcia-Molina (1997) Meaningful change detection in structured data. SIGMOD
10. W. Feller (1970) 3rd edition An Introduction to Probability Theory and its Applications volume 1 John Wiley & Sons, inc.
11. V. Ganti, J. Gehrke and R. Ramakrishnan (2001) Demon: Mining and monitoring evolving data. IEEE Transactions on Knowledge and Data Engineering (TKDE) 13(1), 50-63.
12. V. Ganti, J. Gehrke and R. Ramakrishnan (2002) Mining data streams under block evolution. SIGKDD Explorations 3(2), 1-10.
13. V. Ganti, J. Gehrke, R. Ramakrishnan and W.-Y. Loh (2002) A framework for measuring differences in data characteristics. Journal of Computer and System Sciences (JCSS) 64(3), 542-578.
14. J. Glaz and N. Balakrishnan (Eds) (1999) Scan statistics and applications Birkhäuser Boston
15. J. Glaz, J. Naus and S. Wallenstein (2001) Scan statistics New York: Springer
16. T. Hagerup and C. Rub (1990) A guided tour of chernoff bounds. Information Processing Letters 33 305-308.
17. G. Hulten, L. Spencer, and P. Domingos. Mining timechanging data streams. In KDD 2001.
18. J. M. Kleinberg. Bursty and hierarchical structure in streams. In KDD 2002.
19. J. Lin (1991) Divergence measures based on the shannon entropy. IEEE Transactions on Information Theory 37(1), 145-151.
20. D. Neill and A. Moore (June 2003) A fast multi-resolution method for detection of significant spatial overdenisities. Carnegie Mellon CSD Technical Report
21. W.H. Press, B.P. Flannery, S.A. Teukolsky and W.T. Vetterling (1992) Numerical Recipes in C Cambridge University Press
22. V.N. Vapnik (1998) Statistical Learning Theory John Wiley & Sons
23. G. Widmer and M. Kubat (1996) Learning in the presence of concept drift and hidden contexts. Machine Learning 23(1), 69-101.
24. F. Wilcoxon (1945) Individual comparisons by ranking methods. Biometrics Bulletin 1 80-83.