An improved clustering algorithm for minimum spanning trees in multidimensional data

被引：0
|
作者：
Xie, Zhi-Qiang [1 ]
Yu, Liang [1 ]
Yang, Jing [2 ]
机构：
[1] College of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China
[2] College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China
来源：
Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University | 2008年 / 29卷 / 08期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：851 / 857
相关论文
共 50 条
  • [1] An Improved Algorithm for Clustering Gene Expression Data Using Minimum Spanning Trees
    Zhao, Weili
    Zhang, Zhiguo
    APPLIED MECHANICS AND MECHANICAL ENGINEERING, PTS 1-3, 2010, 29-32 : 2656 - +
  • [2] CLUSTERING WITH MINIMUM SPANNING TREES
    Zhou, Yan
    Grygorash, Oleksandr
    Hain, Thomas F.
    INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2011, 20 (01) : 139 - 177
  • [3] A clustering algorithm based on improved minimum spanning tree
    Xie, Zhiqiang
    Yu, Liang
    Yang, Jing
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 3, PROCEEDINGS, 2007, : 396 - +
  • [4] Hierarchical clustering in minimum spanning trees
    Yu, Meichen
    Hillebrand, Arjan
    Tewarie, Prejaas
    Meier, Jil
    van Dijk, Bob
    Van Mieghem, Piet
    Stam, Cornelis Jan
    CHAOS, 2015, 25 (02)
  • [5] An Improved Genetic Algorithm for Degree Constrained Minimum Spanning Trees
    Shi, Kai
    Song, Qingfeng
    Lin, Sheng
    Xu, Guangping
    Cao, Zhanxu
    PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 4603 - 4607
  • [6] Double-Valued Neutrosophic Sets, their Minimum Spanning Trees, and Clustering Algorithm
    Kandasamy, Ilanthenral
    JOURNAL OF INTELLIGENT SYSTEMS, 2018, 27 (02) : 163 - 182
  • [7] Clustering gene expression data with memetic algorithms based on minimum spanning trees
    Speer, N
    Merz, P
    Spieth, C
    Zell, A
    CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 1848 - 1855
  • [8] Clustering with Minimum Spanning Trees: How Good Can It Be?
    Gagolewski, Marek
    Cena, Anna
    Bartoszuk, Maciej
    Brzozowski, Lukasz
    JOURNAL OF CLASSIFICATION, 2025, 42 (01) : 90 - 112
  • [9] The Complexity and Algorithm for Minimum Expense Spanning Trees
    Zhan Ning
    Wu Longshu
    2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 118 - 122
  • [10] A faster deterministic algorithm for minimum spanning trees
    Chazelle, B
    38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 22 - 34
12345