On the use of ordered sets in problems of comparison and consensus of classifications
From MaRDI portal
(Redirected from Publication:1104668)
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)
Cites work
- scientific article; zbMATH DE number 3643317 (Why is no real title available?)
- scientific article; zbMATH DE number 3645097 (Why is no real title available?)
- scientific article; zbMATH DE number 3650616 (Why is no real title available?)
- scientific article; zbMATH DE number 3854180 (Why is no real title available?)
- scientific article; zbMATH DE number 3898256 (Why is no real title available?)
- scientific article; zbMATH DE number 3903773 (Why is no real title available?)
- scientific article; zbMATH DE number 3906496 (Why is no real title available?)
- scientific article; zbMATH DE number 3951816 (Why is no real title available?)
- scientific article; zbMATH DE number 3693319 (Why is no real title available?)
- scientific article; zbMATH DE number 3747198 (Why is no real title available?)
- scientific article; zbMATH DE number 3470465 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 3228308 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3329034 (Why is no real title available?)
- scientific article; zbMATH DE number 3420808 (Why is no real title available?)
- A Consistent Extension of Condorcet’s Election Principle
- A formalization of consensus index methods
- A model in partial orders for comparing objects by dualistic measures
- A note on two problems in connexion with graphs
- An Order Theoretic Model for Cluster Analysis
- Axioms for consensus functions on undirected phylogenetic trees
- Comparison of phylogenetic trees
- Consensus functions defined on trees
- Consensus n-trees
- Data analysis implications of some concepts related to the cuts of a graph
- Distances between trees
- Efficient and binary consensus functions on transitively valued relations
- Every finite lattice can be embedded in a finite partition lattice
- Extremes in the Complexity of Computing Metric Distances Between Partitions
- Faithful consensus methods for n-trees
- From copair hypergraphs to median graphs with latent vertices
- Hierarchical analysis: Classification with ordinal object dissimilarities
- Hierarchical clustering schemes
- Measurement of the distance between distinct partitions of a finite set of objects
- Medians in median graphs
- Medians, Lattices, and Trees
- Metrics on partially ordered sets - a survey
- Metrics on spaces of finite trees
- Multidimensional scaling of measures of distance between partitions
- Optimal algorithms for comparing trees with labeled leaves
- Social choice and individual values
- The comparison and fitting of given classification schemes
- The complexity of computing metric distances between partitions
- The median procedure for n-trees
- The median procedure in cluster analysis and social choice theory
- The probabilities of rooted tree-shapes generated by random bifurcation
- The role of complexity in comparing classifications
- Theorie De La Mediane Dans Les Treillis Distributes Finis Et Applications
- s-consensus trees and indices
Cited in
(62)- 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)
- Lattice valuations, medians and majorities
- Comments on ``Aggregation of equivalence relations by P. C. Fishburn and A. Rubinstein
- Separability and aggregation of equivalence relations
- The median function on graphs with bounded profiles
- On the Classification of Deterministic Objects via Set Agreement Power
- On the metrization of the infinite partition lattice
- An algebraic setting for near-unanimity consensus
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- Non-bossy social classification
- A dimension-related metric on the lattice of knowledge spaces
- Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
- 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
- Thresholded consensus for n-trees
- The pruning-grafting lattice of binary trees
- Algorithms for strategyproof classification
- Planar graded lattices and the \(c_1\)-median property
- Partial cubes and their \(\tau\)-graphs
- Comparing classification tree structures: A special case of comparingq-ary relations II
- Metric inference for social networks
- Non-manipulable partitioning
- Consensus functions on trees that satisfy an independence axiom
- scientific article; zbMATH DE number 3903773 (Why is no real title available?)
- scientific article; zbMATH DE number 3903777 (Why is no real title available?)
- scientific article; zbMATH DE number 4167784 (Why is no real title available?)
- Community standards
- The median procedure on median graphs
- Graph aggregation
- Arrowian characterizations of latticial federation consensus functions
- Fuzzy partition models for fitting a set of partitions
- Medians for weight metrics in the covering graphs of semilattices
- Arrangements of minimal variance -- multidimensional scaling in the symmetrical case
- The structure of the overhanging relations associated with some types of closure systems
- A converse to the Sholander embedding
- Piecewise hierarchical clustering
- ``I want to be a J!: Liberalism in group identification problems
- n-median semilattices
- The median function on distributive 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
- A multifacility location problem on median spaces
- The center function on trees
- 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
- Graphs with \(G^p\)-connected medians
- 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)
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
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)
