Clustering algorithm of Gaussian mixture model based on density peaks

doi:10.11772/j.issn.1001-9081.2018040739

Journal of Computer Applications ›› 2018, Vol. 38 ›› Issue (12): 3433-3437.DOI: 10.11772/j.issn.1001-9081.2018040739

Previous Articles Next Articles

Clustering algorithm of Gaussian mixture model based on density peaks

TAO Zhiyong¹, LIU Xiaofang^1,2, WANG Hezhang¹

1. School of Electronic and Information Engineering, Liaoning Technical University, Huludao Liaoning 125105, China;
2. Fuxin Lixing Technology Company Limited, Fuxin Liaoning 123000, China

Received:2018-04-11 Revised:2018-06-11 Online:2018-12-10 Published:2018-12-15
Contact: 刘晓芳
Supported by:
This work is partially supported by the Doctoral Research Start Foundation of Liaoning Province (20170520098), the Natural Science Foundation of Liaoning Province (2015020100), the Research Project of Liaoning Provincial Higher Education Undergraduate Teaching Reform (551610001095), the General Project of Liaoning Provincial Education Department (LJ2017QL013).

融合密度峰值的高斯混合模型聚类算法

陶志勇¹, 刘晓芳^1,2, 王和章¹

1. 辽宁工程技术大学电子与信息工程学院, 辽宁葫芦岛 125105;
2. 阜新力兴科技有限责任公司, 辽宁阜新 123000

通讯作者: 刘晓芳
作者简介:陶志勇(1978-),男,黑龙江五大连池人,副教授,博士,CCF会员,主要研究方向:多媒体通信;刘晓芳(1995-),女,辽宁鞍山人,硕士研究生,主要研究方向:机器学习;王和章(1992-),男,河北邢台人,硕士研究生,主要研究方向:无线传感器网络、物联网。
基金资助:
辽宁省博士启动基金资助项目（20170520098）；辽宁省自然科学基金资助项目（2015020100）；辽宁省普通高等教育本科教学改革研究项目（551610001095）；辽宁省教育厅一般项目（LJ2017QL013）。

Abstract

Abstract: The clustering algorithm of Gaussian Mixture Model (GMM) is sensitive to initial value and easy to fall into local minimum. In order to solve the problems, taking advantage of strong global search ability of Density Peaks (DP) algorithm, the initial clustering center of GMM algorithm was optimized, and a new Clustering algorithm of GMM based on DP (DP-GMMC) was proposed. Firstly, the clustering center was searched by the DP algorithm to obtain the initial parameters of mixed model. Then, the Expectation Maximization (EM) algorithm was used to estimate the parameters of mixed model iteratively. Finally, the data points were clustered according to the Bayesian posterior probability criterion. In the Iris data set, the problem of dependence on the initial clustering center is solved, and the clustering accuracy of DP-GMMC can reach 96.67%, which is 33.6 percentage points higher than that of the traditional GMM algorithm. The experimental results show that, the proposd DP-GMMC has better clustering effect on low-dimensional datasets.

Key words: clustering, Gaussian Mixture Model (GMM), Expectation Maximization (EM) algorithm, Density Peak (DP)

摘要： 针对高斯混合模型（GMM）聚类算法对初始值敏感且容易陷入局部极小值的问题，利用密度峰值（DP）算法全局搜索能力强的优势，对GMM算法的初始聚类中心进行优化，提出了一种融合DP的GMM聚类算法（DP-GMMC）。首先，基于DP算法寻找聚类中心，得到混合模型的初始参数；其次，采用最大期望（EM）算法迭代估计混合模型的参数；最后，根据贝叶斯后验概率准则实现数据点的聚类。在Iris数据集下，DP-GMMC聚类准确率可达到96.67%，与传统GMM算法相比提高了33.6个百分点，解决了对初始聚类中心依赖的问题。实验结果表明，DP-GMMC对低维数据集有较好的聚类效果。

关键词: 聚类, 高斯混合模型, 最大期望算法, 密度峰值

CLC Number:

TP301.6

TAO Zhiyong, LIU Xiaofang, WANG Hezhang. Clustering algorithm of Gaussian mixture model based on density peaks[J]. Journal of Computer Applications, 2018, 38(12): 3433-3437.

陶志勇, 刘晓芳, 王和章. 融合密度峰值的高斯混合模型聚类算法[J]. 计算机应用, 2018, 38(12): 3433-3437.

References

