This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
February 1974 (vol. 23 no. 2)
pp. 178-184
null Chiu Kuan Chen, Department of Electrical Engineering, University of Southern California
In pattern recognition, the raw data and dimensionality of the measurement space is usually very large. Therefore, some form of dimensionality reduction has been commonly considered as a practical preprocessing method for feature selection. Based on a method that increases the variance while maintaining local structure, a technique is developed to determine intrinsic dimensionality. A cost function is introduced to guide the maintenance of the rank order and therefore local structure. Two criteria of using the cost function to increase the variance have been introduced. Several methods of defining the local regions are suggested. A program is implemented and tested to find the intrinsic dimensionality of a variety of experimental data.
Index Terms:
Feature selection, intrinsic dimensionality, minimum spanning tree, nonlinear mapping, pattern recognition, rank orders.
Citation:
null Chiu Kuan Chen, H.C. Andrews, "Nonlinear Intrinsic Dimensionality Computations," IEEE Transactions on Computers, vol. 23, no. 2, pp. 178-184, Feb. 1974, doi:10.1109/T-C.1974.223882
Usage of this product signifies your acceptance of the Terms of Use.