kmed: Distance-Based K-Medoids

Algorithms of distance-based k-medoids clustering: simple and fast k-medoids, ranked k-medoids, and increasing number of clusters in k-medoids. Calculate distances for mixed variable data such as Gower, Podani, Wishart, Huang, Harikumar-PV, and Ahmad-Dey. Cluster validations apply internal and relative criteria. The internal criteria include silhouette index and shadow values. The relative criterium applies bootstrap procedure producing a heatmap with a flexible reordering matrix algorithm such as ward, complete, or centroid linkages. The cluster result can be plotted in a marked barplot or pca biplot.

Package details

AuthorWeksi Budiaji
MaintainerWeksi Budiaji <budiaji@untirta.ac.id>
LicenseGPL-3
Version0.3.0
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("kmed")

Try the kmed package in your browser

Any scripts or data that you put into this service are public.

kmed documentation built on June 14, 2019, 9:02 a.m.