matrixcut: Determines Clustering Threshold Based on Similarity Values

The user must supply a matrix filled with similarity values. The software will search for significant differences between similarity values at different hierarchical levels. The algorithm will return a Loess-smoothed plot of the similarity values along with the inflection point, if there are any. There is the option to search for an inflection point within a specified range. The package also has a function that will return the matrix components at a specified cutoff. References: Mullner. <ArXiv:1109.2378>; Cserhati, Carter. (2020, Journal of Creation 34(3):41-50), <>.

Version: 0.0.1
Depends: R (≥ 3.5.0)
Imports: igraph, stats, inflection
Published: 2023-03-24
Author: Matthew Cserhati ORCID iD [aut, cre]
Maintainer: Matthew Cserhati <csmatyi at>
License: GPL (≥ 3)
NeedsCompilation: no
CRAN checks: matrixcut results


Reference manual: matrixcut.pdf


Package source: matrixcut_0.0.1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): matrixcut_0.0.1.tgz, r-oldrel (arm64): matrixcut_0.0.1.tgz, r-release (x86_64): matrixcut_0.0.1.tgz, r-oldrel (x86_64): matrixcut_0.0.1.tgz


Please use the canonical form to link to this page.