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.

Optimal Partitioning of Similarity Relations

package-ubuntu-20.04-r-4.0.5#cran#optpart-3.0-3

<p>These functions establish generic functions or connections
to other packages and are not intended to be called directly</p>

package-ubuntu-20.04-r-4.0.5#cran#optpart-3.0-3#docs#optpart.internal

optpart.internal

Description

optpart

We don't support your browser anymore