Efficient Computation of k-Medians over Data Streams Under Memory Constraints
暂无分享,去创建一个
[1] Hans-Peter Kriegel,et al. Data bubbles: quality preserving performance boosting for hierarchical clustering , 2001, SIGMOD '01.
[2] Norberto F. Ezquerra,et al. A fast algorithm to cluster high dimensional basket data , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[3] Hans-Peter Kriegel,et al. OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.
[4] Daniel A. Keim,et al. Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering , 1999, VLDB.
[5] Philip S. Yu,et al. Mining Data Streams , 2005, The Data Mining and Knowledge Discovery Handbook.
[6] Corrine Cheng,et al. Incremental and effective data summarization for dynamic hierarchical clustering , 2004, SIGMOD '04.
[7] Sudipto Guha,et al. Streaming-data algorithms for high-quality clustering , 2002, Proceedings 18th International Conference on Data Engineering.
[8] Shonali Krishnaswamy,et al. Mining data streams: a review , 2005, SGMD.
[9] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[10] Rajeev Motwani,et al. Approximate Frequency Counts over Data Streams , 2012, VLDB.
[11] Philip S. Yu,et al. A Framework for Clustering Evolving Data Streams , 2003, VLDB.
[12] Piotr Indyk. A sublinear time approximation scheme for clustering in metric spaces , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[13] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[14] Adam Meyerson,et al. Online facility location , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[15] Hongjun Lu,et al. False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams , 2004, VLDB.
[16] Sudipto Guha,et al. Improved combinatorial algorithms for the facility location and k-median problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[17] Rina Panigrahy,et al. Better streaming algorithms for clustering problems , 2003, STOC '03.
[18] Piotr Indyk,et al. Algorithms for dynamic geometric problems over data streams , 2004, STOC '04.
[19] Won Suk Lee,et al. Statistical grid-based clustering over data streams , 2004, SGMD.
[20] C. Greg Plaxton,et al. The online median problem , 1999, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[21] Rajeev Motwani,et al. Maintaining variance and k-medians over data stream windows , 2003, PODS.
[22] Sariel Har-Peled,et al. On coresets for k-means and k-median clustering , 2004, STOC '04.
[23] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[24] Sudipto Guha,et al. Clustering data streams , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[25] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[26] Philip S. Yu,et al. Mining concept-drifting data streams using ensemble classifiers , 2003, KDD '03.