Compute entropy-based distances between clusters centers and points, and then run the MDS algorithm on centers distances matrix. Points representations on the MDS 2D map are computed by solving an optimization problem described in the package vignette.
|Author||Benjamin Auder <[email protected]> [aut,cre], Gilles Celeux <[email protected]> [aut]|
|Maintainer||Benjamin Auder <[email protected]>|
|License||MIT + file LICENSE|
|Package repository||View on GitHub|
Install the latest version of this package by entering the following in R:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.