Weak hierarchies associated with similarity measures - An additive clustering technique
A new useful and natural concept in cluster analysis is studied. Given a similarity measure on a set of subjects, a subset is regarded as a cluster if any two objects a,b inside this subset have greater similarity than any third object outside has to at least one of a,b. These clusters then form a closure system which can be described as a hypergraph without triangles. Conversely, given such a system, one may attach some weight to each cluster and then compose a similarity measure additively, by letting the similarity of a pair be the sum of weights of the clusters containing that particular pair. The original clusters can be reconstructed from the obtained similarity measure. This clustering model is thus located between the general additive clustering model of \textit{R. N. Shepard} and \textit{P. Arabie} [Psychol. Rev. 86, 87-123 (1979)] and the standard hierarchical model. Potential applications include fitting dendograms with few additional nonnested clusters and simultaneous representation of some families of multiple dendograms, as well as assisting the search for phylogenetic relationship by proposing a somewhat larger system of possibly relevant ``family groups, from which an appropriate choice remains to be made. So, the basic theory of weighted weak hierarchies is developed and the relationship to the general additive clustering model is investigated. The paper concludes with three illustrative applications and a short discussion.
- Consensus weak hierarchies
- n-median semilattices
- A canonical decomposition theory for metrics on a finite set
- An order theoretic framework for overlapping clustering
- Cluster analysis and mathematical programming
- Set systems and dissimilarities
- Quasi-ultrametrics and their \(2\)-ball hypergraphs
- A structured family of clustering and tree construction methods
- A simple method for generating additive clustering models with limited complexity
- Pyramids and weak hierarchies in the ordinal model for clustering
- Functorial hierarchical clustering with overlaps
- Multilevel clustering models and interval convexities
- A polynomial time algorithm for constructing the refined Buneman tree
- The conceptual weak hierarchy associated with a dissimilarity measure
- The k-weak hierarchical representations: An extension of the indexed closed weak hierarchies
- Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
- Arrow's Theorem for closed weak hierarchies
- Preservation of weak order equivalence
- Combinatorial optimisation and hierarchical classifications
- Sub-dominant theory in numerical taxonomy
- UPGMA clustering revisited: a weight-driven approach to transitive approximation
- Binary set systems and totally balanced hypergraphs
- The \(k\)-weak hierarchies: an extension of the weak hierarchical clustering structure
- scientific article; zbMATH DE number 4013782 (Why is no real title available?)
- `Bureaucratic' set systems, and their role in phylogenetics
- On encodings of phylogenetic networks of bounded level
- scientific article; zbMATH DE number 3992693 (Why is no real title available?)
- Parsimonious cluster systems
- On critical sets of a finite Moore family
- Axiomatic characterization of transit functions of weak hierarchies
- Totally Balanced Formal Context Representation
- Weak Hierarchies: A Central Clustering Structure
- Analyzing and visualizing sequence and distance data using SPLITSTREE
- An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering
- Crown-free lattices and their related graphs
- Split decomposition over an Abelian group. I: Generalities
- Transit functions and pyramid-like binary clustering systems
- Phylogenetic diversity indices from an affine and projective viewpoint
- An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex
- Transit functions and clustering systems
- Directed transit functions
- Totally balanced dissimilarities
- An algebraic setting for near-unanimity consensus
- Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis
- Binary clustering
- Cluster structures and collections of Galois closed entity subsets
This page was built for publication: Weak hierarchies associated with similarity measures - An additive clustering technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116591)
