Advertisement

Density Peaks Clustering Based on Improved RNA Genetic Algorithm

  • Liyan Ren
  • Wenke ZangEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10745)

Abstract

A density peaks clustering based on improved RNA genetic algorithm (DPC-RNAGA) is proposed in this paper. To overcome the problems of Clustering by fast search and find of density peaks (referred to as DPC), DPC-RNAGA uses exponential method to calculate the local density, In addition, improved RNA-GA was used to search the optimums of local density and distance. So clustering centers can be determined easily. Numerical experiments on synthetic and real-world datasets show that, DPC-RNAGA can achieve better or comparable performance on the benchmark of clustering, adjusted rand index (ARI), compared with K-means, DPC and Max_Min SD methods.

Keywords

RNA genetic algorithm Clustering Density peaks Distance 

Notes

Acknowledgement

This research is supported by Excellent Young Scholars Research Fund of Shandong Normal University, China. It is also supported by Natural Science Foundation of China (No. 61472231, No. 61640201, No. 61502283, No. 61402266). And in part by the Jinan Youth Science and Technology Star Project under Grant 20120108, and in part by the soft science research on national economy and social information of Shandong, China under Grant(2015EI013).

References

  1. 1.
    Mohebi, A., Aghabozorgi, S.R., Teh, Y.W., Herawan, T., Yahyapour, R.: Iterative big data clustering algorithms: a review. Softw. Pract. Exper. 46(1), 107–129 (2016).  https://doi.org/10.1002/spe.2341 CrossRefGoogle Scholar
  2. 2.
    Gorunescu, F.: Data Mining –Concepts, Models and Techniques. ISRL, vol. 12. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-19721-5 zbMATHGoogle Scholar
  3. 3.
    Rodriguez, A., Laio, A.: Clustering by fast search and find of density peaks. Science 344(6191), 1492–1496 (2014)CrossRefGoogle Scholar
  4. 4.
    Sun, K., Geng, X., Ji, L.: Exemplar component analysis: a fast band selection method for hyperspectral imagery. IEEE Geosci. Remote Sensing Lett. 12(5), 998–1002 (2015).  https://doi.org/10.1109/LGRS.2014.2372071 CrossRefGoogle Scholar
  5. 5.
    Zhu, Q., Ning, W., Li, Z., Zhu, Q., Ning, W., Li, Z.: Circular genetic operators based RNA genetic algorithm for modeling proton exchange membrane fuel cells. Int. J. Hydrog. Energy 39(31), 17779–17790 (2014)CrossRefGoogle Scholar
  6. 6.
    Dubes, R.C.: Cluster analysis and related issues. In: Handbook of Pattern Recognition & Computer Vision (2015). 996 pGoogle Scholar
  7. 7.
    Chang, H., Yeung, D.: Robust path-based spectral clustering. Pattern Recogn. 41(1), 191–203 (2008).  https://doi.org/10.1016/j.patcog.2007.04.010 CrossRefzbMATHGoogle Scholar
  8. 8.
    KBache, M.L.: Uci machine learning repository (2013). http://archive.ics.uci.edu/ml
  9. 9.
    Dubey, A.K., Gupta, U., Jain, S.: Analysis of k-means clustering approach on the breast cancer wisconsin dataset. Int. J. Comput. Assist. Radiol. Surg. 11(11), 2033–2047 (2016).  https://doi.org/10.1007/s11548-016-1437-9 CrossRefGoogle Scholar
  10. 10.
    Bian, W., Tao, D.: Max-min distance analysis by using sequential SDP relaxation for dimension reduction. IEEE Trans. Pattern Anal. Mach. Intell. 33(5), 1037–1050 (2011).  https://doi.org/10.1109/TPAMI.2010.189 CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.School of Management Science and EngineeringShandong Normal UniversityJinanChina

Personalised recommendations