The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
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.
Version: | 3.0-3 |
Depends: | cluster, labdsv, MASS, plotrix |
Suggests: | tree |
Published: | 2020-01-19 |
DOI: | 10.32614/CRAN.package.optpart |
Author: | David W. Roberts |
Maintainer: | David W. Roberts <droberts at montana.edu> |
License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
URL: | http://ecology.msu.montana.edu/labdsv/R |
NeedsCompilation: | yes |
Materials: | ChangeLog |
CRAN checks: | optpart results |
Reference manual: | optpart.pdf |
Package source: | optpart_3.0-3.tar.gz |
Windows binaries: | r-devel: optpart_3.0-3.zip, r-release: optpart_3.0-3.zip, r-oldrel: optpart_3.0-3.zip |
macOS binaries: | r-release (arm64): optpart_3.0-3.tgz, r-oldrel (arm64): optpart_3.0-3.tgz, r-release (x86_64): optpart_3.0-3.tgz, r-oldrel (x86_64): optpart_3.0-3.tgz |
Old sources: | optpart archive |
Reverse suggests: | labdsv |
Please use the canonical form https://CRAN.R-project.org/package=optpart to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.