The structure of the overhanging relations associated with some types of closure systems
Tóm tắt
Over many different kinds of cryptomorphisms equivalent with closure systems (and so with closure operators), we focus here on implication relations and the related overhanging relations, as introduced and axiomatized in a previous paper (Domenach and Leclerc, Math Soc Sci 47(3):349–366, 2004). In relation with data analysis motivations, we particularize the axioms on overhanging relations in order to account for some types of closure systems, such as nested or distributive ones. We also examine the lattice structure of overhanging relations, which is isomorphic to the lattice of closure systems, and derived structures for particular sets of overhangings.
Tài liệu tham khảo
Adams, E.N. III: Consensus techniques and the comparison of taxonomic trees. Syst. Zool. 21, 390–397 (1972)
Adams, E.N. III: N-trees as nestings: complexity, similarity and consensus. J. Classif. 3, 299–317 (1986)
Armstrong, W.W.: Dependency structures of data base relationships. Inf. Process. 74, 580–583 (1974)
Barbut, M., Monjardet, B.: Ordre et Classification, Algèbre et Combinatoire. Hachette, Paris (1970)
Barthélemy, J.-P., Monjardet, B.: The median procedure in cluster analysis and social choice theory. Math. Soc. Sci. 1(3), 235–238 (1981)
Barthélemy, J.-P., Leclerc, B., Monjardet, B.: Ensembles ordonnés et taxonomie mathématique. In: Pouzet, M., Richard, D. (eds.) Orders: Descriptions and Roles, Annals of Discrete Mathematics, 23, pp. 523–548. North-Holland, Amsterdam (1984)
Barthélemy, J.-P., Leclerc, B., Monjardet, B.: On the use of ordered sets in problems of comparison and consensus of classifications. J. Classif. 3(2), 187–224 (1986)
Blyth, T.S., Janowitz, M.F.: Residuation Theory. Pergamon, Oxford (1972)
Caspard, N., Monjardet, B.: The lattices of Moore families and closure operators on a finite set: a survey. Discrete Appl. Math. 127(2), 241–269 (2003)
Caspard, N., Monjardet, B.: The lattice of convex geometries. In: Nadif, M., Napoli, A., SanJuan, E., Sigayret, A. (eds.) Fourth International Conference Journées de l’Informatique Messine, Knowledge Discovery and Discrete Mathematics, pp. 105–113. INRIA, Rocquencourt (2003)
Day, W.H.E., McMorris, F.R.: Axiomatic Consensus Theory in Group Choice and Biomathematics. Frontiers in Applied Mathematics 29. SIAM, Philadelphia (2003)
Doignon, J.P., Koppen, M.: How to build a knowledge space by quering an expert. J. Math. Psychol. 34(3), 311–331 (1989)
Domenach, F., Leclerc, B.: Closure systems, implicational systems, overhanging relations and the case of hierarchical classification. Math. Soc. Sci. 47(3), 349–366 (2004)
Domenach, F., Leclerc, B.: Consensus of classification systems, with Adams’ results revisited. In: Banks, D., House, L., McMorris, F.R., Arabie, P., Gaul, W. (eds.) Classification, Clustering and Data Mining Applications, pp. 349–366. Springer, Berlin (2004)
Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Berlin (1999)
Guigues, J.L., Duquenne, V.: Familles minimales d’implications informatives résultant d’un tableau de données binaires. Math. Sci. Hum. 95, 5–18 (1986)
Leclerc, B.: The median procedure in the semilattice of orders. Discrete Appl. Math. 127(2), 285–302 (2003)
Monjardet, B.: The presence of lattice theory in discrete problems of mathematical social sciences, why? Math. Soc. Sci. 46(2), 103–144 (2003)
Muller, C.E.: A procedure for facilitating an expert’s jugdments on a set of rules. In: Degreef, E., Roskam, E.E. (eds.) Mathematical Psychology in Progress. Springer, Heidelberg (1989)
Plott, C.R.: Path independence, rationality and social choice. Econometrica 41(6), 1075–1091 (1973)
Raderanirina, V.: Treillis et agrégation de familles de Moore et de fonctions de choix. Ph.D. Thesis, University Paris 1 Panthéon-Sorbonne (2001)
Semple, C., Steel, M.A.: A supertree method for rooted trees. Discrete Appl. Math. 105, 147–158 (2000)
Vach, W.: Preserving consensus hierarchies. J. Classif. 11, 59–77 (1994)