On the use of ordered sets in problems of comparison and consensus of classifications

DOI10.1007/BF01894188zbMath0647.62056WikidataQ56335591 ScholiaQ56335591MaRDI QIDQ1104668

Bernard Monjardet, Bruno Leclerc, Jean-Pierre Barthelemy

Publication date: 1986

Published in: Journal of Classification (Search for Journal in Brave)

zbMATH Keywords

majority ruleaxiomatic approachordered treesclassification modelssemimodularityconstructive approachcomparison of classificationsordinal structuresconsensus of classificationsn-treesArrow-like characterization resultsBuneman treesleast-move metricsoptimization approachesoverview of results

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (54)

Medians for weight metrics in the covering graphs of semilattices ⋮ The median function on distributive semilattices ⋮ Medians and majorities in semimodular posets ⋮ Dictatorial consensus functions on \(n\)-trees ⋮ Two shortest path metrics on well-formed parentheses strings ⋮ Planar graded lattices and the \(c_1\)-median property ⋮ On the consistency of the plurality rule consensus function for molecular sequences ⋮ Metric inference for social networks ⋮ The pruning-grafting lattice of binary trees ⋮ ``I want to be a J!: Liberalism in group identification problems ⋮ The structure of the overhanging relations associated with some types of closure systems ⋮ Comments on ``Aggregation of equivalence relations by P. C. Fishburn and A. Rubinstein ⋮ Induced social welfare functions ⋮ A multifacility location problem on median spaces ⋮ Partial cubes and their \(\tau\)-graphs ⋮ Strategy-proof partitioning ⋮ The median procedure on median graphs ⋮ Rules for aggregating information ⋮ Graphs with \(G^p\)-connected medians ⋮ On the metrization of the infinite partition lattice ⋮ Non-bossy social classification ⋮ Subquadratic-time algorithm for the diameter and all eccentricities on median graphs ⋮ A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ Community standards ⋮ Ordinal and percentile clustering ⋮ Separability and aggregation of equivalence relations ⋮ Arrangements of minimal variance -- multidimensional scaling in the symmetrical case ⋮ A dimension-related metric on the lattice of knowledge spaces ⋮ On an independence condition for consensus \(n\)-trees ⋮ A converse to the Sholander embedding ⋮ Piecewise hierarchical clustering ⋮ \(n\)-median semilattices ⋮ Aggregation of fuzzy preferences: A theoretic Arrow-like approach ⋮ Graph aggregation ⋮ The center function on trees ⋮ Lattice valuations, medians and majorities ⋮ Algorithms for strategyproof classification ⋮ The algebra of majority consensus ⋮ NP-hardness results for the aggregation of linear orders into median orders ⋮ Thresholded consensus for n-trees ⋮ Fuzzy partition models for fitting a set of partitions ⋮ The median function on graphs with bounded profiles ⋮ On semicube graphs ⋮ Right-arm rotation distance between binary trees ⋮ Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis ⋮ On the connections between statistical disclosure control for microdata and some artificial intelligence tools ⋮ Distance and consensus for preference relations corresponding to ordered partitions ⋮ Arrowian characterizations of latticial federation consensus functions ⋮ Asking infinite voters `who is a J?': group identification problems in \(\mathbb{N} \) ⋮ Consensus functions on trees that satisfy an independence axiom ⋮ Motzkin subposets and Motzkin geodesics in Tamari lattices. ⋮ NON-MANIPULABLE PARTITIONING ⋮ An algebraic setting for near-unanimity consensus

Cites Work

• A note on two problems in connexion with graphs
• The role of complexity in comparing classifications
• Metrics on spaces of finite trees
• Medians in median graphs
• Faithful consensus methods for n-trees
• s-consensus trees and indices
• From copair hypergraphs to median graphs with latent vertices
• Efficient and binary consensus functions on transitively valued relations
• Axioms for consensus functions on undirected phylogenetic trees
• A formalization of consensus index methods
• Optimal algorithms for comparing trees with labeled leaves
• A model in partial orders for comparing objects by dualistic measures
• Every finite lattice can be embedded in a finite partition lattice
• Hierarchical analysis: Classification with ordinal object dissimilarities
• Comparison of phylogenetic trees
• Consensus n-trees
• Metrics on partially ordered sets - a survey
• The median procedure in cluster analysis and social choice theory
• The complexity of computing metric distances between partitions
• Data analysis implications of some concepts related to the cuts of a graph
• The comparison and fitting of given classification schemes
• The median procedure for n-trees
• Distances between trees
• Consensus functions defined on trees
• Hierarchical clustering schemes
• Measurement of the distance between distinct partitions of a finite set of objects
• Multidimensional scaling of measures of distance between partitions
• Extremes in the Complexity of Computing Metric Distances Between Partitions
• Theorie De La Mediane Dans Les Treillis Distributes Finis Et Applications
• An Order Theoretic Model for Cluster Analysis
• A Consistent Extension of Condorcet’s Election Principle
• The probabilities of rooted tree-shapes generated by random bifurcation
• Medians, Lattices, and Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the use of ordered sets in problems of comparison and consensus of classifications