bsnsing
Build Decision Trees with Optimal Multivariate Splits
Functions for training an optimal decision tree classifier, making predictions and generating latex code for plotting. Works for two-class and multi-class classification problems. The algorithm seeks the optimal Boolean rule consisting of multiple variables to split a node, resulting in shorter trees. Use bsnsing() to build a tree, predict() to make predictions and plot() to plot the tree into latex and PDF. See Yanchao Liu (2022) <arXiv:2205.15263> for technical details. Source code and more data sets are at <https://github.com/profyliu/bsnsing/>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.1 |
rolling linux/jammy R-4.5 | bsnsing_1.0.1.tar.gz |
214.5 KiB |
1.0.1 |
rolling linux/noble R-4.5 | bsnsing_1.0.1.tar.gz |
215.4 KiB |
1.0.1 |
rolling source/ R- | bsnsing_1.0.1.tar.gz |
80.4 KiB |
1.0.1 |
latest linux/jammy R-4.5 | bsnsing_1.0.1.tar.gz |
214.5 KiB |
1.0.1 |
latest linux/noble R-4.5 | bsnsing_1.0.1.tar.gz |
215.4 KiB |
1.0.1 |
latest source/ R- | bsnsing_1.0.1.tar.gz |
80.4 KiB |
1.0.1 |
2026-04-26 source/ R- | bsnsing_1.0.1.tar.gz |
80.4 KiB |
1.0.1 |
2026-04-23 source/ R- | bsnsing_1.0.1.tar.gz |
80.4 KiB |
1.0.1 |
2026-04-09 windows/windows R-4.5 | bsnsing_1.0.1.zip |
537.4 KiB |
1.0.1 |
2025-04-20 source/ R- | bsnsing_1.0.1.tar.gz |
80.4 KiB |