The snake for visualizing and for counting clusters in multivariate data

Statistical Analysis and Data Mining

Thomas R. Willemain¹  Adam Petrie² 

[1] Department of Decision Sciences and Engineering Systems, Rensselaer Polytechnic Institute, Troy, NY 12180, USA;Department of Statistics, Operations, and Management Science, University of Tennessee, Knoxville, TN 37996, USA

关键词: clustering;    Hamiltonian path;    multidimensional scaling;    multivariate mode;    runs test;    shortest path;    Traveling Salesman Tour;    low‐;    dimensional projection;   

DOI  :  10.1002/sam.10076

学科分类：社会科学、人文和艺术（综合）

来源: John Wiley & Sons, Inc.

【 摘 要 】

Abstract We introduce the `snake', a new tool for the visualization and exploration of a multivariate dataset. The snake connects each data point along a single short path. Using techniques from the Traveling Salesman Problem (TSP), it is possible to find such a path in polynomial (nearly quadratic) computational time. A plot of the individual segment lengths versus their position along the path transforms the original multidimensional dataset into a one-dimensional `time-series' of interpoint.

【 授权许可】

Unknown