Ryohei Yokobayashi
ABSTRACT
In this investigation, we discuss high order data structure (called tensor) for efficient information retrieval and show especially how well reduction techniques of dimensionality goes while preserving Euclid distance between information. High order data structure requires much amount of space. One of the effective approaches comes from dimensionality reduction such as Latent Semantic Indexing (LSI) and Random Projection (RP) which allows us to reduce complexity of time and space dramatically. The reduction techniques can be applied to high order data structure. Here we examine High Order Random Projection (HORP) which provides us with efficient information retrieval keeping feasible dimensionality reduction.
- Achlioptas, D. "Database-friendly Random Projections: Johnson-Lindenstrauss with Binary Coins". Journal of Comp. and Sys. Sci.,, 66 (4), 2003. p.671--687 Google Scholar
Digital Library
- Bingham, E. and Mannila, H. "Random projection in dimensionality reduction: applications to image and text data." 7thg ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2001. Google ScholarDigital Library
- Dasgupta, S. and Gupta A. "An elementary proof of a theorem of Johnson and Lindenstrauss." Random Structures and Algorithms 22.1 (2003): 60--65. Google ScholarDigital Library
- De Lathauwer, Lieven, Bart De Moor, and Vandewalle, J. "A multilinear singular value decomposition." SIAM journal on Matrix Analysis and Applications 21.4 (2000), pp.1253--1278. Google ScholarDigital Library
- Deerwester, S., Dumais, S.T., Furnas, G.W., Landauer, T.K. and Richard Harshman, R. "Indexing by latent semantic analysis." Journal of Americal Socienty of Information Science 41.6(1990), pp.391--407.Google ScholarCross Ref
- Golub G. and Reinsch C. "Handbook for matrix computation" II, Linear Algebra. Springer-Verlag, New York, 1971.Google Scholar
- Kaski, Samuel. "Dimensionality reduction by random mapping: Fast similarity computation for clustering." IEEE World Congress on Computational Intelligence. The 1998 IEEE International Joint Conference on. Vol. 1. IEEE, 1998.Google Scholar
- Kolda, Tamara G., and Brett W. Bader. "Tensor decompositions and applications." SIAM review 51.3 (2009): 455--500. Google ScholarDigital Library
- Oh'uchi, H., Miura, T. and Shioya, I. "Retrieval for Text Streams by Random Projection." ISTA 2004, pp.151--164Google Scholar
- Oh'uchi, H., Miura, T. and Shioya, I. "Document Retrieval Using Projection by Frequency Distribution." ICTAI 2005, pp.356--361 Google ScholarDigital Library
- Papadimitriou, Christos H., et al. "Latent semantic indexing: A probabilistic analysis." 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. ACM, 1998. Google ScholarDigital Library
- Sanguansat, P., "Higher Order Random Projection for Tensor Object Recognition.", Int. Symp. on Communications and Information Technologies (ISCIT). IEEE, 2010.Google Scholar
- Sivakumar, D. "Algorithmic derandomization using complexity theory." 34th ACM Symp. Theory of Computing, 2002. pp. 619âĂŞ626. Google ScholarDigital Library
Recommendations
Random projection in dimensionality reduction: applications to image and text data
KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data miningRandom projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however, empirical results are sparse. We present experimental results on using ...
Tensor Locality Preserving Sparse Projection for Image Feature Extraction
Manifold learning is a hot topic in feature extraction, wherein high-dimensional data is represented in a potential low-dimensional manifold. In this paper, a novel manifold-learning method called tensor locality preserving sparse projection (TLPSP) is ...
Lorentzian discriminant projection and its applications
ACCV'09: Proceedings of the 9th Asian conference on Computer Vision - Volume Part IIIThis paper develops a supervised dimensionality reduction method, Lorentzian Discriminant Projection (LDP), for discriminant analysis and classification Our method represents the structures of sample data by a manifold, which is furnished with a ...
Comments