A New Adaptive Elastic Net Method for Cluster Analysis

Junyan Yi, Peixin Zhao, Lei Zhang, Gang Yang


Clustering is inherently a highly challenging research problem. The elastic net algorithm is designed to solve the traveling salesman problem initially, now is verified to be an efficient tool for data clustering in n-dimensional space. In this paper, by introducing a nearest neighbor learning method and a local search preferred strategy, we proposed a new Self-Organizing NN approach, called the Adaptive Clustering Elastic Net (ACEN) to solve the cluster analysis problems. ACEN consists of the adaptive clustering elastic net phase and a local search preferred phase. The first phase is used to find a cyclic permutation of the points as to minimize the total distances of the adjacent points, and adopts the Euclidean distance as the criteria to assign each point. The local search preferred phase aims to minimize the total dissimilarity within each clusters. Simulations were made on a large number of homogeneous and nonhomogeneous artificial clusters in n dimensions and a set of publicly standard problems available from UCI. Simulation results show that compared with classical partitional clustering methods, ACEN can provide better clustering solutions and do more efficiently.


self-organizing neural network;elastic net;adaptive;cluster analysis

Full Text:



Alahakoon D., Halgamuge S.K. (2000); Dynamic Self-organizing Maps with Controlled Growth for Knowledge Discovery, IEEE Trans. on Neural Networks, 11(3), 601-614, 2000.

Baldi P., Hatfield G.W.(2002); DNA Microarrays and Gene Expression, Cambridge University Press, 2002.

Climer S., Weixiong Zhang W. (2006); Rearrangement Clustering: Pitfalls, Remedies, and Applications, Journal of Machiner Learning Research, 7, 919-943, 2006.

Dittenbach M., Rauber A. (2002); Uncovering Hierarchical Structure in Data Using the Growing Hierarchical Self-organizing Map, Neurocomputing, 48, 199-216, 2002.

Durbin R., Willshaw D. (1987); An Analogue Approach to the Traveling Salesman Problem Using an Elastic Net Approach, Nature, 326, 689-691, 1987.

Frigui H., Krishnapuram R. (1999); A Robust Competitive Clustering Algorithm with Applications in Computer Vision, IEEE Trans. Pattern Analysis and Machine Intelligence, 21(5), 450-465, 1999.

Gorbunov S., Kisel I. (2006); Elastic Net for Standalone RICH Ring Finding, Proceedingspublished in NIM, 559, 139-142, 2006.

Jain A.K., Flynn P. (1996); Image Segmentation Using Clustering, Advances in Image Understanding, 65-83, 1996.

Jain K. (2010); Data Clustering: 50 Years Beyond K-Means, Pattern Recognition Letters, 31(8), 651-666, 2010.

Kantardzic M. (2011); Data Mining: Concepts, Models, Methods, and Algorithms, Wiley- IEEE Press, 2011.

Kohonen T. (1982); Self-organized Formation of the Topologically Correct Feature Maps, Biological Cybernetics, 43, 59-69, 1982.

Kohonen T. (2001); Self-Organizing Maps, 3rd Ed. New York: Springer-Verlag, 2001.

Levano M.; Hans Nowak H. (2011); New Aspects of the Elastic Net Algorithm for Cluster Analysis, Neural Comput and Applic, 20, 835-850, 2011.

Raube A., Merkl D. (2002); The Growing Hierarchical Self-Organizing Map: Exploratory Analysis of High-Dimensional Data, IEEE Transactions on Neural Networks, 13(6), 1331- 1340, 2002.

Rose K., Gurewitz E., Fox G. (1990); Statistical Mechanics and Phase Transitions in Clustering, Phys Rev Lett, 65, 945-948, 1990.

Saric T.; Simunovic, G. (2016); Estimation of Machining Time for CNC Manufacturing Using Neural Computing, International Journal of Simulation Modelling, 15(4), 663-675, 2016.

Shi J., Malik J. (2000); Normalized Cuts and Image Segmentation, IEEE Trans. Pattern Analysis and Machine Intelligence, 22(8), 888-905, 2000.

Tang M., Gong D., Liu S., Zhang H. (2016); Applying Multi-phase Particle Swarm Optimization to Solve Bulk Cargo Port Scheduling Problem, Advances in Production Engineering and Management, 11(4), 299-310, 2016.

Tavazoie S., Hughes D.; Campbell M.J., Cho R.J., Church G.M. (1999); Systematic Determination of Genetic Network Architecture, Nature Genetic, 22, 281-285, 1999.

Vakhutinsky A.I., Golden B.L. (2003); The Co-adaptive Neural Network Approach to the Euclidean Traveling Salesman Problem, Neural Networks, 16(10), 1499-1525, 2003.

Wang J., Tang Z., Qiping Cao, Xinshun Xu (2003); An Elastic Net Learning Algorithm for Edge Linking of Images, IEICE Trans. Fundamentals, E86-A(11), 2879-2886, 2003.

Wu S., Liew A.W.C., Yan, H., Yang M. (2014); Cluster Analysis of Gene Expression Database on Self-Splitting and Merging Competitive Learning, IEEE Trans. Information Technology in Biomedicine, doi: 10.1109/TITB.2004.824724, 8(1), 5-15, 2014.

Xu R. (2005); Survey of Clustering Algorithm, IEEE Transaction On Neural Networks, 16, 645-678, 2005.

Yang K. W. (2015); A Variables Clustering Based Differential Evolution Algorithm to Solve Production Planning Problem, International Journal of Simulation Modelling, 14(3), 525- 538, 2015.

DOI: http://dx.doi.org/10.15837/ijccc.2017.3.2796


  • There are currently no refbacks.

INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.


***IJCCC is covered by THOMSON REUTERS and is indexed in ISI Web of Science/Knowledge Clarivate: Science Citation Index Expanded. 2016 Journal Citation Reports® Science Edition(Thomson Reuters/Clarivate, 2017): Subject Category: (1) Automation & Control Systems: Q4(2009,2011,2012,2013,2014,2015), Q3(2010, 2016); (2) Computer Science, Information Systems: Q4(2009,2010,2011,2012,2015), Q3(2013,2014, 2016). Impact Factor/3 years in JCR: 0.373(2009), 0.650 (2010), 0.438(2011); 0.441(2012), 0.694(2013), 0.746(2014), 0.627(2015). Impact Factor/5 years in JCR: 0.436(2012), 0.622(2013), 0.739(2014), 0.635(2015), 1.374(2016).

*** IJCCC is also indexed by SCOPUS (SNIP2015= 0.784): Subject Category: (1) Computational Theory and Mathematics: Q4(2009,2010,2012,2015), Q3(2011,2013,2014); (2) Computer Networks and Communications: Q4(2009), Q3(2010, 2012, 2013, 2015), Q2(2011, 2014); (3) Computer Science Applications: Q4(2009), Q3(2010, 2011, 2012, 2013, 2014, 2015). SJR: 0.178(2009), 0.339(2010), 0.369(2011), 0.292(2012), 0.378(2013), 0.420(2014), 0.319(2015). CiteScore 2016 in Scopus: 1.06.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (A. Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor):

This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (A. Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006). IF=1.374 in JCR2016.

IJCCC is indexed in Scopus from 2008 (SNIP2015 = 0.78, SJR2015 =0.319):

SCImago Journal & Country Rank


Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field: Elsevier/ Scopus.

Elsevier:How do you feel about being nominated for Scopus Awards 2015? Interview.