Application of Principal Component Analysis to Multikey Searching

1 September 1976

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering

Vol. SE-2 (3) , 185-193
https://doi.org/10.1109/tse.1976.225946

Abstract

In this paper, we shall introduce a concept widely used by statisticians, the principal component analysis technique. We shall show that this principal component analysis technique can be used to create new keys from a set of old keys. These new keys are very useful in narrowing down the search domain. We shall also show that the projections on the first principal component direction can be viewed as hashing addresses for the best-match searching problem.

Keywords

This publication has 7 references indexed in Scilit:

Distinguishing vegetation land covers using hyperspectral imagery
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2004
An Algorithm for Finding Nearest Neighbors
IEEE Transactions on Computers, 1975
A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis
IEEE Transactions on Systems, Man, and Cybernetics, 1973
Application of information theory to select relevant variables
Mathematical Biosciences, 1971
A relational model of data for large shared data banks
Communications of the ACM, 1970
On the generalized Karhunen-Loeve expansion (Corresp.)
IEEE Transactions on Information Theory, 1967
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
Annals of Eugenics, 1936