Summarizing spatial data streams using ClusterHulls

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 26-40

  Hershberger, John ^a,b   Shrivastava, Nisheeth ^b   Suri, Subhash ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b Santa Barbara   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INFORMATION DISSEMINATION; ONLINE SYSTEMS; PROBLEM SOLVING; SENSORS;

CLUSTERHULLS; FIXED MEMORY BUDGET; SPATIAL DATA STREAMS; TWO DIMENSIONAL POINTS;

DATABASE SYSTEMS;

EID: 33646829984     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972863.3     Document Type: Conference Paper

References (30)

1. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measures of points. J. ACM, 51(4):606-635, 2004.
2. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for clustering evolving data streams. In Proc. of the 29th VLDB conference, 2003.
3. N. Alon, Y. Matias, M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58 (1999), 137-147.
4. N. Amenta, M. Bern, and D. Eppstein. The crust and the β-skeleton: Combinatorial curve reconstruction. Graphical Models and Image Processing, 60:125-135, 1998.
5. P. S. Bradley, U. Fayyad, and C. Reina. Scaling Clustering Algorithms to Large Databases. Proc. 4th International Conf. on Knowledge Discovery and Data Mining (KDD-98), 1998.
6. T. Chan. Faster core-set constructions and data stream algorithms in fixed dimensions. In Proc. 20th Annu. ACM Sympos. Comput. Geom., pages 152-159, 2004.
7. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In Proc. 29th Annu. ACM Symp. Theory Computing, pages 626-635, 1997.
8. D. Cheng, R. Kannan, S. Vempala, G. Wang A Divide-and-Merge Methodology for Clustering. In Proc. of the ACM Symposium on Principles of Database Systems, 2005.
9. G. Cormode and S. Muthukrishnan. Radial histogram for spatial streams. Technical Report 2003-11, DI-MACS, 2003.
10. B. Curless and M. Levoy. A volumetric method for building complex models from range images. In Proc. SIGGRAPH 96, pages 303-312, 1996.
11. T. K. Dey, K. Mehlhorn, and E. Ramos. Curve reconstruction: Connecting dots with good reason. Comp. Geom.: Theory and Appl., 15:229-244, 2000.
12. P. Domingos and G. Hulten. A general method for scaling up machine learning algorithms and its application to clustering. In Proc. of the 18th International Conference on Machine Learning, ICML, 2001
13. P. Domingos, G. Hulten. Learning from Infinite Data in Finite Time. In Proc. Advances in Neural Information Processing Systems (NIPS), 2002
14. P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. In Proc. of 10th Symposium on Discrete Algorithms (SODA), 1999.
15. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.
16. M. Ester, H. Kriegel and X. Xu. A database interface for clustering in large spatial databases. In Int. Conference on Knowledge Discovery in Databases and Data Mining (KDD-95), Montreal, Cananda, August 1995.
17. J. Feigenbaum, S. Kannan, and J. Zhang. Computing diameter in the streaming and sliding-window models, 2002. Manuscript.
18. A. Frieze, R. Kannan and S. Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations. In Proc. of 39th Symposium on Foundations of Computer Science (FOCS), 1998.
19. S. Guha, A. Meyerson, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams: Theory and practice. IEEE Trans. Knowl. Data Engineering, Vol. 15, pages 515-528, 2003.
20. S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large databases. In Proc. of International Conference on Management of Data (SIGMOD), 1998.
21. M. Greenwald and S. Khanna. Space-efficient online computation of quantile summaries. Proc. of SIGMOD, pages 58-66, 2001.
22. J. Hershberger and S. Suri. Adaptive sampling for geometric problems over data streams. In Proc. 23rd ACM Sympos. Principles Database Syst., pages 252-262, 2004.
23. G. S. Manku and R. Motwani. Approximate frequency counts over data streams. In VLDB, pages 346-357, 2002.
24. S. Muthukrishnan. Data streams: Algorithms and applications. Preprint, 2003.
25. R. T. Ng and J. Han. Efficient and Effective Clustering Methods for Spatial Data Mining. In Proceedings of the 20th VLDB Conference, 1994.
26. J. O'Rourke and G. T. Toussaint. Pattern recognition. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 43, pages 797-813. CRC Press LLC, Boca Raton, FL, 1997.
27. D. Pelleg, and A. W. Moore. X-means: Extending K-means with Efficient Estimation of the Number of Clusters. In Proc. of the 17th International Conference on Machine Learning (ICML), 2000.
28. S. Vempala R. Kannan and A. Vetta On clusterings - good, bad and spectral. In Proc. 41st Symposium on the Foundation of Computer Science, FOCS, 2000.
29. USGS West Nile Virus Maps - 2002. http://cindi.usgs.gov/hazard/event/ west_nile/.
30. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proc. of the International Conference on Management of Data (SIGMOD), 1996.