We present a new clustering procedure called K-midranges clustering. K-midranges is analogous to the traditional K-Means procedure for clustering interval scale data. The K-midranges procedure explicitly optimizes a loss function based on the L∞, norm (defined as the limit of an Lp norm as p approaches infinity).
KeywordsContinuous data Cluster analysis Groups Midrange K-means
Unable to display preview. Download preview PDF.
- Carroll, J. D., & Chaturvedi, A. D. (1995). A General Approach to Clustering and Multidimensional Scaling of Two-way, Three-way, or Higher-way Data, in Geometric Representations of Perceptual Phenomena: Papers in Honor of Tarow Indow’s 70th Birthday. Luce, R. D., D’Zmura, M., Hoffman, D. D., Iverson, G., & Romney, A. K. (Eds.), Lawrence Erlbaum, 295 - 318.Google Scholar
- Chaturvedi, A. D., Paul E. Green, and J. Douglas Carroll (1996). Market Segmentation via K-modes clustering. Invited paper presented at the American Statistical Association conference held in Chicago.Google Scholar
- Hartigan, J. A. (1975). Clustering Algorithms, Wiley, New York.Google Scholar
- Jain, A. K. & Richard C. Dubes (1988), Algorithms for Clustering Data, Prentice- Hall, New Jersey.Google Scholar
- Kaufman, L. & Peter J. Rousseeuw (1989). Finding Groups in Data: An Introduction to Cluster Analysis, Wiley, New York.Google Scholar
- MacQueen, J. B. (1967). Some Methods for Classification and Analysis of Multivariate Observations, in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability. LeCam, L. M., & Neyman, J. (Eds.), 1, 281–297.Google Scholar