This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
September 1976 (vol. 2 no. 3)
pp. 185-193
R.C.T. Lee, Institute of Applied Mathematics, National Tsing Hua University
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.
Index Terms:
variance, Baskett and Shustek algorithm, best-match, exact-match, hash coding for best-match searching, multikey searching, principal component analysis, the Friedman
Citation:
R.C.T. Lee, Y.H. Chin, S.C. Chang, "Application of Principal Component Analysis to Multikey Searching," IEEE Transactions on Software Engineering, vol. 2, no. 3, pp. 185-193, Sept. 1976, doi:10.1109/TSE.1976.225946
Usage of this product signifies your acceptance of the Terms of Use.