Skip to main content
SpringerLink
Log in

An efficient three-way clustering algorithm based on gravitational search

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

There are three types of relationships between an object and a cluster, namely, belong-to definitely, uncertain and not belong-to definitely. Most of the existing clustering algorithms represent a cluster with a single set and they are the two-way clustering algorithms since they just reflect two relationships. By contrast, the three-way clustering can reflect intuitively the three types of relationships with a pair of sets. However, the three-way clustering algorithms usually need to know the thresholds in advance in order to obtain the three types of relationships. To address the problem, we propose an efficient three-way clustering algorithm based on the idea of universal gravitation in this paper. The proposed method can adjust the thresholds automatically in the process of clustering and obtain more detailed ascription relation between objects and clusters. Furthermore, to guarantee the integrity of the work, we also put forward a two-way clustering algorithm to obtain the conventional two-way result. The experimental results show that the proposed algorithm is not only effective to obtain the three-way clustering result from the two-way clustering result automatically, but also it is in a better performance at the accuracy, F-measure, NMI and RI than the compared algorithms in most cases.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Azam N, Zhang Y, Yao JT (2017) Evaluation functions and decision conditions of three-way decisions with game-theoretic rough sets. Eur J Oper Res 261(2):704–714

    Article  MathSciNet  Google Scholar 

  2. Blake CL, Merz CJ (2005) UCI machine learning repository. http://www.ics.uci.edu/mlearn/MLRepository.html

  3. Chen M, Miao DQ (2011) Interval set clustering. Expert Syst Appl 38(4):2923–2932

    Article  Google Scholar 

  4. Du MJ, Ding SF, Jia HJ (2016) Study on density peaks clustering based on k-nearest neighbors and principal component analysis. Knowl-Based Syst 99:135–145

    Article  Google Scholar 

  5. Frigui H, Bchir O, Baili N (2013) An overview of unsupervised and semi-supervised fuzzy kernel clustering. Int J Fuzzy Log Intell Syst 13(4):254–268

    Article  Google Scholar 

  6. Jia XY, Rao Y, Shang L, Li TJ Similarity-based attribute reduction in rough set theory: a clustering perspective. Int J Mach Learn Cybernet https://doi.org/10.1007/s13042-019-00959-w

  7. Li JH, Kumar CA, Mei CL, Wang XZ (2017) Comparison of reduction in formal decision contexts. Int J Approx Reason 80:100C122

    MathSciNet  MATH  Google Scholar 

  8. Li HX, Zhang LB, Zhou XZ, Huang B (2017) Cost-sensitive sequential three-way decision modeling using a deep neural network. Int J Approx Reason 85:68–78

    Article  MathSciNet  Google Scholar 

  9. Li JH, Huang CC, Qi JJ, Qian YH, Liu WQ (2017) Three-way cognitive concept learning via multi-granularity. Inf Sci 378:244–263

    Article  Google Scholar 

  10. Liang DC, Xu ZS, Liu D, Wu Y (2018) Method for three-way decisions using ideal TOPSIS solutions at pythagorean fuzzy information. Inf Sci 435:282–295

    Article  MathSciNet  Google Scholar 

  11. Lin YJ, Li YW, Wang CX, Chen JK (2018) Attribute reduction for multi-label learning with fuzzy rough set. Knowl-Based Syst 152:51–61

    Article  Google Scholar 

  12. Ma CL, Ma T, Shan H (2016) A new important-place identification method. In: Proceedings of the IEEE international conference on computer and communications, pp 151–155

  13. Min F, Zhang ZH, Zhai WJ, Shen RP (2018) Frequent pattern discovery with tri-partition alphabets. Inf Sci https://doi.org/10.1016/j.ins.2018.04.013

  14. Peters G, Crespo F, Lingras P, Weber R (2013) Soft clustering–fuzzy and rough approaches and their extensions and derivatives. Int J Approx Reason 54(2):307–322

    Article  MathSciNet  Google Scholar 

  15. Rand WM (1971) Objective criteria for the evaluation of clustering methods. J Am Stat Assoc 66(336):846–850

    Article  Google Scholar 

  16. Rodriguez A, Laio A (2014) Clustering by fast search and find of density peaks. Science 344(6191):1492–1496

    Article  Google Scholar 

  17. Roy A, Pokutta S (2016) Hierarchical clustering via spreading metrics. Proc Thirtieth Conf Neural Inf Process Syst 18(88):1–35

    MATH  Google Scholar 

  18. Shao MW, Leung Y, Wang XZ (2016) Granular reducts of formal fuzzy contexts. Knowl-Based Syst 114:156–166

    Article  Google Scholar 

  19. Wang CZ, Qi YL, Shao MW, Hu QH, Chen DG, Qian YH, Lin YJ et al (2017) A fitting model for feature selection with fuzzy rough sets. IEEE Trans Fuzzy Syst 25(4):741–753

    Article  Google Scholar 

  20. Wang R, Chen DG, Kwong S (2014) Fuzzy rough set based active learning. IEEE Trans Fuzzy Syst 22(6):1699C1704

    Google Scholar 

  21. Wang YT, Chen LH, Mei JP (2014) Incremental fuzzy clustering with multiple medoids for large data. IEEE Trans Fuzzy Syst 22(6):1557–1568

    Article  Google Scholar 

  22. Wang PX, Yao YY (2018) CE3: A three-way clustering method based on mathematical morphology. Knowl-Based Syst 155:54–65

    Article  Google Scholar 

  23. Wang PX, Shi H, Yang XB, Mi JS (2019) Three-way k-means: integrating k-means and three-way decision. Int J Mach Learn Cybernet https://doi.org/10.1007/s13042-018-0901-y

  24. Xie JY, Gao HC, Xie WX, Liu XH, Philip WG (2016) Robust clustering by detecting density peaks and assigning points based on fuzzy weighted k-nearest neighbors. Inf Sci 354:19–40

    Article  Google Scholar 

  25. Xu W, Liu X, Gong YH (2003) Document clustering based on non-negative matrix factorization. In: Proceedings of the 26th annual international ACM SIGIR conference on research and development in informaion retrieval, pp 267–273

  26. Xu WH, Li MM, Wang XZ (2017) Information fusion based on information entropy in fuzzy multi-source incomplete information system. Int J Fuzzy Syst 19(4):1200–1216

    Article  Google Scholar 

  27. Yao YY (2012) An outline of a theory of three-way decisions. In: Proceedings of the rough sets and current trends in computing, pp 1–17

  28. Yao YY (2016) Three-way decisions and cognitive computing. Cognit Comput 8(4):543–554

    Article  Google Scholar 

  29. Yang YY, Chen DG, Wang H, Wang XZ (2018) Incremental perspective for feature selection based on fuzzy rough sets. IEEE Trans Fuzzy Syst 26(3):1257–1273

    Article  Google Scholar 

  30. Yu H, Jiao P, Yao YY, Wang GY (2016) Detecting and refining overlapping regions in complex networks with three-way decisions. Inf Sci 373:21–41

    Article  Google Scholar 

  31. Yu H (2018) Three-way decisions and three-way clustering. In: Proceedings of the international joint conference on rough sets, pp 13–28

  32. Yu H, Wang XC, Wang GY, Zeng XH (2018) An active three-way clustering method via low-rank matrices for multi-view data. Inf Sci https://doi.org/10.1016/j.ins.2018.03.009

  33. Yu H, Zhang C, Wang GY (2016) A tree-based incremental overlapping clustering method using the three-way decision theory. Knowl-Based Syst 91:189–203

    Article  Google Scholar 

  34. Zhong JJ, Peter WT, Wei YH (2017) An intelligent and improved density and distance-based clustering approach for industrial survey data classification. Expert Syst Appl 68:21–28

    Article  Google Scholar 

  35. Zhou R, Zhang S, Chen C, Ning L, Zhang Y et al (2016) A distance and density-based clustering algorithm using automatic peak detection. In: Proceedings of the IEEE international conference on smart cloud, pp 176–183

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61751312, 61876027 and 61533020.

Author information

Authors and Affiliations

  1. Chongqing Key Laboratory of Computational Intelligence, Chongqing University of Posts and Telecommunications, Chongqing, 400065, People’s Republic of China

    Hong Yu, Zhihua Chang & Guoyin Wang

  2. School of Information Science and Engineering, Central South University, Changsha, 410083, People’s Republic of China

    Xiaofang Chen

Authors
  1. Hong Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhihua Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guoyin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaofang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong Yu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, H., Chang, Z., Wang, G. et al. An efficient three-way clustering algorithm based on gravitational search. Int. J. Mach. Learn. & Cyber. 11, 1003–1016 (2020). https://doi.org/10.1007/s13042-019-00988-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-019-00988-5

Keywords

Search

Navigation