The complete linkage clustering algorithm revisited

被引：0
|
作者：
H. De P. Dawyndt
B. De Meyer
机构：
[1] Ghent University,Laboratory of Microbiology
[2] Ghent University,Dept. of Applied Mathematics and Computer Science
[3] Ghent University,Dept. of Applied Mathematics, Biometrics and Process Control
来源：
Soft Computing | 2005年 / 9卷
关键词：
Hierarchical clustering; Similarity-based clustering; Similarity relation; Transitive opening; Transitivity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：385 / 392
页数：7
相关论文
共 50 条
  • [1] The complete linkage clustering algorithm revisited
    Dawyndt, P
    De Meyer, H
    De Baets, B
    SOFT COMPUTING, 2005, 9 (05) : 385 - 392
  • [2] A Greedy Algorithm for Hierarchical Complete Linkage Clustering
    Althaus, Ernst
    Hildebrandt, Andreas
    Hildebrandt, Anna Katharina
    ALGORITHMS FOR COMPUTATIONAL BIOLOGY, 2014, 8542 : 25 - 34
  • [3] A Complete Linkage Algorithm for Clustering Dynamic Datasets
    Banerjee, Payel
    Chakrabarti, Amlan
    Ballabh, Tapas Kumar
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES INDIA SECTION A-PHYSICAL SCIENCES, 2024, : 471 - 486
  • [4] Fast Algorithms for Complete Linkage Clustering
    D. Krznaric
    C. Levcopoulos
    Discrete & Computational Geometry, 1998, 19 : 131 - 145
  • [5] Fast algorithms for complete linkage clustering
    Krznaric, D
    Levcopoulos, C
    DISCRETE & COMPUTATIONAL GEOMETRY, 1998, 19 (01) : 131 - 145
  • [6] Efficient Record Linkage Algorithms Using Complete Linkage Clustering
    Mamun, Abdullah-Al
    Aseltine, Robert
    Rajasekaran, Sanguthevar
    PLOS ONE, 2016, 11 (04):
  • [7] COMPLETE LINKAGE AS A MULTIPLE STOPPING RULE FOR SINGLE LINKAGE CLUSTERING
    GLASBEY, CA
    JOURNAL OF CLASSIFICATION, 1987, 4 (01) : 103 - 109
  • [8] Noise clustering algorithm revisited
    Dave, RN
    Sen, S
    1997 ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY - NAFIPS, 1997, : 199 - 204
  • [9] ROBUST MEAN-VARIANCE PORTFOLIO SELECTION WITH WARD AND COMPLETE LINKAGE CLUSTERING ALGORITHM
    La Gubu
    Rosadi, Dedi
    Abdurakhman
    ECONOMIC COMPUTATION AND ECONOMIC CYBERNETICS STUDIES AND RESEARCH, 2020, 54 (03): : 111 - 127
  • [10] Improved Analysis of Complete-Linkage Clustering
    Grosswendt, Anna
    Roeglin, Heiko
    ALGORITHMICA, 2017, 78 (04) : 1131 - 1150
12345