A novel clustering algorithm based on data transformation approaches

被引:23
作者
Azimi, Rasool [1 ]
Ghayekhloo, Mohadeseh [1 ]
Ghofrani, Mahmoud [2 ]
Sajedi, Hedieh [3 ]
机构
[1] Islamic Azad Univ, Qazvin Branch, Young Researchers & Elite Club, Qazvin, Iran
[2] Univ Washington, Sch Sci Technol Engn & Math STEM, Bothell, WA USA
[3] Univ Tehran, Dept Comp Sci, Coll Sci, Tehran, Iran
关键词
Data mining; Clustering; K-means; Data transformation; Silhouette; Transformed K-means;
D O I
10.1016/j.eswa.2017.01.024
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering provides a knowledge acquisition method for intelligent systems. This paper proposes a novel data-clustering algorithm, by combining a new initialization technique, K-means algorithm and a new gradual data transformation approach to provide more accurate clustering results than the K-means algorithm and its variants by increasing the clusters' coherence. The proposed data transformation approach solves the problem of generating empty clusters, which frequently occurs for other clustering algorithms. An efficient method based on the principal component transformation and a modified silhouette algorithm is also proposed in this paper to determine the number of clusters. Several different data sets are used to evaluate the efficacy of the proposed method to deal with the empty cluster generation problem and its accuracy and computational performance in comparison with other K-means based initialization techniques and clustering methods. The developed estimation method for determining the number of clusters is also evaluated and compared with other estimation algorithms. Significances of the proposed method include addressing the limitations of the K-means based clustering and improving the accuracy of clustering as an important method in the field of data mining and expert systems. Application of the proposed method for the knowledge acquisition in time series data such as wind, solar, electric load and stock market provides a pre-processing tool to select the most appropriate data to feed in neural networks or other estimators in use for forecasting such time series. In addition, utilization of the knowledge discovered by the proposed K-means clustering to develop rule based expert systems is one of the main impacts of the proposed method. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:59 / 70
页数:12
相关论文
共 30 条
[1]  
[Anonymous], 2007, P 18 ANN ACM SIAM S
[2]  
[Anonymous], 2009, P WORLD C ENG
[3]   Scalable K-Means++ [J].
Bahmani, Bahman ;
Moseley, Benjamin ;
Vattani, Andrea ;
Kumar, Ravi ;
Vassilvitskii, Sergei .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (07) :622-633
[4]   FCM - THE FUZZY C-MEANS CLUSTERING-ALGORITHM [J].
BEZDEK, JC ;
EHRLICH, R ;
FULL, W .
COMPUTERS & GEOSCIENCES, 1984, 10 (2-3) :191-203
[5]  
Calinski T., 1974, Commun StatTheory Methods, V3, P1, DOI DOI 10.1080/03610927408827101
[6]   A comparative study of efficient initialization methods for the k-means clustering algorithm [J].
Celebi, M. Emre ;
Kingravi, Hassan A. ;
Vela, Patricio A. .
EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (01) :200-210
[7]   Effectively clustering by finding density backbone based-on kNN [J].
Chen, Mei ;
Li, Longjie ;
Wang, Bo ;
Cheng, Jianjun ;
Pan, Lina ;
Chen, Xiaoyun .
PATTERN RECOGNITION, 2016, 60 :486-498
[8]   A new clustering algorithm based on near neighbor influence [J].
Chen, Xinquan .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (21) :7746-7758
[9]   Optimized big data K-means clustering using MapReduce [J].
Cui, Xiaoli ;
Zhu, Pingfei ;
Yang, Xin ;
Li, Keqiu ;
Ji, Changqing .
JOURNAL OF SUPERCOMPUTING, 2014, 70 (03) :1249-1259
[10]   CLUSTER SEPARATION MEASURE [J].
DAVIES, DL ;
BOULDIN, DW .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1979, 1 (02) :224-227