Efficient computation of k-medians over data streams under memory constraints

Journal of Computer Science and Technology

Volumn 21, Issue 2, 2006, Pages 284-296

  Chong, Zhi Hong ^a,d,e   Yu, Jeffrey Xu ^b   Zhang, Zhen Jie ^c   Lin, Xue Min ^d   Wang, Wei ^d   Zhou, Ao Ying ^a  

^a FUDAN UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^d UNIVERSITY OF NEW SOUTH WALES   (Australia)

^e SOUTHEAST UNIVERSITY   (China)

Author keywords

Cluster; Data mining; Data streams; k medians

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA MINING; DATA STORAGE EQUIPMENT; PROGRAM PROCESSORS;

CLUSTERS; DATA STREAMS; K-MEDIANS;

COMPUTATION THEORY;

EID: 33645936670     PISSN: 10009000     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11390-006-0284-5     Document Type: Article

References (27)

1. Guha S, Mishra N, Motwani R, O'Callaghan L. Clustering data streams. In FOCS'OO: Proc. the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, USA, 2000, p.359.
2. Moses Charikar, Liadan O'Callaghan, Rina Panigrahy. Better streaming algorithms for clustering problems. In STOC'03: Proc. the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, 2003, pp.30-39.
3. Sariel Har-Peled, Soham Mazumdar. On coresets for k-means and k-median clustering. In STOC'04: Proc. the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 2004, pp.291-300.
4. Piotr Indyk. Algorithms for dynamic geometric problems over data streams. In STOC'04: Proc. the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 2004, pp.373-380.
5. Charu C Aggarwal, Jiawei Han, Jianyong Wang, Philip S Yu. A framework for clustering evolving data streams. In VLDB'03: Proc. 39th International Conference on Very Large Data Bases, Berlin, Germany, 2003, pp.81-92.
6. Tian Zhang, Raghu Ramakrishnan, Miron Livny. BIRCH: An efficient data clustering method for very large databases. In SIGMOD'96: Proc. the 1996 ACM SIGMOD Int. Conf.Management of Data, Montreal, Quebec, Canada, 1996, pp.103-114.
7. Moses Charikar, Sudipto Guha. Improved combinatorial algorithms for the facility location and k-median problems. In FOCS'99: Proc. the 40th Annual Symposium on Foundations of Computer Science, New York, NY, USA, 1999, p.378.
8. Martin Ester, Hans-Peter Kriegel, Jörg Sander, Xiaowei Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD'96: Proc. the Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, USA, 1996, pp.226-231.
9. Mihael Ankerst, Markus M Breunig, Hans-Peter Kriegel, Jörg Sander. OPTICS: Ordering points to identify the clustering structure. In SIGMOD'99: Proc. the 1999 ACM SIGMOD Int. Conf. Management of Data, Philadelphia, Pennsylvania, USA, 1999, pp.49-60.
10. Markus M Breunig, Hans-Peter Kriegel, Peer Kröger, Jörg Sander. Data bubbles: Quality preserving performance boosting for hierarchical clustering. SIGMOD Rec., 2001, 30(2): 79-90.
11. Samer Nassar, Jörg Sander, Corrine Cheng. Incremental and effective data summarization for dynamic hierarchical clustering. In SIGMOD'04: Proc. the 2004 ACM SIGMOD Int. Conf. Management of Data, 2004, Paris, France, pp.467-478.
12. Carlos Ordonez, Edward Omiecinski, Norberto Ezquerra. A fast algorithm to cluster high dimensional basket data. In ICDM'01: Proc. the 2001 IEEE Int. Conf. Data Mining, San Jose, California, USA, 2001, pp.633-636.
13. Gurmeet Singh Manku, Rajeev Motwani. Approximate frequency counts over data streams. In VLDB'02: Proc. 28th Int. Conf. Very Large Data Bases, Hong Kong, China, 2002, pp.346-357.
14. Jeffrey Xu Yu, Zhihong Chong, Hongjun Lu, Aoying Zhou. False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In VLDB'04: Proc. the 30th Int. Conf. Very Large Data Bases, Toronto, Canada, 2004, pp.204-215.
15. Liadan O'Callaghan, Adam Meyerson, Rajeev Motwani et al. Streaming-data algorithms for high-quality clustering. In ICDE'02: Proc. the 18th Int. Conf. Data Engineering, San Jose, California, USA, 2002, p.685.
16. MacQueen J. Some methods for classification and analysis of multivariate observations. In Proc. 5th Berkeley Symposium on Math, Stat. and Prob, University of California Press, 1967, pp.281-297.
17. Meyerson A. Online facility location. In FOCS'01: Proc. the 42nd IEEE Symposium on Foundations of Computer Science, Las Vegas, Nevada, USA, 2001, p.426.
18. Haixun Wang, Wei Fan, Philip S Yu, Jiawei Han. Mining concept-drifting data streams using ensemble classifiers. In KDD'OS: Proc. the Ninth ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Washington DC, 2003, pp. 226-235.
19. Pankaj K Agarwal, Sariel Har-Peled, Kasturi R Varadarajan. Geometric Approximation via Coresets. http://valis.cs. uiuc.edu/~sariel/papers/04/survey/
20. Nam Hun Park, Won Suk Lee. Statistical grid-based clustering over data streams. SIGMOD Record, 2004, 33(1): 32-37.
21. Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan O'Callaghan. Maintaining variance and k-medians over data stream windows. In PODS'03: Proc. the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003, San Diego, CA, USA, pp.234-243.
22. Piotr Indyk. A sublinear time approximation scheme for clustering in metric spaces. In FOCS'99: Proc. the 40th Annual Symposium on Foundations of Computer Science, New York, NY, USA, 1999, p.154.
23. Mettu R R, Plaxton C G. The online median problem. In FOCS'OO: Proc. the 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, USA, 2000, p.339.
24. Alexander Hinneburg, Daniel A Keim. Optimal gridclustering: Towards breaking the curse of dimensionality inhigh-dimensional clustering. In VLDB'99: Proc. 25th Int. Conf. Very Large Data Bases, Edinburgh, Scotland, UK, 1999, pp.506-517,
25. Jain A K, Murty M N, Flynn P J. Data clustering: A review. ACM Comput. Surv., 1999, 31(3): 264-323.
26. Pavel Berkhin. Survey of clustering data mining techniques. Technical Report, Accrue Software, San Jose, CA, 2002. http://citeseer.nj.nec.com/ berkhin02survey.html
27. Mohanmed Medhat Gaber, Arkady Zaslavsky, Shonali Krishnaswamy. Mining data streams: A review. SIGMOD Record, 2005, 34(2): 18-26.