Skip to main content

A New Density Clustering Method Using Mutual Nearest Neighbor

  • Conference paper
  • First Online:
Web and Big Data (APWeb-WAIM 2021)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12858))

  • 1417 Accesses

Abstract

Density-based clustering algorithms have become a popular research topic in recent years. However, most these algorithms have difficulties identifying all clusters with greatly varying densities and arbitrary shapes or have considerable time complexity. To tackle this issue, we propose a novel density assessment method by using mutual nearest neighbor, and then propose a relative density clustering algorithm (RDC). RDC can get the right number of clusters for the datasets, which include varying densities and arbitrary shapes; in addition, the time complexity of it is O(nlog n).

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

References

  1. Li, X., Yin, H., Zhou, K., Zhou, X.: Semi-supervised clustering with deep metric learning and graph embedding. World Wide Web 23(2), 781–798 (2019). https://doi.org/10.1007/s11280-019-00723-8

    Article  Google Scholar 

  2. Liu, X., Liu, Y., Xie, Q., Li, L., Li, Z.: A potential-based clustering method with hierarchical optimization. World Wide Web 21(6), 1617–1635 (2017). https://doi.org/10.1007/s11280-017-0509-2

    Article  Google Scholar 

  3. Reza, G., Nasir, S., Norwati, M.: A survey: clustering ensembles techniques. World Acad. Sci. Eng. Technol. 30, 644–653 (2009)

    Google Scholar 

  4. Pei, X., Wu, T., Chen, C.: Automated graph regularized projective nonnegative matrix factorization for document clustering. IEEE Trans. Cybern. 44, 1821–1831 (2014)

    Article  Google Scholar 

  5. Han, J., Pei, J.: Data Mining: Concepts and Techniques. Morgan Kaufmann, California (2011)

    MATH  Google Scholar 

  6. Nanda, S., Panda, G.: A survey on nature inspired metaheuristic algorithms for partitional clustering. Swarm Evol. Comput. 44, 1–18 (2014)

    Article  Google Scholar 

  7. Jain, A.: Data clustering: 50 years beyond K-means. Pattern Recogn. Lett. 31(8), 651–666 (2010)

    Article  Google Scholar 

  8. Zhou, S., Xu, Z., Liu, F.: Method for determining the optimal number of clusters based on agglomerative hierarchical clustering. IEEE Trans. Neural Netw. Learn. Syst. 28, 3007–3017 (2017)

    Article  MathSciNet  Google Scholar 

  9. Ester, M., Kriegel, H., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, vol. 3, pp. 226–231 (1996)

    Google Scholar 

  10. Wang, W., Lou, B., Li, X., Lou, X., Jin, N., Yan, K.: Intelligent maintenance frameworks of large-scale grid using genetic algorithm and K-Mediods clustering methods. World Wide Web 23(2), 1177–1195 (2019). https://doi.org/10.1007/s11280-019-00705-w

    Article  Google Scholar 

  11. Alex, R., Alessandro, L.: Clustering by fast search and find of density peaks. Science 344(6191), 1492–1496 (2014)

    Article  Google Scholar 

  12. Xie, J., Xiong, Z., Ma, J.: Density core-based clustering algorithm with dynamic scanning radius. Knowl.-Based Syst. 142, 58–70 (2018)

    Google Scholar 

  13. Chen, Y., Tang, S., Pei, S.: Decentralized clustering by finding loose and distribute density cores. Inf. Sci. 433, 510–526 (2018)

    Article  Google Scholar 

  14. Zhu, Q., Feng, J., Huang, J.: A self-adaptive neighborhood method without parameter k. Pattern Recogn. Lett. 80, 30–36 (2016)

    Article  Google Scholar 

  15. Huang, J., Zhu, Q., Yang, L.: A non-parameter outlier detection algorithm based on natural neighbor. Knowl.-Based Syst. 92, 71–77 (2016)

    Article  Google Scholar 

  16. Huang, J.: A novel outlier cluster detection algorithm without top-n parameter. Knowl.-Based Syst. 121, 32–40 (2017)

    Article  Google Scholar 

  17. Ester, M., Kriegel, H., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: International Conference on Knowledge Discovery and Data Mining, vol. 96, pp. 226–231 (1996)

    Google Scholar 

  18. Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. Adv. Neural Inf. Process. Syst. 1, 849–856 (2001)

    Google Scholar 

  19. UC Irvine Machine Learning Repository Homepage. http://archive.ics.uci.edu/ml. Accessed 4 Apr 2013

Download references

Acknowledgment

Thanks for the guidance and suggestions of my tutor. This work is funded by the Science and Technology Development Fund Macau (SKL-IOTSC-2021-2023) and Graduate Scientific Research and Innovation Foundation of Chongqing, China (no. CYS20067).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yongfang Zha .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, Y., Zha, Y., Li, L., Xiong, Z. (2021). A New Density Clustering Method Using Mutual Nearest Neighbor. In: U, L.H., Spaniol, M., Sakurai, Y., Chen, J. (eds) Web and Big Data. APWeb-WAIM 2021. Lecture Notes in Computer Science(), vol 12858. Springer, Cham. https://doi.org/10.1007/978-3-030-85896-4_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85896-4_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85895-7

  • Online ISBN: 978-3-030-85896-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics