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

International Journal of Approximate Reasoning

Volumn 42, Issue 3, 2006, Pages 174-191

  Dawyndt, Peter ^a,b   De Meyer, Hans ^b   De Baets, Bernard ^b  

^a GHENT UNIVERSITY   (Belgium)

^b GHENT UNIVERSITY   (Belgium)

Author keywords

Hierarchical clustering; Similarity matrix; Similarity based clustering; Transitive approximation; Transitivity; UPGMA clustering

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL OPERATORS; NUMERICAL ANALYSIS;

HIERARCHICAL CLUSTERING; SIMILARITY MATRIX; SIMILARITY-BASED CLUSTERING; TRANSITIVE APPROXIMATION; TRANSITIVITY; UPGMA CLUSTERING;

HIERARCHICAL SYSTEMS;

EID: 33745392907     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2005.11.001     Document Type: Article

References (16)

1. Bandler W., and Kohout L. Special properties, closures and interiors of crisp and fuzzy relations. Fuzzy Sets and Systems 26 (1988) 317-331
2. Barthélemy J.-P., Brucker F., and Osswald C. Combinatorial optimization and hierarchical classifications. 4OR 2 (2004) 179-219
3. Calvo T., Kolésarová A., Komorní ková M., and Mesiar R. Aggregation operators: properties, classes and construction methods. Studies in Fuziness and Soft Computing vol. 7 (2002), Physica-Verlag, Heidelberg 3-104
4. De Baets B., and De Meyer H. Transitive approximation of fuzzy relations by alternating closures and openings. Soft Computing 7 (2003) 210-219
5. De Baets B., and De Meyer H. On the existence and construction of T-transitive closures. Information Science 152 (2003) 167-179
6. De Baets B., De Meyer H., and Naessens H. A top-down algorithm for generating the Hasse tree representation of the preorder closure of a fuzzy relation. IEEE Transactions on Fuzzy Systems 12 (2004) 838-848
7. De Meyer H., Naessens H., and De Baets B. Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. European Journal of Operational Research 155 (2004) 226-238
8. Dawyndt P., De Meyer H., and De Baets B. The complete linkage clustering algorithm revisited. Soft Computing 9 (2005) 385-392
9. Garmendia L., and Salvador A. Computing a transitive opening of a reflexive and symmetric fuzzy relation. Lecture Notes in Artificial Intelligence 3571 (2005) 587-599
10. Klement E., Mesiar R., and Pap E. Triangular Norms. Trends in Logic, Studia Logica Library vol. 8 (2000), Kluwer Academic Publishers, Dordrecht
11. Larsen H., and Yager R. Efficient computation of transitive closures. Fuzzy Sets and Systems 38 (1990) 81-90
12. Lin T., and Chiang I.-J. A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering. International Journal of Approximate Reasoning 40 (2005) 55-80
13. Naessens H., De Meyer H., and De Baets B. Algorithms for the computation of T-transitive closures. IEEE Transactions on Fuzzy Systems 10 (2002) 541-551
14. Runkler T., and Bezdek J. Web mining with relational clustering. International Journal of Approximate Reasoning 32 (2003) 217-236
15. Sneath P., and Sokal R. Numerical Taxonomy (1973), Freeman, San Francisco
16. Zadeh L. Similarity relations and fuzzy orderings. Information Science 3 (1971) 177-200