An incremental data-stream sketch using sparse random proj ections

Proceedings of the 7th SIAM International Conference on Data Mining

Volumn , Issue , 2007, Pages 563-568

  Menon, Aditya Krishna ^a   Pham, Gia Vinh Anh ^a   Chawla, Sanjay ^a   Viglas, Anastasios ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS;

HIGH-ACCURACY; HIGH-DIMENSIONAL DATA STREAMS; INCREMENTAL DATA; OFF-LINE ALGORITHM; ONLINE-CLUSTERING; RANDOM PROJECTIONS; RUNTIME COSTS; SPARSE MATRICES;

DATA MINING;

EID: 70449094532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972771.62     Document Type: Conference Paper

References (11)

1. Dimitris Achlioptas. Database-friendly random projections. In PODS '01: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 274-281, New York, NY, USA, 2001. ACM Press.
2. Ella Bingham and Heikki Mannila. Random projection in dimensionality reduction: applications to image and text data. In KDD '01: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 245-250, New York, NY, USA, 2001. ACM Press.
3. Xiaoli Fern and Carla Brodley. Random projection for high dimensional data clustering: A cluster ensemble approach. In The Twentieth International Conference on Machine Learning (ICML-2003), August 2003.
4. Dmitriy Pradkin and David Madigan. Experiments with random projections for machine learning. In KDD '03: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 517-522, New York, NY, USA, 2003. ACM Press.
5. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams. In FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, page 359, Washington, DC, USA, 2000. IEEE Computer Society.
6. Piotr Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM, 53(3):307-323, 2006.
7. W.B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in Modern Analysis and Probability, pages 189-206, Providence, RI, USA, 1984. American Mathematical Society.
8. Ping Li, Trevor J. Hastie, and Kenneth W. Church. Very sparse random projections. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 287-296, New York, NY, USA, 2006. ACM Press.
9. Jessica Lin and Dimitrios Gunopulos. Dimensionality reduction by random projection and latent semantic indexing. In Proceedings of the Text Mining Workshop, at the 3rd SI AM International Conference on Data Mining, 2003.
10. Aditya Krishna Menon, Anh Pham, Sanjay Chawla, and Anastasios Viglas. An incremental data-stream sketch using sparse random projections. Technical Report 609, The University Of Sydney, January 2007. Available at http://www.it.usyd. edu.au/research/ tr/tr609.pdf.
11. Santosh S. Vempala. The Random Projection Method, volume 65 of DIM ACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, USA, 2004.