clustDDist: Clustering Discrete Distributions

Clustering of units described with distributions is considered. Frequent approach for clustering such data combines non-hierarchical method (to allow clustering of large amount of units) with hierarchical clustering method (to build dendrogram from the obtained nonhierarchical clusters and determine the most 'natural' final clustering(s) from it). The use of the squared Euclidean distance as an error function favors patterns of distributions that have one steep high peak. Here several alternative error functions are implemented. They characterize errors between clustered units and a cluster representative - leader (which needs not be defined in the same space). For these error functions the adapted leaders methods and compatible agglomerative hierarchical clustering methods are implemented.

AuthorNatasa Kejzar, Vladimir Batagelj, Simona Korenjak-Cerne
Date of publicationNone
MaintainerNatasa Kejzar <natasa.kejzar@fdv.uni-lj.si>
LicenseGPL-2
Version1.3

View on R-Forge

Hadoop Online Training by Edureka

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.