The LINEX Weighted k-Means Clustering

被引:0
|
作者
Narges Ahmadzadehgoli
Adel Mohammadpour
Mohammad Hassan Behzadi
机构
[1] Islamic Azad University,Department of Statistics, Science and Research Branch
[2] Amirkabir University of Technology (Tehran Polytechnic),Department of Statistics, Faculty of Mathematics & Computer Science
来源
Journal of Statistical Theory and Applications | 2019年 / 18卷
关键词
LINEX loss function; Feature weights; Weighted k-means; Clustering;
D O I
暂无
中图分类号
学科分类号
摘要
LINEX weighted k-means is a version of weighted k-means clustering, which computes the weights of features in each cluster automatically. Determining which entity is belonged to which cluster depends on the cluster centers. In this study, the asymmetric LINEX loss function is used to compute the dissimilarity in the weighted k-means clustering. So, the cluster centroids are obtained by minimizing a LINEX based cost function. This loss function is used as a dissimilarity measure in clustering when one wants to overestimate or underestimate the cluster centroids, which helps to reduce some errors of misclassifying entities. Therefore, we discuss the LINEX weighted k-means algorithm. We examine the accuracy of the algorithm with some synthetic and real datasets.
引用
收藏
页码:147 / 154
页数:7
相关论文
共 50 条
  • [41] Unsupervised K-Means Clustering Algorithm
    Sinaga, Kristina P.
    Yang, Miin-Shen
    IEEE ACCESS, 2020, 8 : 80716 - 80727
  • [42] Dynamic Incremental K-means Clustering
    Aaron, Bryant
    Tamir, Dan E.
    Rishe, Naphtali D.
    Kandel, Abraham
    2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI), VOL 1, 2014, : 308 - 313
  • [43] An Enhancement of K-means Clustering Algorithm
    Gu, Jirong
    Zhou, Jieming
    Chen, Xianwei
    2009 INTERNATIONAL CONFERENCE ON BUSINESS INTELLIGENCE AND FINANCIAL ENGINEERING, PROCEEDINGS, 2009, : 237 - 240
  • [44] Improvement of K-means Clustering algorithm with better initial centroids based on weighted average
    Mahmud, Md. Sohrab
    Rahman, Md. Mostafizer
    Akhtar, Md. Nasim
    2012 7TH INTERNATIONAL CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (ICECE), 2012,
  • [45] Under-sampling Algorithm with Weighted Distance Based on Adaptive K-Means Clustering
    Qian Z.
    Zhen Y.
    Bo S.
    Data Analysis and Knowledge Discovery, 2022, 6 (05) : 127 - 136
  • [46] Debiasing weighted multi-view k-means clustering based on causal regularization
    Huang, Xiuqi
    Tao, Hong
    Ni, Haotian
    Hou, Chenping
    PATTERN RECOGNITION, 2025, 160
  • [47] Global k-means plus plus : an effective relaxation of the global k-means clustering algorithm
    Vardakas, Georgios
    Likas, Aristidis
    APPLIED INTELLIGENCE, 2024, 54 (19) : 8876 - 8888
  • [48] TW-Co-k-means: Two-level weighted collaborative k-means for multi-view clustering
    Zhang, Guang-Yu
    Wang, Chang-Dong
    Huang, Dong
    Zheng, Wei-Shi
    Zhou, Yu-Ren
    KNOWLEDGE-BASED SYSTEMS, 2018, 150 : 127 - 138
  • [49] A Comparative Study of K-Means, K-Means plus plus and Fuzzy C-Means Clustering Algorithms
    Kapoor, Akanksha
    Singhal, Abhishek
    2017 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE & COMMUNICATION TECHNOLOGY (CICT), 2017,
  • [50] Fast K-means for Large Scale Clustering
    Hu, Qinghao
    Wu, Jiaxiang
    Bai, Lu
    Zhang, Yifan
    Cheng, Jian
    CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 2099 - 2102