Experiments on mapping techniques for exploratory pattern analysis

Abstract We describe two computer-based experiments evaluating the effectiveness of several mapping techniques for exploratory pattern analysis. The first experiment compares various mappings and classical clustering techniques as aids to people whose objective is to find clusters in the data. The second experiment evaluates the effectiveness of two-dimensional displays produced by analytic mappings for people designing linear and piecewise linear classifiers. The performance of the classifiers designed by the people aided by these displays is compared with automatically trained classifiers. Based on these experiments we selected three best mapping methods. Even the untrained users who took part in our experiments achieved very good results with the aid of these best mappings. In fact, these results were superior by a significant margin to those obtained from renowned classical pattern recognition procedures. Another valuable result of our experiments is that they allowed us to identify the sets of parameters most often used by the participants and, consequently, suggest guidelines for the best use of mapping techniques.

[1]  Gautam Biswas,et al.  Evaluation of Projection Algorithms , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Fionn Murtagh,et al.  A Survey of Recent Advances in Hierarchical Clustering Algorithms , 1983, Comput. J..

[3]  John W. Tukey,et al.  A Projection Pursuit Algorithm for Exploratory Data Analysis , 1974, IEEE Transactions on Computers.

[4]  H. Edelsbrunner,et al.  Efficient algorithms for agglomerative hierarchical clustering methods , 1984 .

[5]  Jack Sklansky,et al.  Locally Trained Piecewise Linear Classifiers , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  D. Defays,et al.  An Efficient Algorithm for a Complete Link Method , 1977, Comput. J..

[7]  Edzard S. Gelsema,et al.  Mapping algorithms in ispahan , 1980, Pattern Recognit..

[8]  Robin Sibson,et al.  SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..

[9]  Jack Sklansky,et al.  An overview of mapping techniques for exploratory pattern analysis , 1988, Pattern Recognit..