Skip to main content

Fast Unfolding of Credal Partitions in Evidential Clustering

  • Conference paper
  • First Online:
Belief Functions: Theory and Applications (BELIEF 2021)

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

Included in the following conference series:

  • 602 Accesses

Abstract

Evidential clustering, based on the notion of credal partition, has been successfully applied in many fields, reflecting its broad appeal and usefulness as one of the steps in exploratory data analysis. However, it is time-consuming due to the introduction of meta-cluster, which is regarded as a new cluster and defined by the disjunction (union) of several special (singleton) clusters. In this paper, a simple and fast method is proposed to extract the credal partition structure in evidential clustering based on modifying the iteration rule. By doing so, the invalid computation associated with meta-clusters is effectively eliminated. It is superior to known methods in terms of execution time. The results show the potential of the proposed method, especially in large 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 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Liang, J., Bai, L., Dang, C., Cao, F.: The \(K\)-means-type algorithms versus imbalanced data distributions. IEEE Trans. Fuzzy Syst. 20(4), 728–745 (2012)

    Article  Google Scholar 

  2. Denæux, T., Masson, M.H.: EVCLUS: evidential clustering of proximity data. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 34(1), 95–109 (2004)

    Google Scholar 

  3. Masson, M.H., Denoeux, T.: ECM: an evidential version of the fuzzy \(c\)-means algorithm. Pattern Recogn. 41(4), 1384–1397 (2008)

    Article  Google Scholar 

  4. Liu, Z.G., Pan, Q., Dezert, J., Mercier, G.: Credal \(c\)-means clustering method based on belief functions. Knowl.-Based Syst. 74, 119–132 (2015)

    Article  Google Scholar 

  5. Zhang, Z.W., Liu, Z., Martin, A., Liu, Z.G., Zhou, K.: Dynamic evidential clustering algorithm. Knowl.-Based Syst. 213, 106643 (2021)

    Article  Google Scholar 

  6. Zhou, K., Martin, A., Pan, Q., Liu, Z.G.: Median evidential \(c\)-means algorithm and its application to community detection. Knowl.-Based Syst. 74, 69–88 (2015)

    Article  Google Scholar 

  7. Zhang, Z.W., Liu, Z., Ma, Z., Zhang, Y., Wang, H.: A new belief-based incomplete pattern unsupervised classification method. IEEE Trans. Knowl. Data Eng. (2021). https://doi.org/10.1109/TKDE.2021.3049511

  8. Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)

    Book  Google Scholar 

  9. Smets, P.: The combination of evidence in the transferable belief model. IEEE Trans. Pattern Anal. Mach. Intell. 12(5), 447–458 (1990)

    Article  Google Scholar 

  10. Liu, Z.G., Pan, Q., Mercier, G., Dezert, J.: A new incomplete pattern classification method based on evidential reasoning. IEEE Trans. Cybern. 45(4), 635–646 (2015)

    Article  Google Scholar 

  11. Liu, Z.G., Pan, Q., Dezert, J., Martin, A.: Combination of classifiers with optimal weight based on evidential reasoning. IEEE Trans. Fuzzy Syst. 26(3), 1217–1230 (2018)

    Article  Google Scholar 

  12. Denoeux, T.: Decision-making with belief functions: a review. Int. J. Approx. Reason. 109, 87–110 (2019)

    Article  MathSciNet  Google Scholar 

  13. Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Springer, Heidelberg (2013)

    MATH  Google Scholar 

  14. Sen, S., Davé, R.N.: Clustering of relational data containing noise and outliers. In: 1998 IEEE International Conference on Fuzzy Systems Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98CH36228), vol. 2, pp. 1411–1416. IEEE (1998)

    Google Scholar 

  15. Denoeux, T., Sriboonchitta, S., Kanjanatarakul, O.: Evidential clustering of large dissimilarity data. Knowl.-Based Syst. 106, 179–195 (2016)

    Article  Google Scholar 

  16. Asuncion, A., Newman, D.: UCI machine learning repository (2007)

    Google Scholar 

Download references

Acknowledgement

This work was supported in part by the National Natural Science Foundation of China under Grants U20B2067, 61790552, 61790554, and in part by the Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University under Grant CX201953.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arnaud Martin .

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, Z., Martin, A., Liu, Z., Zhou, K., Zhang, Y. (2021). Fast Unfolding of Credal Partitions in Evidential Clustering. In: Denœux, T., Lefèvre, E., Liu, Z., Pichon, F. (eds) Belief Functions: Theory and Applications. BELIEF 2021. Lecture Notes in Computer Science(), vol 12915. Springer, Cham. https://doi.org/10.1007/978-3-030-88601-1_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-88601-1_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-88600-4

  • Online ISBN: 978-3-030-88601-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics