Name
Abstract | ||
|---|---|---|
In this paper two categories of improvements are suggested thatcan be applied to most k-medoids-based algorithms -conceptual/algorithmic improvements, and implementationalimprovements. These include the revisiting of the accepted casesfor swap comparison and the application of partial distancesearching and previous medoid indexing to clustering. Varioushybrids are then applied to a number of k-medoids-based algorithmsand the method is shown to be generally applicable. Experimentalresults on both artificial and real datasets demonstrate that whenapplied to CLARANS the number of distance calculations can bereduced by up to 98%. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1504/IJBIDM.2008.020520 | IJBIDM |
Keywords | Field | DocType |
k-medoids-based algorithmsand,previous medoid indexing,accepted casesfor swap comparison,partial distancesearching,k-medoids-based clustering algorithm,real datasets,k-medoids-based algorithm,distance calculation,algorithmic improvement,improved search strategy,pmi,simulated annealing | Simulated annealing,Data mining,Indexation,Algorithmics,Computer science,Economic intelligence,Search engine indexing,Artificial intelligence,k-medoids,Cluster analysis,Machine learning,Medoid | Journal |
Volume | Issue | Citations |
3 | 2 | 2 |
PageRank | References | Authors |
0.41 | 25 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chu Shu-Chuan | 1 | 425 | 53.51 |
| John F. Roddick | 2 | 1908 | 331.20 |
| Pan Jeng-Shyang | 3 | 2466 | 269.74 |