UPGMA clustering revisited: a weight-driven approach to transitive approximation

DOI10.1016/j.ijar.2005.11.001zbMath1102.68544WikidataQ58800889 ScholiaQ58800889MaRDI QIDQ2506948

Peter Dawyndt, H. E. De Meyer, Bernard De Baets

Publication date: 10 October 2006

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2005.11.001

zbMATH Keywords

hierarchical clustering; transitivity; transitive approximation; similarity matrix; similarity-based clustering; UPGMA clustering

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

Related Items

Finite-valued indistinguishability operators, Computing a T-transitive lower approximation or opening of a proximity relation

Cites Work

• Unnamed Item
• Unnamed Item
• Special properties, closures and interiors of crisp and fuzzy relations
• Web mining with relational clustering
• Transitive approximation of fuzzy relations by alternating closures and openings
• On the existence and construction of \(T\)-transitive closures.
• Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
• Triangular norms as ordinal sums of semigroups in the sense of A. H. Clifford
• Combinatorial optimization and hierarchical classifications
• A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering
• Similarity relations and fuzzy orderings
• Efficient computation of transitive closures
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty