CONSTRUCTING OPTIMAL ULTRAMETRICS

被引:4
作者
SRIRAM, N [1 ]
机构
[1] AT&T BELL LABS,MURRAY HILL,NJ 07974
关键词
CLUSTERING; GRAPH; HEURISTIC; HIERARCHICAL; SIMULATION;
D O I
10.1007/BF02626093
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Clique optimization (CLOPT) is a family of graph clustering procedures that construct parsimonious ultrametrics by executing a sequence of divisive and agglomerative operations. Every CLOPT procedure is associated with a distinct graph-partitioning heuristic. Seven HCS methods, a mathematical programming algorithm, and two CLOPT heuristics were evaluated on simulated data. These data were obtained by distorting ultrametric partitions and hierarchies. In general, internally optimal models yielded externally optimal models. By recovering near-optimal solutions more consistently, CLOPT2 emerged as the most robust technique.
引用
收藏
页码:241 / 268
页数:28
相关论文
共 50 条
  • [21] A fast algorithm for constructing sparse Euclidean spanners
    Das, G
    Narasimham, G
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1997, 7 (04) : 297 - 315
  • [22] Faster Algorithms for Constructing a Concept (Galois) Lattice
    Choi, Vicky
    [J]. CLUSTER CHALLENGES IN BIOLOGICAL NETWORKS, 2009, : 169 - 186
  • [23] On the breakage function for constructing the fragment replacement modes
    Zhou, Wei
    Xu, Kun
    Ma, Gang
    Chang, Xiaolin
    [J]. PARTICUOLOGY, 2019, 44 : 207 - 217
  • [24] Constructing model credibility in the context of policy appraisal
    Aumann, Craig A.
    [J]. ENVIRONMENTAL MODELLING & SOFTWARE, 2011, 26 (03) : 258 - 265
  • [25] Constructing the moral geographies of educational dark tourism
    Dresler, Emma
    Fuchs, Jochen
    [J]. JOURNAL OF MARKETING MANAGEMENT, 2021, 37 (5-6) : 548 - 568
  • [26] Constructing storyboards based on hierarchical clustering analysis
    Hasebe, S
    Sami, MM
    Muramatsu, S
    Kikuchi, H
    [J]. VISUAL COMMUNICATIONS AND IMAGE PROCESSING 2005, PTS 1-4, 2005, 5960 : 437 - 445
  • [27] Constructing Multiple Frames of Discernment for Multiple Subproblems
    Schubert, Johan
    [J]. INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS: THEORY AND METHODS, PT 1, 2010, 80 : 189 - 198
  • [28] CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION
    Kamil, I. A. K.
    Sudani, H. H. K.
    Lobov, A. A.
    Abrosimov, M. B.
    [J]. PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2020, (48): : 82 - 92
  • [29] A Graphical Framework for Constructing and Executing Computational Networks
    Hall, Christopher L.
    Schmidt, Vincent A.
    [J]. PROCEEDINGS OF THE IEEE 2010 NATIONAL AEROSPACE AND ELECTRONICS CONFERENCE (NAECON), 2010, : 240 - 245
  • [30] Constructing backbone network by using tinker algorithm
    He, Zhiwei
    Zhan, Meng
    Wang, Jianxiong
    Yao, Chenggui
    [J]. FRONTIERS OF PHYSICS, 2017, 12 (06) : 1 - 15