Skip to main content

2016 | OriginalPaper | Buchkapitel

Evidential Clustering: A Review

verfasst von : Thierry Denœux, Orakanya Kanjanatarakul

Erschienen in: Integrated Uncertainty in Knowledge Modelling and Decision Making

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In evidential clustering, uncertainty about the assignment of objects to clusters is represented by Dempster-Shafer mass functions. The resulting clustering structure, called a credal partition, is shown to be more general than hard, fuzzy, possibility and rough partitions, which are recovered as special cases. Three algorithms to generate a credal partition are reviewed. Each of these algorithms is shown to implement a decision-directed clustering strategy. Their relative merits are discussed.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
This package can be downloaded from the CRAN web site at https://​cran.​r-project.​org/​web/​packages.
 
Literatur
1.
Zurück zum Zitat Antoine, V., Quost, B., Masson, M.-H., Denoeux, T.: CEVCLUS: evidential clustering with instance-level constraints for relational data. Soft Comput. 18(7), 1321–1335 (2014)CrossRef Antoine, V., Quost, B., Masson, M.-H., Denoeux, T.: CEVCLUS: evidential clustering with instance-level constraints for relational data. Soft Comput. 18(7), 1321–1335 (2014)CrossRef
2.
Zurück zum Zitat Antoine, V., Quost, B., Masson, M.-H., Denoeux, T.: CECM: constrained evidential c-means algorithm. Comput. Stat. Data Anal. 56(4), 894–914 (2012)MathSciNetCrossRefMATH Antoine, V., Quost, B., Masson, M.-H., Denoeux, T.: CECM: constrained evidential c-means algorithm. Comput. Stat. Data Anal. 56(4), 894–914 (2012)MathSciNetCrossRefMATH
3.
Zurück zum Zitat Bezdek, J.: Pattern Recognition with Fuzzy Objective Function Algorithm. Plenum Press, New York (1981)CrossRefMATH Bezdek, J.: Pattern Recognition with Fuzzy Objective Function Algorithm. Plenum Press, New York (1981)CrossRefMATH
4.
5.
Zurück zum Zitat Davé, R.: Characterization and detection of noise in clustering. Pattern Recognit. Lett. 12, 657–664 (1991)CrossRef Davé, R.: Characterization and detection of noise in clustering. Pattern Recognit. Lett. 12, 657–664 (1991)CrossRef
6.
Zurück zum Zitat Denœux, T.: A \(k\)-nearest neighbor classification rule based on Dempster-Shafer theory. IEEE Trans. Syst. Man Cybern. 25(05), 804–813 (1995)CrossRef Denœux, T.: A \(k\)-nearest neighbor classification rule based on Dempster-Shafer theory. IEEE Trans. Syst. Man Cybern. 25(05), 804–813 (1995)CrossRef
7.
Zurück zum Zitat Denœux, T.: evclust: Evidential Clustering, R package version 1.0.2 (2016) Denœux, T.: evclust: Evidential Clustering, R package version 1.0.2 (2016)
8.
Zurück zum Zitat Denœux, T., Kanjanatarakul, O., Sriboonchitta, S.: E\(K\)-NNclus: a clustering procedure based on the evidential \(k\)-nearest neighbor rule. Knowl.-Based Syst. 88, 57–69 (2015)CrossRef Denœux, T., Kanjanatarakul, O., Sriboonchitta, S.: E\(K\)-NNclus: a clustering procedure based on the evidential \(k\)-nearest neighbor rule. Knowl.-Based Syst. 88, 57–69 (2015)CrossRef
9.
Zurück zum Zitat Denœux, T., Masson, M.-H.: EVCLUS: evidential clustering of proximity data. IEEE Trans. Syst. Man Cybern. B 34(1), 95–109 (2004)CrossRef Denœux, T., Masson, M.-H.: EVCLUS: evidential clustering of proximity data. IEEE Trans. Syst. Man Cybern. B 34(1), 95–109 (2004)CrossRef
10.
Zurück zum Zitat Denœux, T., Sriboonchitta, S., Kanjanatarakul, O.: Evidential clustering of large dissimilarity data. Knowl.-Based Syst. 106, 179–195 (2016)CrossRefMATH Denœux, T., Sriboonchitta, S., Kanjanatarakul, O.: Evidential clustering of large dissimilarity data. Knowl.-Based Syst. 106, 179–195 (2016)CrossRefMATH
11.
12.
Zurück zum Zitat Krishnapuram, R., Keller, J.: A possibilistic approach to clustering. IEEE Trans. Fuzzy Syst. 1, 98–111 (1993)CrossRef Krishnapuram, R., Keller, J.: A possibilistic approach to clustering. IEEE Trans. Fuzzy Syst. 1, 98–111 (1993)CrossRef
13.
Zurück zum Zitat Lelandais, B., Ruan, S., Denœux, T., Vera, P., Gardin, I.: Fusion of multi-tracer PET images for dose painting. Med. Image Anal. 18(7), 1247–1259 (2014)CrossRef Lelandais, B., Ruan, S., Denœux, T., Vera, P., Gardin, I.: Fusion of multi-tracer PET images for dose painting. Med. Image Anal. 18(7), 1247–1259 (2014)CrossRef
14.
Zurück zum Zitat Makni, N., Betrouni, N., Colot, O.: Introducing spatial neighbourhood in evidential c-means for segmentation of multi-source images: application to prostate multi-parametric MRI. Inf. Fusion 19, 61–72 (2014)CrossRef Makni, N., Betrouni, N., Colot, O.: Introducing spatial neighbourhood in evidential c-means for segmentation of multi-source images: application to prostate multi-parametric MRI. Inf. Fusion 19, 61–72 (2014)CrossRef
15.
Zurück zum Zitat Masson, M.-H., Denoeux, T.: ECM: an evidential version of the fuzzy c-means algorithm. Pattern Recogn. 41(4), 1384–1397 (2008)CrossRefMATH Masson, M.-H., Denoeux, T.: ECM: an evidential version of the fuzzy c-means algorithm. Pattern Recogn. 41(4), 1384–1397 (2008)CrossRefMATH
16.
Zurück zum Zitat Masson, M.-H., Denœux, T.: RECM: relational evidential c-means algorithm. Pattern Recogn. Lett. 30, 1015–1026 (2009)CrossRef Masson, M.-H., Denœux, T.: RECM: relational evidential c-means algorithm. Pattern Recogn. Lett. 30, 1015–1026 (2009)CrossRef
17.
Zurück zum Zitat Peters, G.: Is there any need for rough clustering? Pattern Recogn. Lett. 53, 31–37 (2015)CrossRef Peters, G.: Is there any need for rough clustering? Pattern Recogn. Lett. 53, 31–37 (2015)CrossRef
18.
Zurück zum Zitat Peters, G., Crespo, F., Lingras, P., Weber, R.: Soft clustering: fuzzy and rough approaches and their extensions and derivatives. Int. J. Approximate Reasoning 54(2), 307–322 (2013)MathSciNetCrossRef Peters, G., Crespo, F., Lingras, P., Weber, R.: Soft clustering: fuzzy and rough approaches and their extensions and derivatives. Int. J. Approximate Reasoning 54(2), 307–322 (2013)MathSciNetCrossRef
19.
Zurück zum Zitat Serir, L., Ramasso, E., Zerhouni, N.: Evidential evolving Gustafson-Kessel algorithm for online data streams partitioning using belief function theory. Int. J. Approximate Reasoning 53(5), 747–768 (2012)MathSciNetCrossRef Serir, L., Ramasso, E., Zerhouni, N.: Evidential evolving Gustafson-Kessel algorithm for online data streams partitioning using belief function theory. Int. J. Approximate Reasoning 53(5), 747–768 (2012)MathSciNetCrossRef
20.
Zurück zum Zitat Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)MATH Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)MATH
21.
Zurück zum Zitat ter Braak, C.J., Kourmpetis, Y., Kiers, H.A., Bink, M.C.: Approximating a similarity matrix by a latent class model: a reappraisal of additive fuzzy clustering. Comput. Stat. Data Anal. 53(8), 3183–3193 (2009)MathSciNetCrossRefMATH ter Braak, C.J., Kourmpetis, Y., Kiers, H.A., Bink, M.C.: Approximating a similarity matrix by a latent class model: a reappraisal of additive fuzzy clustering. Comput. Stat. Data Anal. 53(8), 3183–3193 (2009)MathSciNetCrossRefMATH
22.
Zurück zum Zitat 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)CrossRef 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)CrossRef
Metadaten
Titel
Evidential Clustering: A Review
verfasst von
Thierry Denœux
Orakanya Kanjanatarakul
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-49046-5_3