Skip to main content

An Elastic Net Clustering Algorithm for Non-linearly Separable Data

  • Conference paper
Book cover Intelligent Information and Database Systems (ACIIDS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7802))

Included in the following conference series:

Abstract

This paper presents an effective elastic net-based clustering algorithm for complex and non-linearly separable data. The basic idea of the proposed algorithm is simple and can be summarized into two steps: (1) assign patterns to groups based on the attraction and tension between the elastic nodes in a ring and neighbors of the patterns and (2) merge the groups based on the distance between the elastic nodes. To evaluate the performance of the proposed method, we compare it with several state-of-the-art clustering methods in solving the data clustering problem. The simulation results show that the proposed algorithm can provide much better results than the other clustering algorithms compared in terms of the accuracy rate. The results also show that the proposed algorithm works well for complex datasets, especially non-linearly separable data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jain, A., Murty, M., Flynn, P.: Data clustering: A review. ACM Computing Surveys 31(3), 264–323 (1999)

    Article  Google Scholar 

  2. Xu, R., Wunsch-II, D.C.: Survey of clustering algorithms. IEEE Transaction on Neural Netoworks 16(3), 645–678 (2005)

    Article  Google Scholar 

  3. Leuski, A.: Evaluating document clustering for interactive information retrieval. In: Proceedings of the International Conference on Information and Knowledge Management, pp. 33–40 (2001)

    Google Scholar 

  4. Xu, W., Liu, X., Gong, Y.: Document clustering based on non-negative matrix factorization. In: Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 267–273 (2003)

    Google Scholar 

  5. Getz, G., Gal, H., Kela, I., Notterman, D.A., Domany, E.: Coupled two-way clustering analysis of breast cancer and colon cancer gene expression data. Bioinformatics 19, 12079–12084 (2003)

    Google Scholar 

  6. Xu, R., Wunsch-II, D.C.: Clustering. Wiley, John & Sons, Inc. (2008)

    Google Scholar 

  7. Theodoridis, S., Koutroumbas, K.: Chapter 16: Cluster Validity. In: Pattern Recognition, 4th edn., pp. 863–913. Academic Press, Boston (2009)

    Chapter  Google Scholar 

  8. Xiang, S., Nie, F., Zhang, C.: Learning a mahalanobis distance metric for data clustering and classification. Pattern Recognition 41(12), 3600–3612 (2008)

    Article  MATH  Google Scholar 

  9. McQueen, J.B.: Some methods of classification and analysis of multivariate observations. In: Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)

    Google Scholar 

  10. Maulik, U., Bandyopadhyay, S.: Genetic algorithm-based clustering technique. Pattern Recognition 33(9), 1455–1465 (2000)

    Article  Google Scholar 

  11. Omran, M.G., Salman, A.A., Engelbrecht, A.P.: Image classification using particle swarm optimization. In: Proceedings of the Asia-Pacific Conference on Simulated Evolution and Learning, pp. 370–374 (2002)

    Google Scholar 

  12. Dhillon, I.S., Guan, Y., Kulis, B.: Kernel k-means: spectral clustering and normalized cuts. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 551–556 (2004)

    Google Scholar 

  13. Durbin, R., Willshaw, D.: An analogue approach to the travelling salesman problem using an elastic net method. Nature 326, 689–691 (1987)

    Article  Google Scholar 

  14. Durbin, R., Szeliski, R., Yuille, A.: An analysis of the elastic net approach to the traveling salesman problem. Neural Computation 1, 348–358 (1989)

    Article  Google Scholar 

  15. TSPLIB (2012), http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/tsp/

  16. Srikanth, R., Petry, F.E., Koutsougeras, C.: Fuzzy elastic clustering. In: Proceedings of the IEEE International Conference on Fuzzy Systems, vol. 2, pp. 1179–1182 (1993)

    Google Scholar 

  17. Salvini, R.L., de Carvalho, L.A.V.: Elastic neural net algorithm for cluster analysis. In: Proceedings of the Brazilian Symposium on Neural Networks, pp. 191–195 (2000)

    Google Scholar 

  18. Krishna, K., Murty, M.N.: Genetic k-means algorithm. IEEE Transactions on System, Man and Cybernetics—Part B:Cybernetics 29(3), 433–439 (1999)

    Article  Google Scholar 

  19. Bandyopadhyay, S., Maulik, U.: An evolutionary technique based on k-means algorithm for optimal clustering in R N. Information Sciences 146(1-4), 221–237 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsai, CW., Tung, CH., Chiang, MC. (2013). An Elastic Net Clustering Algorithm for Non-linearly Separable Data. In: Selamat, A., Nguyen, N.T., Haron, H. (eds) Intelligent Information and Database Systems. ACIIDS 2013. Lecture Notes in Computer Science(), vol 7802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36546-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36546-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36545-4

  • Online ISBN: 978-3-642-36546-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics