optpart: Optimal partitioning of similarity relations

The package 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: 2.1-1
Depends: cluster, labdsv, MASS, plotrix
Suggests: tree
Published: 2013-09-12
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
In views: Cluster
CRAN checks: optpart results


Reference manual: optpart.pdf
Package source: optpart_2.1-1.tar.gz
Windows binaries: r-devel: optpart_2.1-1.zip, r-release: optpart_2.1-1.zip, r-oldrel: optpart_2.1-1.zip
OS X Snow Leopard binaries: r-release: optpart_2.1-1.tgz, r-oldrel: optpart_2.1-1.tgz
OS X Mavericks binaries: r-release: optpart_2.1-1.tgz
Old sources: optpart archive

Reverse dependencies:

Reverse suggests: labdsv