DocumentCode
1114489
Title
Nonlinear Intrinsic Dimensionality Computations
Author
Chen, Chiu Kuan ; Andrews, Harry C.
Author_Institution
Department of Electrical Engineering, University of Southern California
Issue
2
fYear
1974
Firstpage
178
Lastpage
184
Abstract
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.
Keywords
Feature selection, intrinsic dimensionality, minimum spanning tree, nonlinear mapping, pattern recognition, rank orders.; Circuit synthesis; Circuits and systems; Clocks; Cost function; Electrons; Encoding; Feedback; Pattern recognition; Shift registers; Switching circuits; Feature selection, intrinsic dimensionality, minimum spanning tree, nonlinear mapping, pattern recognition, rank orders.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1974.223882
Filename
1672475
Link To Document