Abstract
As indicated in the Preface, we shall start by describing mathematically the structure sought in Clustering. The latter is a partition or an ordered partition chain on a finite set E. A new structure has appeared these last years where each partition class is a subset of E, linearly ordered. Relative to the latter structure, an introduction will be given in Sect. 1.4.5.
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
Notes
- 1.
This section could be examined after Sect. 2.2 of Chap. 2.
References
Berge, C.: Principes de Combinatoire. Dunod, Paris (1970)
Berge, C.: Principles of Combinatorics. Academic Press, Cambridge (1971)
Birkhoff, N.: Lattice Theory. A.M.S., New York (1967)
De La Véga, W.F.: Caractérisation des sommets adjacents sur un plyèdre associé à l’ensemble des relations d’éqivalence sur un ensemble fini. Note Interne 47, Centre d’Analyse Documentaire pour l’Archéologie, C.N.R.S., Marseille (1971)
Frank, O., Svensson, K.: On probability distribution of single-linkage dendrograms. J. Statist. Comput. Simul. 12, 121–131 (1981)
Gras, R., Kuntz, P.: Discovering r-rules with a directed hierarchy. Soft Comput. 10, 453–460 (2005)
Gras, R., Kuntz, P.: An overview of the statistical implicative analysis development. In: Guillet, F., Gras, R., Suzuki, E., Spagnolo, F. (eds.) Statistical Implicative Analysis, pp. 11–40. Springer, New York (2008)
Gras, R., Larher, A.: L’implication statistique, une nouvelle méthode d’analyse des données. Mathématiques et Sciences Humaines, 120, 5–31 (1993)
Guillaume, S., Lerman, I.C.: Analyse du comportement limite d’indices probabilistes pour une sélection discriminante. In: Khenchaf, A., Poncelet, P. (eds.) Revue de l’Information et des Nouvelles Technologies, RNTI E.20, EGC’2011, pp. 657–664. Hermann (2011)
Guillet, F., Hamilton, H.J. (eds.): Quality Measures in Data Mining, Studies in Computational Intelligence. Springer, New York (2007)
Johnson, S.C.: Hierarchical clustering schemes. Psychometrika 32(3), 241–254 (1967)
Lengyel, T.: On the numbers of all agglomerative clustering hierarchies. In: COMPSTAT 1982, Part II, pp. 177–178. Physica-Verlag, Springer, Heidelberg (1982)
Lent, B., Swami, A.N., Widow, J.: Clustering association rules. In: Werner, B. (eds.) Proceedings of the 13th Conference on Data Engineering, pp. 220–231. IEEE Computer Society, Washington (1997)
Lerman, I.C.: Analyse du problème de la recherche d’une hiérarchie de classifications. Publication Interne 22, Maison des Sciences de l’Homme, Centre de Mathématiques Appliquées et de Calcul, February (1968)
Lerman, I.C.: Les bases de la classification automatique. Gauthier-Villars (1970)
Lerman, I.C.: Classification et analyse ordinale des données. Dunod and http://www.brclasssoc.org.uk/books/index.html (1981)
Lerman, I.C.: Analyse logique, combinatoire et statistique de la construction d’une hiérarchie binaire implicative; niveaux et noeuds significatifs. Mathématiques et Sciences humaines / Mathematics and Social Sciences, 184, 47–103 (2008)
Lerman, I.C., Azé. A new measure of interestingness for association rules, based on the likelihood of the link. In: Guillet, F., Hamilton, H.J. (eds.) Quality Measures in Data Mining, Studies in Computational Intelligence, vol. 43, pp. 207–236. Springer, New York (2007)
Lerman, I.C., Ghazzali, N.: What do we retain from a classification tree? an experiment in image coding. In: Diday, E., Lecevallier, Y. (eds.) Symbolic-Numeric Data Analysis and Learning, pp. 27–42. Nova Science, New York (1991)
Lerman, I.C., Guillaume, S.: Analyse comparative d’indices discriminants fondés sur une échelle de probabilité. Research Report 7187, IRISA-INRIA, February (2010)
Lerman, I.C., Guillaume, S.: Comparing two discriminant probabilistic interestingness measures for association rules. In: Venturini, G., Guillet, F., Pinaud, B., Zighed, D.A. (eds.) Advances in Knowledge Discovery and Management, volume 471 of Studies in Computational Intelligence, pp. 59–83. Springer, New York (2013)
Lerman, I.C., Kuntz, P.: Directed binary hierarchies and directed ultrametrics. J. Classif. 28, 272–296, October (2011)
Monjardet, B.: Note sur les treillis géométriques et l’axiomatique du treillis des partitions d’un ensemble fini. Mathématiques et Sciences Humaines, 22, 23–26 (1968)
Murtagh, F.: Counting dendrograms: a survey. Discret. Appl. Math. 7, 191–199 (1984)
Régnier, S.: Études sur le polyèdre des partitions. Mathématiques et Sciences Humaines, 82, 85–111 (1983)
Saporta, G.: Théorie et Méthodes de la Statistique. Editions Technip (1978)
Volle, M.: Analyse des Données. Economica (1981)
Waring, E.: Meditationes Algebraicae, translation by Dennis Weeks of the 1782 edition. American Math. Soc., Providence (1991)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer-Verlag London
About this chapter
Cite this chapter
Lerman, I.C. (2016). On Some Facets of the Partition Set of a Finite Set. In: Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-4471-6793-8_1
Download citation
DOI: https://doi.org/10.1007/978-1-4471-6793-8_1
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-6791-4
Online ISBN: 978-1-4471-6793-8
eBook Packages: Computer ScienceComputer Science (R0)