Approved for public release; distribution is unlimitedA separation algorithm applicable to the pattern classification and cluster analysis of n-dimensional (n > 2) data is presented. The algorithm reduces the dimensionality of the problem by projecting each point into a plane. This plane is presented to the user on a computer graphics console screen. The operator picks a point on the screen with a lightpen and chooses a "direction of movement" to achieve or increase separation, thereby causing an iteration of the algorithm. Each iteration is in fact a reorientation of the plane into which the data points are projected. Iterations continue until satisfactory separation is achieved. The algorithm is not restricted by the dimensionality of the data, nor are any distributional assumptions required. Results from six case studies indicate that the algorithm is a useful tool for the analysis of multidimensional data.http://archive.org/details/computergraphics00lauzLieutenant, United States Nav
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.