From 7b0673fd4b05135ce90f711b2dc410eb1a2fa5ff Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ricardo=20Monta=C3=B1ana=20G=C3=B3mez?= Date: Mon, 24 Jun 2024 11:47:03 +0200 Subject: [PATCH] Update README --- README.md | 12 ++++++++++-- 1 file changed, 10 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 83d8be6..a42900f 100644 --- a/README.md +++ b/README.md @@ -14,9 +14,17 @@ The implementation tries to mitigate the problem of different label values with Other features: - 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