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

DOI10.1007/BF01894188zbMATH Open0647.62056WikidataQ56335591 ScholiaQ56335591MaRDI QIDQ1104668FDOQ1104668

Authors: Bruno Leclerc, Bernard Monjardet, J. P. Barthélemy 

Publication date: 1986

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

Recommendations

• scientific article; zbMATH DE number 3903773
• On lattice consensus methods
• Efficient and binary consensus functions on transitively valued relations
• scientific article; zbMATH DE number 4034892
• Croisements, ordres et ultramètriques: Application à la recherche de consensus en classification automatique. II. (Crossings, orders and ultrametrics: Application to the investigation of consensus in automatic classification)

zbMATH Keywords

majority rulesemimodularityordered treesclassification modelsaxiomatic approachconstructive 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)

Cites Work

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

Cited In (62)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104668)