Evidential clustering of large dissimilarity data
© 2016 Elsevier B.V. In evidential clustering, the membership of objects to clusters is considered to be uncertain and is represented by Dempster-Shafer mass functions, forming a credal partition. The EVCLUS algorithm constructs a credal partition in such a way that larger dissimilarities between o...
Saved in:
Main Authors: | Denœux T., Sriboonchitta S., Kanjanatarakul O. |
---|---|
Format: | Journal |
Published: |
2017
|
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84973519329&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/41653 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
Evidential clustering of large dissimilarity data
by: Thierry Denœux, et al.
Published: (2018) -
K-EVCLUS: Clustering large dissimilarity data in the belief function framework
by: Kanjanatarakul O., et al.
Published: (2017) -
K-EVCLUS: Clustering large dissimilarity data in the belief function framework
by: Orakanya Kanjanatarakul, et al.
Published: (2018) -
EK-NNclus: A clustering procedure based on the evidential K-nearest neighbor rule
by: Thierry Denœux, et al.
Published: (2018) -
EK-NNclus: A clustering procedure based on the evidential K-nearest neighbor rule
by: Thierry Denœux, et al.
Published: (2018)