Consensus of partitions: A constructive approach

Advances in Data Analysis and Classification

Volumn 5, Issue 3, 2011, Pages 215-229

  Guénoche, Alain ^a  

^a IML CNRS   (France)

Author keywords

Consensus; Partitions; Simulation; Transfer distance

Indexed keywords

OPTIMIZATION;

CONSENSUS; CONSTRUCTIVE APPROACH; INTEGER LINEAR PROGRAMMING; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; SCORE FUNCTION; SIMULATION; SYMMETRIC DIFFERENCE; TRANSFER DISTANCE;

INTEGER PROGRAMMING;

EID: 80052050839     PISSN: 18625347     EISSN: 18625355     Source Type: Journal    
DOI: 10.1007/s11634-011-0087-6     Document Type: Article

References (22)

1. Barthélemy JP, Monjardet B (1981) The median procedure in cluster analysis and social choice. Theory Math Soc Sci 1: 235-268.
2. Barthélemy JP, Leclerc B (1995) The median procedure for partitions. DIMACS Ser Discret Math Theor Compu Sci 19: 3-34.
3. Brenac T (2002) Contribution des méthodes de partition centrale à la mise en evidence expérimentale de catégories cognitives. INRETS, Arcueil.
4. Celeux G, Diday E, Govaert G, Lechevalier Y, Ralambondrainy H (1989) Classification automatique des Données. Dunod, Paris.
5. Charon I, Denoeud L, Guénoche A, Hudry O (2006) Maximum transfer distance between partitions. J Classif 23(1): 103-121.
6. Day W (1981) The complexity of computing metric distances between partitions. Math Soc Sci 1: 269-287.
7. Denoeud L (2008) Transfer distance between partitions. Adv Data Anal Classif 2: 279-294.
8. Dubois D (1991) Sémantique et cognition-Catégories, prototypes et typicalité. Edition du CNRS, Paris.
9. Filkov V, Skiena S (2003) Integrating microarray data by consensus clustering. In: Proceedings of International Conference on Tools with Artificial Intelligence (ICTAI), pp 418-425.
10. Grötschel M, Wakabayashi Y (1989) A cutting plan algorithm for a clustering problem. Math Program 45: 59-96.
11. Guénoche A (2010) Bootstrap clustering for graph partitioning. MARAMI proceedings (submitted).
12. Gusfield D (2002) Partition-distance. Inf Process Lett 82(3): 159-164.
13. Jain AK, Moreau JV (1987) Bootstrap technique in cluster analysis. Pattern Recognit 20(5): 547-568.
14. Krivanek M, Moravek J (1986) NP-hard problems in hierarchical-tree clustering. Acta Informatica 23: 311-323.
15. Leclerc B (1984) Efficient and binary consensus functions on transitively valued relations. Math Soc Sci 8: 45-61.
16. Mirkin BG (1975) On the problem of reconciling partitions. In: Quantitative Sociology. Academic Press, New York, pp 441-449.
17. Monjardet B (1990) Arrowian characterization of latticial federation consensus functions. Math Soc Sci 20: 51-71.
18. Newman ME (2004) A fast algorithm for detecting community structure in networks. Phys Rev E Stat Nonlin Soft Matter Phys 69: 066133.
19. Nijenhuis A, Wilf H (1978) Combinatorial algorithms. Academic Press, New York.
20. Pinto da Costa JF, Rao PR (2004) Central partition for a partition-distance and strong pattern graph. REVSTAT 2(2): 128-143.
21. Régnier S (1965) Sur quelques aspects mathématiques des problèmes de classification automatique. Mathématiques et Sciences humaines 82: 1983, 13-29 (reprint of I. C. C. bulletin 4: 1965, 175-191).
22. Zahn CT (1964) Approximating symmetric relations by equivalence relations. SIAM J Appl Math 12: 840-847.