Representation of Nonlinear Data Surfaces
- 1 October 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-22 (10) , 915-922
- https://doi.org/10.1109/t-c.1973.223618
Abstract
This paper is concerned with the use of "intrinsic dimensionality" in the representation of multivariate data sets that lie on nonlinear surfaces. The term intrinsic refers to the small, local-region dimensionality ( mI) of the surface and is a measure of the number of parameters or factors that govern a data generating process. The number mI is usually much lower than the dimensionality that is given by the standard Karhunen-Loève expansion. Representation of the data is accomplished by transforming the data to a linear space of mI dimensions using a new noniterative mapping procedure. This mapping gives a significant reduction in dimensionality and preserves the geometric data structure to a large degree. Single-and two-surface data sets are considered. Numerical examples are presented to illustrate both techniques.Keywords
This publication has 12 references indexed in Scilit:
- An Algorithm for Finding Intrinsic Dimensionality of DataIEEE Transactions on Computers, 1971
- Graph-Theoretical Methods for Detecting and Describing Gestalt ClustersIEEE Transactions on Computers, 1971
- Representation of random processes using the finite Karhunen-Loève expansionInformation and Control, 1970
- A Nonlinear Mapping for Data Structure AnalysisIEEE Transactions on Computers, 1969
- Minimum Spanning Trees and Single Linkage Cluster AnalysisJournal of the Royal Statistical Society Series C: Applied Statistics, 1969
- An Algorithm for Non-Parametric Pattern RecognitionIEEE Transactions on Electronic Computers, 1966
- Nonmetric Multidimensional Scaling: A Numerical MethodPsychometrika, 1964
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesisPsychometrika, 1964
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman ProblemProceedings of the American Mathematical Society, 1956