CRAN/E | optpart

optpart

Optimal Partitioning of Similarity Relations

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

Version 3.0-3
Published 2020-01-19 1531 days ago
Needs compilation? yes
License GPL-2
License GPL-3
CRAN checks optpart results

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%

Maintainer

Maintainer

David W. Roberts

droberts@montana.edu

Authors

David W. Roberts

Material

ChangeLog
Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

optpart archive

Depends

cluster
labdsv
MASS
plotrix

Suggests

tree

Reverse Suggests

labdsv