The median procedure in cluster analysis and social choice theory

DOI10.1016/0165-4896(81)90041-XzbMath0486.62057OpenAlexW2122451634MaRDI QIDQ1164937

Bernard Monjardet, Jean-Pierre Barthelemy

Publication date: 1981

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(81)90041-x

zbMATH Keywords

aggregation distance median cluster analysis axiomatic characterizations Arrow-like properties

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to social sciences (62P25) Individual preferences (91B08) Social choice (91B14) Mathematical sociology (including anthropology) (91D99) Ordered sets (06Axx)

Related Items

Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures, Graphs with $G^p$-connected medians, Solving the Kemeny ranking aggregation problem with quantum optimization algorithms, Medians for weight metrics in the covering graphs of semilattices, The median procedure in the semilattice of orders, Medians and majorities in semimodular posets, Axioms for consensus functions based on lower bounds in posets, Social compromise and social metrics, Consensus functions and patterns in molecular sequences, Neutral consensus functions, An ABC-problem for location and consensus functions on graphs, Metric rationalisation of social choice functions according to principles of social choice, Approximate and dynamic rank aggregation, Preferences, agreement, consensus -- measuring, aggregation and control --, 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 median rule in judgement aggregation, Computing median and antimedian sets in median graphs, New results on the computation of median orders, The structure of the overhanging relations associated with some types of closure systems, On the use of ordered sets in problems of comparison and consensus of classifications, Consistency without neutrality in voting rules: When is a vote an average?, A survey on the linear ordering problem for weighted or unweighted tournaments, Relationships Between $l^1 $ Metrics on Rankings: The Case of Ties, Unnamed Item, Induced social welfare functions, The median function on Boolean lattices, Axiomatization and the antimean function on paths, Epistemic democracy with correlated voters, A multifacility location problem on median spaces, Voting schemes for which it can be difficult to tell who won the election, A cutting plane algorithm for a clustering problem, Concordance between two linear orders: The Spearman and Kendall coefficients revisited, Steiner intervals in graphs, Principal classifications analysis: a method for generating consensus dendrograms and its application to three-way data., Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties, A statistical view of clustering performance through the theory of $U$-processes, The median procedure on median graphs, The Condorcet set: majority voting over interconnected propositions, A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings, Median sets and median number of a graph, A distance measure for choice functions, A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives, Maximum distance between Slater orders and Copeland orders of tournaments, Metrics on partially ordered sets - a survey, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, The presence of lattice theory in discrete problems of mathematical social sciences. Why., On the computation of median linear orders, of median complete preorders and of median weak orders, Voting with rubber bands, weights, and strings, Arrow's theorem is not a surprising result, The geometry of voting power: weighted voting and hyper-ellipsoids, A method for aggregating ordinal assessments by a majority decision rule, Median problem in some plane triangulations and quadrangulations., A converse to the Sholander embedding, Assent-maximizing social choice, Voting rules as statistical estimators, Voting Procedures, Complexity of, Optimal clustering of multipartite graphs, The ℓ_p‐function on trees, The center function on trees, Axiomatic characterization of the center function. The case of non-universal axioms, Consensus sequences based on plurality rule, Lattice valuations, medians and majorities, Unnamed Item, Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach, Interpreting consensus sequences based on plurality rule, Consensus of partitions: a constructive approach, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Noising methods for a clique partitioning problem, NP-hardness results for the aggregation of linear orders into median orders, Median linear orders: Heuristics and a branch and bound algorithm, Thresholded consensus for n-trees, Convex geometry and group choice, The role of complexity in comparing classifications, AXIOMATIC CHARACTERIZATION OF THE MEAN FUNCTION ON TREES, Facets of the clique partitioning polytope, On the semilattice of weak orders of a set, Ein Subgradientenverfahren zur Klassifikation qualitativer Daten, The median procedure for n-trees, On lattice consensus methods, Self-tuning of the noising methods, Random generation of tournaments and asymmetric graphs with given out-degrees, Majority rule in the absence of a majority, Application of the “descent with mutations” metaheuristic to a clique partitioning problem, A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis, A survey on the complexity of tournament solutions, On the complexity of Slater's problems, Consensus functions defined on trees, Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem, Medians in median graphs, Analyse qualitativer Daten: Einführung und Übersicht. I, Faithful consensus methods for n-trees, On the information about individual utilities used in social choice, Five axioms for location functions on median graphs, A formalization of consensus index methods, Complexity results for extensions of median orders to different types of remoteness, THE MEDIAN FUNCTION ON TREES, The noising method: A new method for combinatorial optimization, Single or Multiple Consensus for Linear Orders, Computing a median point of a simple rectilinear polygon, Axiomatic characterization of the center function. the case of universal axioms

Cites Work