blox
Block Diagonal Matrix Approximation
Finds the best block diagonal matrix approximation of a symmetric matrix. This can be exploited for divisive hierarchical clustering using singular vectors, named HC-SVD. The method is described in Bauer (202Xa) <doi:10.48550/arXiv.2308.06820>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.0.1 |
rolling linux/jammy R-4.5 | blox_0.0.1.tar.gz |
100.8 KiB |
0.0.1 |
rolling linux/noble R-4.5 | blox_0.0.1.tar.gz |
102.4 KiB |
0.0.1 |
rolling source/ R- | blox_0.0.1.tar.gz |
15.3 KiB |
0.0.1 |
latest linux/jammy R-4.5 | blox_0.0.1.tar.gz |
100.8 KiB |
0.0.1 |
latest linux/noble R-4.5 | blox_0.0.1.tar.gz |
102.4 KiB |
0.0.1 |
latest source/ R- | blox_0.0.1.tar.gz |
15.3 KiB |
0.0.1 |
2026-04-26 source/ R- | blox_0.0.1.tar.gz |
15.3 KiB |
0.0.1 |
2026-04-23 source/ R- | blox_0.0.1.tar.gz |
15.3 KiB |
0.0.1 |
2026-04-09 windows/windows R-4.5 | blox_0.0.1.zip |
420.8 KiB |