An Intrinsic Dimensionality Estimator from Near-Neighbor Information

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-1, Issue 1, 1979, Pages 25-37

  Pettis, Karl W ^a   Bailey, Thomas A ^a   Jain, Anil K ^a   Dubes, Richard C ^a  

^a MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

Index Terms Eigenvalues; interpoint distances; intrinsic dimensionality; near neighbor information; outliers

Indexed keywords

PATTERN RECOGNITION SYSTEMS;

EID: 0018295624     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1979.4766873     Document Type: Article

References (29)

1. G. H. Ball, “Data analysis in the social sciences: What about the details?,” in Proc. Fall Joint Computer Conf., , 1965, pp. 533–554.
2. J. B. Kruskal, “Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis,” Psychometrika, vol. 29, pp. 1–27, Mar. 1964.
3. J. B. Kruskal, “Nonmetric multidimensional scaling: A numerical method,” Psychometrika, vol. 29, pp. 115–129, June 1964.
4. R. N. Shepard, “The analysis of proximities: Multidimensional scaling with an unknown distance function,” Psychometrika, vol. 27, pp. 125–140, June 1962.
5. R. S. Bennett, “The intrinsic dimensionality of signal collections,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 517–525, Sept. 1969.
6. C. K. Chen and H. C. Andrews, “Nonlinear intrinsic dimensionality computations,” IEEE Trans. Comput., vol. C-23, pp. 178–184, 184, Feb. 1974.
7. R. N. Shepard and J. D. Carroll, “Parametric representation of nonlinear data structures,” in Multivariate Analysis, P. R. Krish-naiah, Ed. New York: Academic, 1966, pp. 561–592.
8. J. W. Sammon, Jr., “A nonlinear mapping for data structure analysis,” IEEE Trans. Comput., vol. C-18, pp. 401–409, May 1969.
9. J. B. Kruskal, “A nonlinear mapping for data structure analysis,” IEEE Trans. Comput., vol. C-20, p. 1614, Dec. 1971.
10. C. L. Chang and R. C. T. Lee, “A heuristic relaxation method for nonlinear mapping in cluster analysis,” IEEE Trans. Syst., Man, Cybern., vol. SMC-3, pp. 197–200, Mar. 1973.
11. J. B. Kruskal and R. E. Hart, “A geometric interpretation of diagnostic data from a digital machine,” Bell Syst. Tech. J., vol. 45, pp. 1299-1338, 1966.
12. J. B. Kruskal, “Linear transformations of multivariate data to reveal clustering,” in Multidimensional Scaling, vol. 1, Theory, R. N. Shepard, A. K. Romney, and S. B. Nerlove. New York: Seminar Press, 1972.
13. J. B. Kruskal and J. D. Carroll, “Geometrical models and badness-of-fit functions,” in Multivariate Analysis-II, P. R. Krishnaiah, Ed. New York: Academic, 1969, pp. 639–671.
14. R. N. Shepard, “Representation of structure in similarity data-problems problems and prospects,” Psychometrika, vol. 39, pp. 373–421, Dec. 1974.
15. A. K. Romney, R. N. Shepard, and S. B. Nerlove, Multidimensional Scaling, vol. 2, Applications. New York: Seminar Press, 1972.
16. A. K. Romney, R. N. Shepard, and S. B. Nerlove, Multidimensional Scaling, vol. I, Theory. New York: Seminar Press, 1972.
17. D. H. Schwartzmann and J. J. Vidal, “An algorithm for determining the topological dimensionality of point clusters,” IEEE Trans. Comput., vol. C-24, pp. 1175–1182, Dec. 1975.
18. K. Fukunaga and D. R. Olsen, “An algorithm for finding intrinsic dimensionality of data,” IEEE Trans. Comput., vol. C-20, pp. 176-183, Feb. 1971.
19. G. V. Trunk, “Statistical estimation of the intrinsic dimensionality of a noisy signal collection,” IEEE Trans. Comput., vol. C-25, pp. 165–171, Feb. 1976.
20. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973, p. 87.
21. L. Breiman, Probability. Reading, MA: Addison-Wesley, 1968, pp. 237–238.
22. P. J. Davis, “Gamma function and related functions,” Handbook of Mathematical Functions, M. Abramowitz and I. A. Stegun, Eds. Washington, DC: U.S. Government Printing Office, 1965, pp. 253–293.
23. R. A. Jarvis and E. A. Patrick, “Clustering using a similarity measure based on shared near neighbors,” IEEE Trans. Comput., vol. C-22, pp. 1025–1034, Nov 1973
24. T. M. Cover and P. E. Hart, “Nearest neighbor pattern classification,” IEEE Trans. Inform. Theory, vol. IT-13, pp, 21–26, Jan, 1967.
25. T. W. Calvert, “Nonorthogonal projections for feature extraction in pattern recognition,” IEEE Trans. Comput., vol. C-19, pp. 447–452, May 1970
26. R. C. T. Lee, J. R. Slagle, and H. Blum, “A triangulation method for the sequential mapping of points from N-space to two-space,” IEEE Trans. Comput., vol. C-26, pp, 288–292, Mar. 1977.
27. J. H. Friedman, F. Baskett, and L. J. Shustek, “An algorithm for finding nearest neighbors,” IEEE Trans. Comput., vol. C-25, pp. 1000–1006, Oct. 1975.
28. T. P. Yunck, “A technique to identify nearest neighbors,” IEEE Trans. Syst., Man, Cybern., vol. SMC-6, 678–683, Oct. 1976.
29. M. E. Muller, “A note on a method for generating points uniformly on N-dimensional spheres,” Commun. Ass. Comput. Mach., vol. 2, pp. 19–20, Apr. 1959.