rmontanana/mdlp
1
1
Fork 0
mirror of https://github.com/rmontanana/mdlp.git synced 2025-08-15 15:35:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update README

Browse Source
This commit is contained in:
Ricardo Montañana Gómez
2024-06-24 11:47:03 +02:00
parent a1346e1943
commit 7b0673fd4b
1 changed files with 10 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
README.md
View File

@@ -14,9 +14,17 @@ The implementation tries to mitigate the problem of different label values with
Other features: Other features:
- Intervals with the same value of the variable are not taken into account for cutpoints. - Intervals with the same value of the variable are not taken into account for cutpoints.
- Intervals have to have more than two examples to be evaluated. - Intervals have to have more than two examples to be evaluated (mdlp).
The algorithm returns the cut points for the variable. - The algorithm returns the cut points for the variable.
- The transform method uses the cut points returning its index in the following way:
cut[i - 1] <= x < cut[i]
using the [std::upper_bound](https://en.cppreference.com/w/cpp/algorithm/upper_bound) method
- K-Bins discretization is also implemented, and "quantile" and "uniform" strategies are available.
## Sample ## Sample