Installation
About
Contains a set of algorithms for creating partitions and coverings of objects largely based on operations on (dis)similarity relations (or matrices). There are several iterative re-assignment algorithms optimizing different goodness-of-clustering criteria. In addition, there are covering algorithms 'clique' which derives maximal cliques, and 'maxpact' which creates a covering of maximally compact sets. Graphical analyses and conversion routines are also included.
ecology.msu.montana.edu/labdsv/R |
Key Metrics
Downloads
Yesterday | 19 0% |
Last 7 days | 52 -10% |
Last 30 days | 231 -23% |
Last 90 days | 952 +23% |
Last 365 days | 3.573 -26% |