Random projection in dimensionality reduction: Applications to image and text data

Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2001, Pages 245-250

  Bingham, Ella ^a   Mannila, Heikki ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Dimensionality reduction; High dimensional data; Image data; Random projection; Text document data

Indexed keywords

COMPUTATIONAL METHODS; IMAGE ANALYSIS; INFORMATION RETRIEVAL; MATRIX ALGEBRA; VECTORS;

RANDOM PROJECTIONS;

DATA REDUCTION;

EID: 0035789317     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. D. Achlioptas. Database-friendly random projections. In Proc. ACM Symp. on the Principles of Database Systems, pages 274-281, 2001.
2. C. C. Aggarwal, J. L. Wolf, and P. S. Yu. A new method for similarity indexing of market basket data. In Proc. 1999 ACM SIGMOD Int. Conf. on Management of data, pages 407-418, 1999.
3. R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In Proc. 4th Int. Conf. of Data Organization and Algorithms, pages 69-84. Springer, 1993.
4. R. I. Arriaga and S. Vempala. An algorithmic theory of learning: robust concepts and random projection. In Proc. 40th Annual Symp. on Foundations of Computer Science, pages 616-623. IEEE Computer Society Press, 1999.
5. M.-W. Berry. Large-scale sparse singular value computations. International Journal of Super-Computer Applications, 6(1):13-49, 1992.
6. S. Dasgupta. Learning mixtures of Gaussians. In 40th Annual IEEE Symp. on Foundations of Computer Science, pages 634-644, 1999.
7. S. Dasgupta. Experiments with random projection. In Proc. Uncertainty in Artificial Intelligence, 2000.
8. S. Dasgupta and A. Gupta. An elementary proof of the Johnson-Lindenstrauss lemma. Technical Report TR-99-006, International Computer Science Institute, Berkeley, California, USA, 1999.
9. S. Deerwester, S.T. Dumais, G.W. Furnas, and T.K. Landauer. Indexing by latent semantic analysis. Journal of the Am. Soc. for Information Science, 41(6):391-407, 1990.
10. P. Frankl and H. Maehara. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. Journal of Combinatorial Theory, Ser. B, 44:355-362, 1988.
11. G.H. Golub and C.F. van Loan. Matrix Computations. North Oxford Academic, Oxford, UK, 1983.
12. A. Craps. An introduction to wavelets. IEEE Computational Science and Engineering, 2(2):50-61, 1995.
13. R. Hecht-Nielsen. Context vectors: general purpose approximate meaning representations self-organized from raw data. In J.M. Zurada, R.J. Marks II, and C.J. Robinson, editors, Computational Intelligence: Imitating Life, pages 43-56. IEEE Press, 1994.
14. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. 30th Symp. on Theory of Computing, pages 604-613. ACM, 1998.
15. W.B. Johnson and J. Lindenstrauss. Extensions of Lipshitz mapping into Hilbert space. In Conference in modern analysis and probability, volume 26 of Contemporary Mathematics, pages 189-206. Amer. Math. Soc., 1984.
16. S. Kaski. Data exploration using self-organizing maps. In Acta Polytechnica Scandinavica, Mathematics, Computing and Management in Engineering Series, number 82. 1997. Dr.Tech. thesis, Helsinki University of Technology, Finland.
17. S. Kaski. Dimensionality reduction by random mapping. In Proc. Int. Joint Conf. on Neural Networks, volume 1, pages 413-418, 1998.
18. E. J. Keogh and M. J. Pazzani. A simple dimensionality reduction technique for fast similarity search in large time series databases. In 4th Pacific-Asia Conf. on Knowledge Discovery and Data Mining, 2000.
19. J.M. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In Proc. 29th A GM Symp. on Theory of Computing, pages 599-608, 1997.
20. M. Kurimo. Indexing audio documents by using latent semantic analysis and SOM. In E. Oja and S. Kaski, editors, Kohonen Maps, pages 363-374. Elsevier, 1999.
21. R. Ostrovsky and Y. Rabani. Polynomial time approximation schemens for geometric k-clustering. In Proc. 41st Symp. on Foundations of Computer Science, pages 349-358. IEEE, 2000.
22. C.H. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala. Latent semantic indexing: A probabilistic analysis. In Proc. 17th ACM Symp. on the Principles of Database Systems, pages 159-168, 1998.
23. K.R. Rao and P. Yip. Discrete Cosine Transform: Algorithms, Advantages, Applications. Academic Press, 1990.
24. S. Roweis. EM algorithms for PCA and SPCA. In Neural Information Processing Systems 10, pages 626-632, 1997.
25. G. Salton and M.J. McGill. Introduction to modern information retrieval. McGraw-Hill, 1983.
26. L. Sirovich and R. Everson. Management and analysis of large scientific datasets. Int. Journal of Supercomputer Applications, 6(1):50-68, spring 1992.
27. M. Sonka, V. Hlavac, and R. Boyle. Image processing, analysis, and machine vision. PWS Publishing, 1998.
28. S. Vempala. Random projection: a new approach to VLSI layout. In Proc. 39th Annual Symp. on Foundations of Computer Science. IEEE Computer Society Press, 1998.