Computer Science ›› 2018, Vol. 45 ›› Issue (5): 201-207.doi: 10.11896/j.issn.1002-137X.2018.05.034

Previous Articles     Next Articles

Improved MOEA/D Algorithm Based on Self-adaptive Selection Strategy

GENG Huan-tong, DING Yang-yang, ZHOU Li-fa and HAN Wei-min   

  • Online:2018-05-15 Published:2018-07-25

Abstract: Using simple and efficient neighbouring updating as the main selection strategy,MOEA/D focuses more on local replacement.In this case,it ignores the individual’s global fitness and makes algorithm get into local minimum ea-sily.In order to overcome the flaw of MOEA/D in local replacement,an improved MOEA/D which takes the global replacement and local updating into account based on self-adaptive selection strategy(MOEA/D-AS) was proposed.Firstly,a new selection strategy based on perfect matching of bipartite graph(KMS) is applied to select the elite solutions from a global perspective by using matching relationship between sub-problems and indivdual soltuions.Then,using the evolutionary information of the population,a matching disorder judgment mechanism was proposed.At last,on the basis of comprehensive analysis of the advantages of neighbourhood update strategy and KMS,the new algorithm can adaptively choose the most suitable selection strategy by using the disorder judgment mechanism to improve robustness and efficiency.The proposed algorithm was compared with some state-of-the-art versions of MOEA/D on LZ09,DTLZ and CEC09 Benchmarks.The values of Spread and IGD show that MOEA/D-AS has certain advantages than other algorithms in terms of convergence and distribution,and suggest that the self-adaptive selection strategy can effectively guide the selection process of elite solution.

Key words: MOEA/D,Perfect matching of bipartite graph,Disorder judgment,Self-adaptive selection strategy

[1] JAIN A K.Data Clustering:50 Years Beyond K-means[C]∥European Conference on Machine Learning and Knowledge Discovery in Databases.Springer-Verlag,2008:651-666.
[2] NG A Y,JORDAN M I,WEISS Y.On Spectral Clustering:Analysis and an Algorithm[J]∥Proc Nips,2001,4:849-856.
[3] SHI J,MALIK J.Normalized cuts and image segmentation[J].IEEE Trans.Pattern Anal.Mach.Intell,2000,22(8):888-905.
[4] BACH F R,JORDAN M I.Learning spectral clustering,with application to speech separation[J].Journal of Machine Lear-ning Research,2006,7(2):2006.
[5] OZERTEM U,ERDOGMUS D,JENSSEN R.Mean shift spectral clustering[J].Pattern Recognition,2008,41(6):1924-1938.
[6] MA C,WU T,DUAN M Y.Research on clustering algorithm based on degree of membership of K nearest neighbor [J].Computer Engineering and Applications,2016,2(10):55-58.(in Chinese) 马闯,吴涛,段梦雅.基于K近邻隶属度的聚类算法研究[J].计算机工程与应用,2016,52(10):55-58.
[7] LU H,FU Z,SHU X.Non-negative and sparse spectral clustering[J].Pattern Recognition,2014,47(1):418-426.
[8] YANG X,BAI X,LATECKI L J,et al.Improving Shape Retrieval by Learning Graph Transduction[C]∥European Confe-rence on Computer Vision.Marseille,France,DBLP,2008:788-801.
[9] PAVAN M,PELILLO M.Dominant Sets and Pairwise Clustering[J].IEEE Transactions on Pattern Analysis & Machine Intelligence,2007,29(1):167-72.
[10] LI L,LV J,YI Z.A non-negative representation learning algorithm for selecting neighbors[J].Machine Learning,2016,102(2):133-153.
[11] LUXBURG U.A tutorial on spectral clustering[J].Statisticsand Computing,2007,17(4):395-416.
[12] CHUANG Y Y.Affinity aggregation for spectral clustering[C]∥IEEE Conference on Computer Vision and Pattern Recognition.IEEE,2012:773-780.
[13] ZELNIK-MANOR L.Self-tuning spectral clustering[J].Ad-vances in Neural Information Processing Systems,2004,17:1601-1608.
[14] CHANG H,YEUNG D Y.Robust path-based spectral cluste-ring[J].Pattern Recognition,2008,41(1):191-203.
[15] ZHANG X,LI J,YU H.Local density adaptive similarity mea-surement for spectral clustering[J].Pattern Recognition Letters,2011,32(2):352-358.
[16] ASUNCION A,NEWMAN D J.UCI Machine Learning Repository[EB/OL].http://archive.ics.uci.edu/ml.
[17] The MNIST database of handwritten digits.[2015-03-01].http://yann.lecun.com/exdb/mnist.
[18] ANANDKUMAR A,FOSTER D P,HSU D,et al.A Spectral Algorithm for Latent Dirichlet Allocation[J].Algorithmica,2015,72(1):193-214.
[19] HETTIARACHCHI R,PETERS J F.Multi-manifold LLE lear-ning in pattern recognition[J].Pattern Recognition,2015,48(9):2947-2960.
[20] GU L L,PENG L M.Clustering algorithm based on K nearest neighbor of relative density and manifold[J].Computer Science,2016,3(12):213-217.(in Chinese) 古凌岚,彭利民.基于相对密度和流形上k近邻的聚类算法[J].计算机科学,2016,43(12):213-217.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!