Computer Science ›› 2020, Vol. 47 ›› Issue (10): 126-129.doi: 10.11896/jsjkx.190900113

• Database & Big Data & Data Science • Previous Articles     Next Articles

K-mediods Cluster Mining and Parallel Optimization Based on Shuffled Frog Leaping Algorithm

WEI Lin-jing1, NING Lu-lu2, GUO Bin3, HOU Zhen-xing4, GAN Shi-run1   

  1. 1 School of Information Science & Technology,Gansu Agriculture University,Lanzhou 730070,China
    2 School of Light Industry Science & Engineering,Shaanxi University of Science and Technology,Xi’an 710021,China
    3 College of Computer and Information,Hohai University,Nanjing 210094,China
    4 School of Information Management,Nanjing University,Nanjing 210093,China
  • Received:2019-09-16 Revised:2019-10-21 Online:2020-10-15 Published:2020-10-16
  • About author:WEI Lin-jing,born in 1977,Ph.D,professor,master supervisor,is a member of China Computer Federation.Her main research interests include intelligent computing,algorithm application research and image analysis.
  • Supported by:
    Discipline Construction Project of Gansu Agricultural University (GAU-XKJS-2018-257),Youth Tutor Support Fund Project of Gansu Agricultural University (GAU-QDFC-2018-13),Lanzhou Science and Technology Plan Project (2019-1-31),Gansu Provincial Department of Education Innovation Fund (2020B-122) and National Natural Science Foundation of China (61063028,31560378)

Abstract: In order to reduce the error of K-mediods clustering algorithm and improve the performance of parallel optimization,the shuffled frog leaping algorithm is applied to the clustering and parallel optimization process.In the K-mediods clustering process,K-mediods is combined with the clustering cluster idea to optimize the shuffled frog leaping algorithm for each cluster cluster,which improves the efficiency of large-scale data sample clustering,especially for multiple clusters.When the class execution nodes complete the large-scale sample K-mediods clustering in parallel,the shuffled frog leaping algorithm effectively improves the speedup ratio.It has been proved by experiments that the K-mediods clustering based on the shuffled frog leaping algorithm has obvious clustering advantages compared with the common K-mediods clustering,and the acceleration ratio performance of processing large-scale samples is better.

Key words: Acceleration ratio, Clustering cluster, K-mediods clustering, Parallel optimization, Shuffled frog leaping algorithm

CLC Number: 

  • TP181
