The complete linkage clustering algorithm revisited

Authors:
P. Dawyndt;H. De Meyer;B. De Baets
Affiliations:
Laboratory of Microbiology, Ghent University, Ledeganckstraat 35, B-9000, Gent, Belgium;Dept. of Applied Mathematics and Computer Science, Ghent University, Krijgslaan 281 (S9), B-9000, Gent, Belgium;Dept. of Applied Mathematics, Biometrics and Process Control, Ghent University, Coupure links 653, B-9000, Gent, Belgium
Venue:
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Year:
2005

Citing 0
Cited 7

Computing a T-transitive lower approximation or opening of a proximity relation

Fuzzy Sets and Systems
Equivalent bipolar fuzzy relations

Fuzzy Sets and Systems
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations

Fuzzy Sets and Systems
An algorithm for generating consistent and transitive approximations of reciprocal preference relations

IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Finite-valued indistinguishability operators

International Journal of Approximate Reasoning
Computing a transitive opening of a reflexive and symmetric fuzzy relation

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Fuzzy relation equations and subsystems of fuzzy transition systems

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new algorithm for generating a symmetric min-transitive opening of a similarity relation is proposed. Since min-transitive similarity relations are in one-to-one correspondence to hierarchical partition trees, our algorithm can be compared to certain classical clustering algorithms. The new algorithm is efficient and the generated opening is in practical situations usually closer to the original relation than are the openings generated by other algorithms. Various tests illustrate the obtained results.