skip to main content
10.1145/3038884.3038887acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmedpraiConference Proceedingsconference-collections
research-article

Improving Kernel soft Subspace Clustering Algorithms using a Particle Swarm Optimization

Authors Info & Claims
Published:22 November 2016Publication History

ABSTRACT

In classification task, kernel functions are used to make possible to partition data that are linearly non-separable. In this paper, a Particle Swarm Optimization (PSO) is used to obtain optimal cluster centres, their weights features vectors and a kernel parameter by optimizing a cluster validity index. A comparative study has been conducted on synthetic and real dataset. The efficiency of the proposed method has been proven by the obtained results.

References

  1. R. Agrawal and al. 1998. Automatic subspace clustering of high dimensional data for data mining applications. In SIGMOD Record ACM Special Interest Group on Management of Data. 94--105.Google ScholarGoogle Scholar
  2. S. Alam, G. Dobbie, Y. S. Koh, P. Riddle, and S. U. Rehman. 2014. Research on particle swarm optimization based clustering: A systematic review of literature and techniques. Swarm and Evolutionary Computation 17 (2014), 1--13. Google ScholarGoogle ScholarCross RefCross Ref
  3. A. Beni and XL. Xie. 1991. Validity measure for fuzzy clustering. Pattern Analysis and Machine Intelligence, IEEE Transactions 13, 8 (1991), 841--847.Google ScholarGoogle Scholar
  4. C. Blake, E. Keogh, and C.J. Merz. 1998. UCI repository of machine learning databases. (1998). http://www.ics.uci.edu/mlearn/MLRepository.htmlGoogle ScholarGoogle Scholar
  5. A. Boulemnadjel, F. Hachouf, A. Hebboul, and K. Djemal. 2015. Active Learning For Improving a Soft Subspace Clustering Algorithm. Engineering Applications of Artificial Intelligence 46 (2015), 196--208. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. H. Chang and DY. Yeung. 2006. Locally linear metric adaptation with application to semi- supervised clustering and image retrieval. Pattern Recognition 39 (2006), 1253--1264. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Chen, Z. Xu, and Y. Tang. 2014. A hybrid clustering algorithm based on fuzzy c-means and improved particle swarm optimization. Arabian Journal for Science and Engineering 39, 12 (2014), 8875--8887. Google ScholarGoogle ScholarCross RefCross Ref
  8. M. Clerc. 2006. Particle-Swarm Optimization (iste ed.). London.Google ScholarGoogle Scholar
  9. F. Van den Bergh and A. P. Engelbrecht. 2001. Effect of swarm size on cooperative particle swarm optimizers. In Proceedings of Genetic and Evolutionary Computation Conference (GECCO'01). California, 892--899.Google ScholarGoogle Scholar
  10. Z. Deng and et al. 2010. Enhanced soft subspace clustering integrating within cluster and between-cluster information. Pattern Recognition 43 (2010), 767--781. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. T.M. Silva Filho, BA. Pimentel, R.M.C.R. Souza, and A.L.I. Oliveira. 2015. Hybrid methods for fuzzy clustering based on fuzzy c-means and improved particle swarm optimization. Expert Systems with Applications 42 (2015), 6315--6328. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. P. Fränti, O. Virmajoki, and V. Hautamäki. 2006. Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans. on Pattern Analysis and Machine Intelligence 28, 11 (2006), 1875--1881. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H. Izakian and A. Abraham. 2011. Fuzzy c-means and fuzzy swarm for fuzzy clustering problem. Expert Systems with Applications 38, 3 (2011), 1835--1838. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. Kennedy and R.C. Eberhart. 1995. Particle Swarm Optimization. In IEEE International Conference on Neural Networks. 1942--1948. Google ScholarGoogle ScholarCross RefCross Ref
  15. C. Li, J. Zhou, P. Kou, and J. Xiao. 2012. A novel chaotic particle swarm optimization based fuzzy clustering algorithm. Neurocomputing 83 (2012), 98--109. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. B. Liang and et al. 2011. A novel attribute weighting algorithm for clustering high-dimensional categorical data. Pattern Recognition 44 (2011), 2843--2861. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Liu, J. Mohammed, J. Carter, and et al. 2006. Distance-based clustering of CGH data. Bioinformatics 22, 16 (2006), 1971--1978. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Mercer. 1909. Functions of Positive and Negative Type, and their Connection with the Theory of Integral Equations. Philosophical Transactions of the Royal Society of London, Series A, Containing Papers of a Mathematical or Physical Character 209 (1909), 415--446. Google ScholarGoogle ScholarCross RefCross Ref
  19. L. Parsons, E. Haque, and H. Liu. 2004. Evaluating subspace clustering algorithms. In Work-shop on Clustering High Dimensional Data and its Applications. In SIAM Int Confon Data Mining. 48--56.Google ScholarGoogle Scholar
  20. A. Ratnaweera and K.S. Halgamuge. 2004. Self organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation 8, 3 (2004), 240--254. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. H. Shen, J. Yang, S. Wang, and X. Liu. 2006. Attribute weighted mercer kernel based fuzzy clustering algorithm for general non-spherical datasets. Soft Computing 10, 11 (2006), 1061--1073. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Y. Shi and R.C. Eberhart. 1998. A modified Particle swarm optimizer. In IEEE International Conference on Evolutionary Computation. 69--73. Google ScholarGoogle ScholarCross RefCross Ref
  23. J. Wang and et al. 2016. Distance metric learning for soft subspace clustering in composite kernel space. Pattern Recognition 52 (2016), 113--134. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. KY. Yip, D.W. Cheung, and M.K. Ng. 2004. A practical projected clustering algorithm. Knowledge and Data Engineering, IEEE Transactions 16, 11 (2004), 1387--1397.Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    MedPRAI-2016: Proceedings of the Mediterranean Conference on Pattern Recognition and Artificial Intelligence
    November 2016
    163 pages
    ISBN:9781450348768
    DOI:10.1145/3038884
    • General Chairs:
    • Chawki Djeddi,
    • Imran Siddiqi,
    • Akram Bennour,
    • Program Chairs:
    • Youcef Chibani,
    • Haikal El Abed

    Copyright © 2016 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 22 November 2016

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader