Combining Multiple K-Means Clusterings of Chemical Structures Using Cluster-Based Similarity Partitioning Algorithm

被引：0
|
作者：
Saeedi, Faisal [1 ,2 ]
Salim, Naomie [1 ]
Abdo, Ammar [3 ]
Hentabli, Hamza [1 ]
机构：
[1] Univ Teknol Malaysia, Fac Comp Sci & Informat Syst, Johor Baharu, Johor, Malaysia
[2] Dept Informat Technol, Sanhan Community Coll, Sanaa, Yemen
[3] Hodeidah Univ, Dept Comp Sci, Hodeidah, Yemen
来源：
ADVANCED MACHINE LEARNING TECHNOLOGIES AND APPLICATIONS | 2012年 / 322卷
关键词：
2D Fingerprint; Compound Selection; Consensus Clustering; K-Means; Molecular Datasets; Ward's Method; DATA FUSION; COMBINATION;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Consensus clustering methods have been used in many areas to improve the quality of individual clusterings. In this paper, graph-based consensus clustering, Cluster-based Similarity Partitioning Algorithm (CSPA), was used to improve the quality of chemical structures clustering by enhancing the ability to separate active from inactive molecules in each cluster and improve the robustness and stability of individual clusterings. The clustering was evaluated using Quality Partition Index (QPI) measure and the results were compared with the Ward's clustering method. The chemical dataset MDL Drug Data Report (MDDR) database was used for experiments. The results obtained by combining multiple K-means clusterings showed that graph-based consensus clustering, CSPA, can improve the quality of individual chemical structure clusterings.
引用
收藏
页码：304 / +
页数：3
相关论文
共 50 条
  • [41] An efficient data stream outliers detection algorithm based on k-means partitioning
    College of Computer Science and Engineering, Southeast University, Nanjing 210096, China
    Jisuanji Yanjiu yu Fazhan, 2006, 9 (1639-1643):
  • [42] An efficient global K-means clustering algorithm based on weighted space partitioning
    Qu F.-H.
    Pan Y.-T.
    Yang Y.
    Hu Y.-T.
    Song J.-F.
    Wei C.-Y.
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2024, 54 (05): : 1393 - 1400
  • [43] An efficient k-means clustering filtering algorithm using density based initial cluster centers
    Kumar, K. Mahesh
    Reddy, A. Rama Mohan
    INFORMATION SCIENCES, 2017, 418 : 286 - 301
  • [44] WLSMB Halftoning Based on Improved K-means Cluster Algorithm Using Direct Binary Search
    He Zifen
    Zhan Zhaolin
    Zhang Yinhui
    2013 FIFTH INTERNATIONAL CONFERENCE ON MEASURING TECHNOLOGY AND MECHATRONICS AUTOMATION (ICMTMA 2013), 2013, : 1310 - 1313
  • [45] Parallel combination of genetic algorithm and ant algorithm based on dynamic K-means cluster
    Ding, Jianli
    Tang, Wansheng
    Wang, Liuqing
    COMPUTATIONAL INTELLIGENCE, PT 2, PROCEEDINGS, 2006, 4114 : 825 - 830
  • [46] A novel similarity classifier with multiple ideal vectors based on k-means clustering
    Lohrmann, Christoph
    Luukka, Pasi
    DECISION SUPPORT SYSTEMS, 2018, 111 : 27 - 37
  • [47] Selection of cluster hierarchy depth in hierarchical clustering using K-means algorithm
    Lee, Shinwon
    Lee, Wonhee
    Chung, Sungjong
    An, Dongun
    Bok, Ingeun
    Ryu, Hongjin
    2007 INTERNATIONAL SYMPOSIUM ON INFORMATION TECHNOLOGY CONVERGENCE, PROCEEDINGS, 2007, : 27 - +
  • [48] A Linear Time-Complexity k-means Algorithm using Cluster Shifting
    Pakhira, Malay K.
    2014 6TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMMUNICATION NETWORKS, 2014, : 1047 - 1051
  • [49] Using Genetic Algorithm for Selection of Initial Cluster Centers for the K-Means Method
    Kwedlo, Wojciech
    Iwanowicz, Piotr
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II, 2010, 6114 : 165 - 172
  • [50] Data Clustering with Cluster Size Constraints Using a Modified k-means Algorithm
    Ganganath, Nuwan
    Cheng, Chi-Tsun
    Tse, Chi K.
    2014 INTERNATIONAL CONFERENCE ON CYBER-ENABLED DISTRIBUTED COMPUTING AND KNOWLEDGE DISCOVERY (CYBERC), 2014, : 158 - 161
12345