An Algorithm for Finding Intrinsic Dimensionality of Data
IEEE Transactions on ComputersPublished 1 February 1971
Keinosuke Fukunaga, D.R. Olsen
Citations346
SJR quartileQ1
SJR score1.16
SNIP1.61
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An algorithm for the analysis of multivariant data is presented along with some experimental results, and an analysis that demonstrates the feasability of this approach.
Abstract
An algorithm for the analysis of multivariant data is presented along with some experimental results. The basic idea of the method is to examine the data in many small subregions, and from this determine the number of governing parameters, or intrinsic dimensionality. This intrinsic dimensionality is usually much lower than the dimensionality that is given by the standard Karhunen-Loève technique. An analysis that demonstrates the feasability of this approach is presented.
Keywords
Computer ScienceMathematics
PsychometrikaMultidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis
7,398 Citations1964Joseph B. Kruskal
The fundamental hypothesis is that dissimilarities and distances are monotonically related, and a quantitative, intuitively satisfying measure of goodness of fit is defined to this hypothesis.
Detection, Estimation, And Modulation Theory
5,977 Citations1968Harry L. Van Trees
Detection, estimation, and modulation theory, Detection, estimation and modulation theorists, اطلاعات رسانی کشاورزی .
PsychometrikaNonmetric Multidimensional Scaling: A Numerical Method
4,882 Citations1964Joseph B. Kruskal
The numerical methods required in the approach to multi-dimensional scaling are described and the rationale of this approach has appeared previously.
IEEE Transactions on ComputersA Nonlinear Mapping for Data Structure Analysis
3,381 Citations1969John W. Sammon
An algorithm for the analysis of multivariate data is presented along with some experimental results that is based upon a point mapping of N L-dimensional vectors from the L-space to a lower-dimensional space such that the inherent data "structure" is approximately preserved.
PsychometrikaThe Analysis of Proximities: Multidimensional Scaling with an Unknown Distance Function. I.
2,553 Citations1962Roger N. Shepard
The program is proposed as a tool for reductively analyzing several types of psychological data, particularly measures of interstimulus similarity or confusability, by making explicit the multidimensional structure underlying such data.
PsychometrikaThe Analysis of Proximities: Multidimensional Scaling with an Unknown Distance Function. II
912 Citations1962Roger N. Shepard
The results of two kinds of test applications of a computer program for multidimensional scaling on the basis of essentially nonmetric data are reported to measures of interstimulus similarity and confusability obtained from some actual psychological experiments.
IEEE Transactions on Information TheoryThe intrinsic dimensionality of signal collections
105 Citations1969Ronan Bennett
A digital computer program for estimating dimensionality from the signal coefficients on an arbitrary basis has been developed and the results are believed to be independent of the choice of orthogonal basis, and no prior knowledge of the analytical form of the signals is assumed.
Information and ControlRepresentation of random processes using the finite Karhunen-Loève expansion
53 Citations1970Keinosuke Fukunaga, Warren Koontz
This paper treats two questions about the finite Karhunen-Loeve expansion: how many samples should the wave vector contain and how can the eigenvectors of the autocorrelation matrix be estimated?
Information and ControlStatistical estimation of the intrinsic dimensionality of data collections
34 Citations1968G.V. Trunk
A statistical method is presented for estimating the intrinsic dimensionality of F(·), defined as the least number of parameters needed to identify any f i (·) belonging to F (·), which is equal to the topological dimensionability of this surface.
IEEE Transactions on Systems Science and CyberneticsRandomly Generated Nonlinear Transformations for Pattern Recognition
16 Citations1969Thomas W. Calvert, Tzay Y. Young
A general method is proposed to find suitable transformations for discrete data in information processing problems where a transformation is found for the feature space such that classes, which are not linearly separable in the original space, become so in the transformed space.