Abstract
Two new families of clustering algorithms emerge from the a priori determination of attraction poles.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
I.C. Lerman, Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering (Springer Nature, 2016)
H.-H. Bock, Clustering methods: a history of \(k\)-means algorithms, in Selected Contributions in Data Analysis and Classification, ed. by G. Cucumel, P. Brito, P. Bertrand, F. de Carvalho (Springer, 2007), pp. 161–172
A.K. Jain, 50 years beyond k-means. Pattern Recognit. Lett. 31, 651–666 (2010)
L. Lebart, J.-P. Fenelon, Statistique et Informatique Appliquées (Dunod, 1973)
F. Caillez, J.P. Pagès, Introduction à l’Analyse des Données (SMASH-BURO, 1976)
I.C. Lerman, Classification et analyse ordinale des données (Dunod, 1981), http://www.brclasssoc.org.uk/books/index.html
I.C. Lerman, Convergence optimale de l’algorithme de “réallocation-recentrage” dans le cas continu le plus simple. R.A.I.R.O. Recherche opérationnelle/Oper. Res. 20(1), 19–50 (1986)
G. Celeux, Étude exhaustive de l’algorithme de réallocation-recentrage dans un cas simple. R.A.I.R.O. Recherche opérationnelle/Oper. Res. 20(3), 229–243 (1986)
H. Leredde, La méthode des poles d’attraction, La méthode des poles d’agrégation. Ph.D. thesis, Université de Paris 6, October 1979
A.D. Gordon, A review of hierarchical classification. J.R. Stat. Soc. 150(2), 119–137 (1987)
F. Murtagh, P. Contreras, Algorithms for hierarchical clustering: an overview, ii. WIREs Data Min. Knowl. Discov. 1–16 (2017)
E.H. Ruspini, Numerical methods for fuzzy clustering. Inf. Sci. 2, 319–350 (1970)
E.H. Ruspini, A new approach to clustering. Inf. Control 15, 22–32 (1969)
L.A. Zadeh, Fuzzy sets. Inf. Control 8, 338–353 (1965)
R.A. Fisher, The use of multiple measurements in taxonomic problems. Ann. Eugen. 179–188 (1936)
G.J. Mc Lachlan, Discriminant Analysis and Statistical Pattern Recognition (Wiley Interscience, 2004)
P. Arabie, L.J. Hubert, Combinatorial data analysis. Annu. Rev. Psychol. 43, 169–203 (1992)
J. Bertin, Traitements graphiques et mathématiques. différence fondamentale et complémentarité. Mathématiques et Sci. Hum. 80, 60–71 (1980)
E. Diday, Une nouvelle méthode de classification automatique et reconnaissance des formes. Revue de Statistique Appliquée XIX, 19–34 (1971)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Lerman, I.C., Leredde, H. (2022). Clustering Methods from Proximity Variance Analysis. In: Seriation in Combinatorial and Statistical Data Analysis. Advanced Information and Knowledge Processing. Springer, Cham. https://doi.org/10.1007/978-3-030-92694-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-92694-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92693-9
Online ISBN: 978-3-030-92694-6
eBook Packages: Computer ScienceComputer Science (R0)