Evaluation of Projection Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-3, Issue 6, 1981, Pages 701-708

  Biswas, Gautam ^a   Jain, Anil K ^a   Dubes, Richard C ^a  

^a MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

Exploratory data analysis; linear mapping; minimum spanning tree; nonlinear mapping; pattern recognition; two dimensional projection

Indexed keywords

IMAGE PROCESSING;

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

References (33)

1. K. W. Pettis, T. A. Bailey, A. K. Jain, and R. C. Dubes, “An intrinsic dimensionality estimator from near neighbor information,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, pp. 25–37, Jan. 1979.
2. J. Kittler, “Mathematical methods for feature selection in pattern recognition,” Int. J. Man-Mach. Studies, vol. 7, pp. 609–637, 1975.
3. A. K. Jain and R. C. Dubes, “Feature definition in pattern recognition with small sample size,” Pattern Recognition, vol. 10, pp. 85-97, 1978.
4. M. Ichino and K. Hiramatsu, “Suboptimal linear feature selection in multiclass problems,” IEEE Trans. Syst., Man, Cybern., vol. SMC-4, pp. 28-33, 1974.
5. D. H. Foley and J. W. Sammon, Jr., “An optimal set of discriminant vectors,” IEEE Trans. Comput., vol. C-24, pp. 281–289, 1975.
6. J. Fehlauer and B. A. Eisenstein, “A declustering criterion for feature extraction in pattern recognition,” IEEE Trans. Comput., vol. C-27, pp. 261–266, Mar. 1978.
7. T. W. Calvert, “Nonorthogonal projections for feature extraction in pattern recognition,” IEEE Trans. Comput., vol. C-19, pp. 447-452, 1970.
8. J. B. Kruskal, “Nonmetric multidimensional scaling: A numerical method,” Psychometrika, vol. 29, pp. 115-129, 1964.
9. J. B. Kruskal, “Multidimensional scaling and other methods for discovering structure,” in Statistical Methods for Digital Computers, K. Enslein, A. Ralston, and H. S. Wilf, Eds. New York: Wiley, 1977, pp. 296–339.
10. R. N. Shepard, A. K. Romney, and S. B. Nerlove, Multidimensional Scaling, vol. 1, Theory. New York: Seminar, 1972.
11. H. Chernoff, “The use of faces to represent points in k-dimensional sional space graphically,” J. Amer. Statist. Ass., vol. 68, pp. 361–368, 368, June 1973.
12. H. Chernoff, “Graphical representation as a discipline,” U. S. Dep. Commerce, Rep. AD/A-056-633
13. B. S. Everitt and P. Nicholls, “Visual techniques for representing multivariate data,” Statistician, vol. 24, pp. 37–49, Mar. 1975.
14. B. S. Everitt, Graphical Techniques for Multivariate Data. New York: North-Holland, 1978.
15. K. Fukunaga, Introduction to Statistical Pattern Recognition. New York: Academic, 1972.
16. W. J. Krzanowski, “Some exact percentage points of a statistic useful in analysis of variance and principal component analysis,” Technometrics, vol. 21, pp. 261–263, May 1979.
17. G. H. Ball, “Data analysis in the social sciences-What about the details?,” in Proc. Fall Joint Comput. Conf., 1965, pp. 553–554.
18. R. O.Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973.
19. K. Fukunaga and S. Ando, “The optimum nonlinear features for a scatter criterion in discriminant analysis,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 453–459, July 1977.
20. J. H. Friedman and J. W. Tukey, “A projection pursuit algorithm for exploratory data analysis,” IEEE Trans. Comput., vol. C-23, pp. 881–890, Sept. 1974.
21. J. W. Sammon, Jr., “A nonlinear mapping for data structure analysis,” IEEE Trans. Comput., vol. C-18, pp. 401–409, May 1969.
22. J. B. Kruskal, “Comments on a nonlinear mapping for data structure analysis,” IEEE Trans. Comput., vol. C-20, p. 1614, 1971.
23. H. Niemann and J. Weiss, “A fast converging algorithm for nonlinear mapping of high-dimensional data onto a plane,” IEEE Trans. Comput., vol. C-28, pp. 401–409, Feb. 1979.
24. 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.
25. B. Schachter, “A nonlinear mapping algorithm for large data bases,” Comput. Graphics Image Processing, vol. 7, pp. 271-278, 1978. 278, 1978.
26. C. E. Pykett, “Improving the efficiency of Sammon's nonlinear mapping by using clustering archetypes,” Electron. Lett., vol. 14, pp. 799–800, Dec. 1978.
27. 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-27, pp. 288–292, Mar. 1977.
28. O. I. Tosi, Voice Identification and Its Legal Application. New York: Academic, 1978.
29. R. Dubes, A. K. Jain, and 0. I. Tosi, “Speaker recognition studies on choral speech,” in Proc. 1979 Carnahan Conf. Crime Counter Measures, 1979, pp. 165–171.
30. R. A. Fisher, “The use of multiple measurements in taxonomic problems,” Ann. Eugen., vol. 7, pp. 178-188, 1936.
31. M. R. Anderberg, Cluster Analysis for Applications. New York: Academic, 1973.
32. H. Niemann, “Linear and nonlinear mapping of patterns,” Pattern Recognition, vol. 12, pp. 83-87, 1980.
33. R. Dubes and A. K. Jain, “Clustering methodologies in exploratory data analysis,” in Advances in Computers, vol. 19, M. C. Yovits, Ed. New York: Academic, 1980, pp. 113–215.