[1] BOUYEYRON C, BRUNET S C. Model-based clustering of high-dimensional data:a review[J]. Computational Statistics & Data Analysis, 2014, 71(1):52-78.
[2] VINCET O R, MAKINDE A S, SALAKO O S, et al. A self-adaptive k-means classifier for business incentive in a fashion design environment[J]. Applied Computing and Informatics, 2018, 14(1):88-97.
[3] PAUL A, MAITY S P. Kernel fuzzy c-means clustering on energy detection based cooperative spectrum sensing[J]. Digital Communications and Networks, 2016, 2(4):196-205.
[4] WANG B Y, ZHANG J, LIU L, et al. Density peaks clustering based integrate framework for multi-document summarization[J]. CAAI Transactions on Intelligence Technology, 2017, 2(1):26-30.
[5] AMINI-SERESHT E, ZHANG Y. Stochastic comparisons on two finite mixture models[J]. Operations Research Letters, 2017, 45(5):475-480.
[6] YANG M S, LAI C Y. A robust EM clustering algorithm for Gaussian mixture models[J]. Pattern Recognition, 2012, 45(11):3950-3961.
[7] SARAVIA E F, LOUZADA F, MILAN L. Mixture models with an unknown number of components via a new posterior split-merge MCMC algorithm[J]. Applied Mathematics and Computation, 2014, 244(2):959-975.
[8] 崔玮,吴成东,张云洲,等.基于高斯混合模型的非视距定位算法[J].通信学报,2014,35(1):99-106.(CUI W, WU C D, ZHANG Y Z, et al. GMM-based localization algorithm under NLOS conditions[J]. Journal on Communications, 2014, 35(1):99-106.)
[9] 王垚,柴变芳,李文斌,等.一种基于逆模拟退火和高斯混合模型的半监督聚类算法[J].南京师大学报(自然科学版),2017,40(3):67-73.(WANG Y, CHAI B F, LI W B, et al. A semi-supervised clustering algorithm based on anti-annealing and Gaussian mixture model[J]. Journal of Nanjing Normal University (Natural Science Edition), 2017, 40(3):67-73.)
[10] SCRUCCA L. Identifying connected components in Gaussian finite mixture models for clustering[J]. Computational Statistics and Data Analysis, 2016, 93(C):5-17.
[11] LI J C, NEHORAI A. Gaussian mixture learning via adaptive hierarchical clustering[J]. Signal Processing, 2018, 150(1):116-121.
[12] LIU Z, SONG Y Q, XIE C H, et al. Clustering gene expression data analysis using an improved EM algorithm based on multivariate elliptical contoured mixture models[J]. Optik-International Journal for Light and Electron Optics, 2014, 125(21):6388-6394.
[13] LI Y, CHEN Y Y. Research on initialization on EM algorithm based on Gaussian mixture model[J]. Journal of Applied Mathematics & Physics, 2018, 6(1):11-17.
[14] RODRIGUEZ A, LAIO A. Clustering by fast search and find of density peaks[J].Science, 2014, 344(6191):1492-1496.
[15] OLSSON J, WESTERBORN J. An efficient particle-based online EM algorithm for general state-space models[J]. IFAC-PapersOnLine, 2015, 48(28):963-968.

Clustering algorithm of Gaussian mixture model based on density peaks

融合密度峰值的高斯混合模型聚类算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

[1]	CHEN Hengheng, NI Zhiwei, ZHU Xuhui, JIN Yuanyuan, CHEN Qian. Differential privacy high-dimensional data publishing method via clustering analysis [J]. Journal of Computer Applications, 2021, 41(9): 2578-2585.
[2]	ZHU Cheng, ZHAO Xiaoqi, ZHAO Liping, JIAO Yuhong, ZHU Yafei, CHENG Jianying, ZHOU Wei, TAN Ying. Classification of functional magnetic resonance imaging data based on semi-supervised feature selection by spectral clustering [J]. Journal of Computer Applications, 2021, 41(8): 2288-2293.
[3]	ZENG Xiangyin, ZHENG Bochuan, LIU Dan. Detection of left and right railway tracks based on deep convolutional neural network and clustering [J]. Journal of Computer Applications, 2021, 41(8): 2324-2329.
[4]	WANG Jiarui, TAN Guoping, ZHOU Siyuan. Clustered wireless federated learning algorithm in high-speed internet of vehicles scenes [J]. Journal of Computer Applications, 2021, 41(6): 1546-1550.
[5]	DAI Yanran, DAI Guoqing, YUAN Yubo. Multi-face foreground extraction method based on skin color learning [J]. Journal of Computer Applications, 2021, 41(6): 1659-1666.
[6]	MA Jianhong, CAO Wenbin, LIU Yuangang, XIA Shuang. Patent clustering method based on functional effect [J]. Journal of Computer Applications, 2021, 41(5): 1361-1366.
[7]	LI Guorong, YE Jimin, ZHEN Yuanting. Time series clustering based on new robust similarity measure [J]. Journal of Computer Applications, 2021, 41(5): 1343-1347.
[8]	WANG Zhihe, CHANG Xiaoqing, DU Hui. Adaptive affinity propagation clustering algorithm based on universal gravitation [J]. Journal of Computer Applications, 2021, 41(5): 1337-1342.
[9]	LONG Chaoqi, JIANG Yu, XIE Yu. Improved wavelet clustering algorithm based on peak grid [J]. Journal of Computer Applications, 2021, 41(4): 1122-1127.
[10]	LI Xingfeng, HUANG Yuqing, REN Zhenwen, LI Yihong. Robust multi-view clustering algorithm based on adaptive neighborhood [J]. Journal of Computer Applications, 2021, 41(4): 1093-1099.
[11]	ZOU Zhiwen, QIN Cheng. Method of dynamically constructing spatial topic R-tree based on k-means++ [J]. Journal of Computer Applications, 2021, 41(3): 733-737.
[12]	GUO Jia, HAN Litao, SUN Xianlong, ZHOU Lijuan. Comparative density peaks clustering algorithm with automatic determination of clustering center [J]. Journal of Computer Applications, 2021, 41(3): 738-744.
[13]	LYU Jia, XIAN Yan. Co-training algorithm combining improved density peak clustering and shared subspace [J]. Journal of Computer Applications, 2021, 41(3): 686-693.
[14]	ZHANG En, LI Huimin, CHANG Jian. Verifiable k-means clustering scheme with privacy-preserving [J]. Journal of Computer Applications, 2021, 41(2): 413-421.
[15]	YUAN Qianqian, DENG Hongmin, WANG Xiaohang. Citrus disease and insect pest area segmentation based on superpixel fast fuzzy C-means clustering and support vector machine [J]. Journal of Computer Applications, 2021, 41(2): 563-570.