svmodt
Linear SVM-Based Recursive Decision Trees
Implements Support Vector Machine Oblique Decision Trees (SVMODT). Recursively builds classification trees using linear Support Vector Machines (SVM) hyperplanes at each node instead of axis-parallel splits, creating oblique decision boundaries. Features include multiple feature selection methods, dynamic feature subset strategies, class weight support for imbalanced datasets, pruning and feature penalization.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | svmodt_0.1.0.tar.gz |
330.3 KiB |
0.1.0 |
rolling linux/noble R-4.5 | svmodt_0.1.0.tar.gz |
330.2 KiB |
0.1.0 |
rolling source/ R- | svmodt_0.1.0.tar.gz |
206.3 KiB |
0.1.0 |
latest linux/jammy R-4.5 | svmodt_0.1.0.tar.gz |
330.3 KiB |
0.1.0 |
latest linux/noble R-4.5 | svmodt_0.1.0.tar.gz |
330.2 KiB |
0.1.0 |
latest source/ R- | svmodt_0.1.0.tar.gz |
206.3 KiB |
0.1.0 |
2026-04-23 source/ R- | svmodt_0.1.0.tar.gz |
0 B |