An order theoretic framework for overlapping clustering

DOI10.1016/0012-365X(94)00105-RzbMath0832.92032MaRDI QIDQ1344610

Hans-Jürgen Bandelt, Andreas W. M. Dress

Publication date: 5 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cluster analysisisotone mappingfinite partially ordered setconformity of hypergraphsdegree of overlappinginternal degree of dissimilarity

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Combinatorics of partially ordered sets (06A07) Structure and representation theory of distributive lattices (06D05)

Related Items

Pyramids and weak hierarchies in the ordinal model for clustering, The \(k\)-weak hierarchical representations: An extension of the indexed closed weak hierarchies, Triadic distance models: axiomatization and least squares representation, Functorial hierarchical clustering with overlaps, On critical sets of a finite Moore family, Cluster structures and collections of Galois closed entity subsets, Combinatorial optimisation and hierarchical classifications, Description-meet compatible multiway dissimilarities, Multilevel clustering models and interval convexities, Axiomatic characterization of transit functions of weak hierarchies, Analyzing and visualizing sequence and distance data using SPLITSTREE, Set relations and set systems induced by some families of integral domains, Set systems and dissimilarities, Quasi-ultrametrics and their \(2\)-ball hypergraphs, Recognizing treelike \(k\)-dissimilarities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The tensor product of continuous lattices
• The edge intersection graphs of paths in a tree
• Ordinal and percentile clustering
• The theory of convex geometries
• Weak hierarchies associated with similarity measures - An additive clustering technique
• A set-theoretical approach to the problem of hierarchical clustering
• A duality between fuzzy and percentile clustering
• The structure of Galois connections
• Les isomorphismes HTS et HTE. (The HTS and HTE isomorphisms)
• Applications des isomorphismes HTS et HTE. (Vers la classification arboree). (Applications of the HTS and HTE isomorphisms. (Towards a free classification))
• Some Aspects of Clustering Functions
• Relations, coverings, hypergraphs and matroids