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 条
  • [21] Random Projection for k-means Clustering
    Sieranoja, Sami
    Franti, Pasi
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, ICAISC 2018, PT I, 2018, 10841 : 680 - 689
  • [22] A notion of stability for k-means clustering
    Le Gouic, T.
    Paris, Q.
    ELECTRONIC JOURNAL OF STATISTICS, 2018, 12 (02): : 4239 - 4263
  • [23] The MinMax k-Means clustering algorithm
    Tzortzis, Grigorios
    Likas, Aristidis
    PATTERN RECOGNITION, 2014, 47 (07) : 2505 - 2516
  • [24] Feature weighting in k-means clustering
    Modha, DS
    Spangler, WS
    MACHINE LEARNING, 2003, 52 (03) : 217 - 237
  • [25] Importance of Initialization in K-Means Clustering
    Gupta, Anubhav
    Tomer, Antriksh
    Dahiya, Sonika
    2022 SECOND INTERNATIONAL CONFERENCE ON ADVANCES IN ELECTRICAL, COMPUTING, COMMUNICATION AND SUSTAINABLE TECHNOLOGIES (ICAECT), 2022,
  • [26] K-Means Divide and Conquer Clustering
    Khalilian, Madjid
    Boroujeni, Farsad Zamani
    Mustapha, Norwati
    Sulaiman, Md. Nasir
    2009 INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING, PROCEEDINGS, 2009, : 306 - 309
  • [27] Global optimality in k-means clustering
    Tirnauca, Cristina
    Gomez-Perez, Domingo
    Balcazar, Jose L.
    Montana, Jose L.
    INFORMATION SCIENCES, 2018, 439 : 79 - 94
  • [28] Locality Sensitive K-means Clustering
    Liu, Chlen-Liang
    Hsai, Wen-Hoar
    Chang, Tao-Hsing
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2018, 34 (01) : 289 - 305
  • [29] Modified k-Means Clustering Algorithm
    Patel, Vaishali R.
    Mehta, Rupa G.
    COMPUTATIONAL INTELLIGENCE AND INFORMATION TECHNOLOGY, 2011, 250 : 307 - +
  • [30] An ellipsoidal K-means for document clustering
    Dzogang, Fabon
    Marsala, Christophe
    Lesot, Marie-Jeanne
    Rifqi, Maria
    12TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2012), 2012, : 221 - 230