Mathematical Classification and Clustering: From How to What and Why
Although some clustering techniques are well known and widely used, their theoretical foundations are still unclear. We consider an approach, approximation clustering, as a unifying framework for making theoretical foundations to some popular techniques. The questions of interrelation of the models with each other and with some other methods (especially in contingency and spatial data analyses) are also discussed.
KeywordsAgglomeration Pyramid Archies
Unable to display preview. Download preview PDF.
- BREIMAN, L., FRIEDMAN, J.H., OLSHEN, R.A., and STONE, C.J. (1984): Classification and Regression Trees. Wadswarth International Group, Belmont, Ca.Google Scholar
- FISHER, D.H. (1987): Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2, 139–172.Google Scholar
- JAIN, A.K. and DUBES, R.C. (1988): Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, NJ.Google Scholar
- KAY, J. (1994): Wavelets. Advances in Applied Statistics, 2, 209–224.Google Scholar
- MALLAT, S.G. (1989): Multiresolution approximations and wavelet orthonormal bases on L 2 (R). Transactions of the American Mathematical Society, 315, 69–87.Google Scholar
- MIRKIN, B. (1997): Concept learning and feature selecting based on square-error clustering. Machine Learning (to appear).Google Scholar
- MIRKIN, B. (1998): Linear embedding of binary hierarchies and its applications. In: B. Mirkin, F. McMorris, F. Roberts and A. Rzhetsky (eds.): Mathematical Hierarchies and Biology. DIMACS AMS Series. American Mathematical Society, Providence (to appear).Google Scholar
- SAMET, H. (1990): The Design and Analysis of Spatial Data Structures. Addison-Wesley Series on Computer Science and Information Processing. Addison-Wesley Publishing Company, Amsterdam.Google Scholar