Optimal Partitioning of Similarity Relations

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.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


3.0-3 by David W. Roberts, 2 years ago


Browse source code at https://github.com/cran/optpart

Authors: David W. Roberts <[email protected]>

Documentation:   PDF Manual  

Task views:

GPL (>= 2) license

Depends on cluster, labdsv, MASS, plotrix

Suggests tree

Suggested by labdsv.

See at CRAN