[1]QU J.Research on Intelligent Parallel Clustering Method forLarge Data in Virtual Environment[J].Computer Measurement and Control,2017,25(6):257-260.
[2]HONG Y H.Parallel computation based on MPI bee swarm K-means clustering algorithm [J].Computer Engineering and Design,2017,38(12):3339-3343.
[3]ZHAO B W,XU H.Parallel MRACO-PAM clustering algorithm based on MapReduce [J].Computer Engineering and Science,2017,39(10):1801-1806.
[4]ZHU F L,ZENG B,CAO J.Parallel optimization and implementation of SLAM algorithm based on particle filter [J].Journal of Guangdong University of Technology,2017,34(2):92-96.
[5]OUYANG C J,LIU C X,MING L,et al.An OMP Stegano-graphic Algorithm Optimized by SFLA[J].International Journal of Pattern Recognition & Artificial Intelligence,2017,31(1):496-505.
[6]TANG Z,LIU K,XIAO J,et al.A parallel k-means clustering algorithm based on redundance elimination and extreme points optimization employing MapReduce[J].Concurrency & Computation Practice & Experience,2017,29:e4109.
[7]LAI Z,FENG X,YU H,et al.A Parallel Social Spider Optimization Algorithm Based on Emotional Learning[J].IEEE Transactions on Systems,Man,and Cybernetics:Systems,2018,12(9):1-12.
[8]LIU P,TENG J Y,DING E J,et al.Large-scale text K-meansparallel clustering algorithm based on Spark [J].Chinese Journal of Information,2017,31(4):145-153.
[9]SOODI H A,VURAL A M.STATCOM Estimation UsingBack-Propagation,PSO,Shuffled Frog Leap Algorithm,and Genetic Algorithm Based Neural Networks[J].Computational Intelligence & Neuroscience,2018,2018(1):1-17.
[10]WANG N,GAO X J.A novel differential hybrid frog jump algorithm[J].Computer System Applications,2017,26(1):196-200.
[11]LU Y H,CHEN J H.Application of hybrid frog leaping algorithm in text classification feature selection optimization[J].Modern Library and Information Technology,2017,1(1):91-101.
[12]ZHAO H X,CHANG X G.An improved hybrid leaping frog algorithm[J].Journal of Lanzhou Jiaotong University,2017,36(1):51-56.
[13]TANG X Y,ZHANG X Z,ZHAO Y A.Big Data ClusteringMining Based on Swarm Intelligence Algorithm [J].Journal of Chongqing University of Technology(Natural Science),2019,33(4):128-133.
[14]ZHOU Z,SI G,CHEN J,et al.A novel method of transformer fault diagnosis based on k-mediods and decision tree algorithm[C]//International Conference on Electrical Materials & Power Equipment.2017.
[15]WANG Q,YANG J,ZHANG S S.A K-mediods clustering algorithm based on improved Drosophila optimization[J].Computer Technology and Development,2018,28(12):23-28.
[16]LIU J P,ZHANG W X,TANG Z H,et al.Adaptive Network Intrusion Detection Based on Fuzzy Rough Set Attribute Reduction and GMM-LDA Optimal Cluster Feature Learning [J].Control and Decision,2019,34(2):22-30.
[17]WANG Y,WANG L F,RAO Q F,et al.Radius-Adaptive on Selection of Initial Centers in K-Medoids Clustering [J].Journal of Chongqing University of Technology(Natural Science),2017,31(2):95-101.
[18]KHATAMI A,MIRGHASEMI S,KHOSRAVI A,et al.A new PSO-based approach to fire flame detection using K-Medoids clustering[J].Expert Systems with Applications,2017,68(C):69-80.
[19]WANG Y,WANG L F,RAO Q F,et al.K-medoids clustering algorithm for initial center point selection based on radius adaptation[J].Journal of Chongqing University of Technology(Natural Science Edition),2017,31(2):95-101.
[20]AGARWAL S,MEHTA S.Approximate Shortest DistanceComputing Using k-Medoids Clustering[J].Annals of Data Science,2017,4(4):547-564.
[1] LV Xiao-jing, LIU Zhao, CHU Xue-sen, SHI Shu-peng, MENG Hong-song, HUANG Zhen-chun. Extreme-scale Simulation Based LBM Computing Fluid Dynamics Simulations [J]. Computer Science, 2020, 47(4): 13-17.
[2] DENG Ding-sheng. Application of Improved DBSCAN Algorithm on Spark Platform [J]. Computer Science, 2020, 47(11A): 425-429.
[3] YANG Si-yan,HE Guo-qi,LIU Ru-yi. Video Stitching Algorithm Based on SIFT and Its Optimization [J]. Computer Science, 2019, 46(7): 286-291.
[4] ZHANG Xin-ming, CHENG Jin-feng, KANG Qiang, WANG Xia. Improved Shuffled Frog Leaping Algorithm and Its Application in Multi-threshold Image Segmentation [J]. Computer Science, 2018, 45(8): 54-62.
[5] LIU Yu-cheng, Richard·DING, ZHANG Ying-chao. Research on Pan-real-time Problem of Medical Detection Based on BPNNs Recognition Algorithm [J]. Computer Science, 2018, 45(6): 301-307.
[6] JIN Xin, LI Long-wei, SU Guo-hua, LIU Xiao-lei and JI Jia-nan. Prediction about Network Security Situation of Electric Power Telecommunication Based on Spark Framework and PSO Algorithm [J]. Computer Science, 2017, 44(Z6): 366-371.
[7] JIANG Wen-chao, LIN Sui, WANG Duo-qiang, LI Dong-ming and JIN Hai. Three-level Parallel Optimization and Application of Calculix in TH-2 Super-computing Environments [J]. Computer Science, 2017, 44(3): 32-35.
[8] MI Xiao-ping and LI Xue-mei. Mining Algorithm of Frequency Domain Migration Intrusion Feature Based on Information Fusion Transfer [J]. Computer Science, 2015, 42(3): 224-227.
[9] LIU Xiao-qin,HUANG Kao-li,AN You-lin,LU Xiao-ming. Application of Improved Shuffled Frog Leaping Algorithm in Optimum of Sensor Location [J]. Computer Science, 2011, 38(2): 72-75.
[10] HAN Yi,CAI Jian-hu,ZHOU Gen-gui,LI Yan-lai,LIN Hua-zhen,TANG Jia-fu. Advances in Shuffled Frog Leaping Algorithm [J]. Computer Science, 2010, 37(7): 16-19.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!