An Algorithm for Finding Intrinsic Dimensionality of Data
IEEE Transactions on Computers
A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space
IEEE Transactions on Computers
An Algorithm for Determining the Topological Dimensionality of Point Clusters
IEEE Transactions on Computers
Stastical Estimation of the Intrinsic Dimensionality of a Noisy Signal Collection
IEEE Transactions on Computers
| Hi-index | 14.99 |
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.