An Ameliorated Partitioning Clustering Algorithm
Original K-medoid algorithm use to take initial medoids arbitrarily that bears on the resulting clusters and it leads to unstable and empty clusters which are no meaningful and also amount of iterations can be rather high so K-Medoid is not a substitute for big databases because of its computational...
Saved in:
| Published in: | 2014 International Conference on Computational Intelligence and Communication Networks pp. 520 - 524 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.11.2014
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!