shortr
Optimal Subset Identification in Undirected Weighted Network Models
Identifies what optimal subset of a desired number of items should be retained in a short version of a psychometric instrument to assess the “broadest” proportion of the construct-level content of the set of items included in the original version of the said psychometric instrument. Expects a symmetric adjacency matrix as input (undirected weighted network model). Supports brute force and simulated annealing combinatorial search algorithms.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.2 |
rolling linux/jammy R-4.5 | shortr_1.0.2.tar.gz |
29.3 KiB |
1.0.2 |
rolling linux/noble R-4.5 | shortr_1.0.2.tar.gz |
29.2 KiB |
1.0.2 |
rolling source/ R- | shortr_1.0.2.tar.gz |
8.3 KiB |
1.0.2 |
latest linux/jammy R-4.5 | shortr_1.0.2.tar.gz |
29.3 KiB |
1.0.2 |
latest linux/noble R-4.5 | shortr_1.0.2.tar.gz |
29.2 KiB |
1.0.2 |
latest source/ R- | shortr_1.0.2.tar.gz |
8.3 KiB |
1.0.2 |
2026-04-26 source/ R- | shortr_1.0.2.tar.gz |
8.3 KiB |
1.0.2 |
2026-04-23 source/ R- | shortr_1.0.2.tar.gz |
8.3 KiB |
1.0.1 |
2026-04-09 windows/windows R-4.5 | shortr_1.0.1.zip |
27.5 KiB |
1.0.1 |
2025-04-20 source/ R- | shortr_1.0.1.tar.gz |
6.4 KiB |