%0 Journal Article %1 2003 %A Bolton, R. J. %A Krzanowski, W. J. %D 2003 %I American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of America %J Journal of Computational and Graphical Statistics %K classification clustering krzanowski multivariate projection-pursuit %N 1 %P pp. 121-142 %T Projection Pursuit Clustering for Exploratory Data Analysis %U http://www.jstor.org/stable/1391072 %V 12 %X Exploratory projection pursuit is a set of data analytic techniques for finding "interesting" low-dimensional projections of multivariate data. One particular interesting structure is that of clusters in the data. Projection pursuit clustering is a synthesis of projection pursuit and nonhierarchical clustering methods that simultaneously attempts to cluster the data and to find a low-dimensional representation of this cluster structure. We introduce a projection pursuit clustering index based on orthogonal canonical variates that takes account of scale in the data, and compare our index with one previously suggested. We show that the two indexes are identical when the data are sphered, and discuss when such sphering should be done. We also propose diagnostics for finding the optimum number of groups in projection pursuit clustering, and extend the technique to search for clusters in higher dimensions. All the methodology is illustrated and evaluated on one simulated and two real datasets.

@article{2003, abstract = {Exploratory projection pursuit is a set of data analytic techniques for finding "interesting" low-dimensional projections of multivariate data. One particular interesting structure is that of clusters in the data. Projection pursuit clustering is a synthesis of projection pursuit and nonhierarchical clustering methods that simultaneously attempts to cluster the data and to find a low-dimensional representation of this cluster structure. We introduce a projection pursuit clustering index based on orthogonal canonical variates that takes account of scale in the data, and compare our index with one previously suggested. We show that the two indexes are identical when the data are sphered, and discuss when such sphering should be done. We also propose diagnostics for finding the optimum number of groups in projection pursuit clustering, and extend the technique to search for clusters in higher dimensions. All the methodology is illustrated and evaluated on one simulated and two real datasets.}, added-at = {2011-08-25T12:10:01.000+0200}, author = {Bolton, R. J. and Krzanowski, W. J.}, biburl = {https://www.bibsonomy.org/bibtex/29eeaec4cfc5fd435b2706484e60667e3/vivion}, copyright = {Copyright © 2003 American Statistical Association, Institute of Mathematical Statistics and Interface Foundation of America}, description = {JSTOR: Journal of Computational and Graphical Statistics, Vol. 12, No. 1 (Mar., 2003), pp. 121-142}, interhash = {7254b00663d636051c89514fa5ba07f7}, intrahash = {9eeaec4cfc5fd435b2706484e60667e3}, issn = {10618600}, journal = {Journal of Computational and Graphical Statistics}, jstor_articletype = {research-article}, jstor_formatteddate = {Mar., 2003}, keywords = {classification clustering krzanowski multivariate projection-pursuit}, language = {English}, number = 1, pages = {pp. 121-142}, publisher = {American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of America}, timestamp = {2011-08-25T12:13:14.000+0200}, title = {Projection Pursuit Clustering for Exploratory Data Analysis}, url = {http://www.jstor.org/stable/1391072}, volume = 12, year = 2003 }