EK-NNclus: A clustering procedure based on the evidential K-nearest neighbor rule
© 2015 Elsevier B.V. All rights reserved. We propose a new clustering algorithm based on the evidential K nearest-neighbor (EK-NN) rule. Starting from an initial partition, the algorithm, called EK-NNclus, iteratively reassigns objects to clusters using the EK-NN rule, until a stable partition is ob...
Saved in:
Main Authors: | Thierry Denœux, Orakanya Kanjanatarakul, Songsak Sriboonchitta |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84941598843&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54234 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
EK-NNclus: A clustering procedure based on the evidential K-nearest neighbor rule
by: Thierry Denœux, et al.
Published: (2018) -
A new evidential K-nearest neighbor rule based on contextual discounting with partially supervised learning
by: Thierry Denœux, et al.
Published: (2020) -
Evidential clustering of large dissimilarity data
by: Thierry Denœux, et al.
Published: (2018) -
Evidential clustering of large dissimilarity data
by: Denœux T., et al.
Published: (2017) -
K-EVCLUS: Clustering large dissimilarity data in the belief function framework
by: Orakanya Kanjanatarakul, et al.
Published: (2018)