Crandore Hub

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), <https://dl0.creation.com/articles/p137/c13759/j34-3_64-73.pdf>.

Versions across snapshots

VersionRepositoryFileSize
0.0.1 rolling linux/jammy R-4.5 matrixcut_0.0.1.tar.gz 59.5 KiB
0.0.1 rolling linux/noble R-4.5 matrixcut_0.0.1.tar.gz 59.4 KiB
0.0.1 rolling source/ R- matrixcut_0.0.1.tar.gz 38.8 KiB
0.0.1 latest linux/jammy R-4.5 matrixcut_0.0.1.tar.gz 59.5 KiB
0.0.1 latest linux/noble R-4.5 matrixcut_0.0.1.tar.gz 59.4 KiB
0.0.1 latest source/ R- matrixcut_0.0.1.tar.gz 38.8 KiB
0.0.1 2026-04-26 source/ R- matrixcut_0.0.1.tar.gz 38.8 KiB
0.0.1 2026-04-23 source/ R- matrixcut_0.0.1.tar.gz 38.8 KiB
0.0.1 2026-04-09 windows/windows R-4.5 matrixcut_0.0.1.zip 62.2 KiB
0.0.1 2025-04-20 source/ R- matrixcut_0.0.1.tar.gz 38.8 KiB

Dependencies (latest)

Imports