mirror of
https://github.com/rmontanana/mdlp.git
synced 2025-08-15 23:45:57 +00:00
42b91d1391
* Update version and dependencies * Fix conan and create new version (#11) * First approach * Fix debug conan build target * Add viewcoverage and fix coverage generation * Add more tests to cover new integrity checks * Add tests to accomplish 100% * Fix conan-create makefile target * Update debug build * Fix release build * Update github build workflow * Update github workflow * Update github workflow * Update github workflow * Update github workflow remove coverage report
47 lines
2.2 KiB
Markdown
47 lines
2.2 KiB
Markdown
[](https://github.com/rmontanana/mdlp/actions/workflows/build.yml)
|
|
[](https://sonarcloud.io/summary/new_code?id=rmontanana_mdlp)
|
|
[](https://sonarcloud.io/summary/new_code?id=rmontanana_mdlp)
|
|
[](html/index.html)
|
|
[](https://deepwiki.com/rmontanana/mdlp)
|
|
[](https://doi.org/10.5281/zenodo.16025501)
|
|
|
|
# <img src="logo.png" alt="logo" width="50"/> mdlp
|
|
|
|
Discretization algorithm based on the paper by Fayyad & Irani [Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning](https://www.ijcai.org/Proceedings/93-2/Papers/022.pdf)
|
|
|
|
The implementation tries to mitigate the problem of different label values with the same value of the variable:
|
|
|
|
- Sorts the values of the variable using the label values as a tie-breaker
|
|
- Once found a valid candidate for the split, it checks if the previous value is the same as actual one, and tries to get previous one, or next if the former is not possible.
|
|
|
|
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 (mdlp).
|
|
- 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
|
|
|
|
To run the sample, just execute the following commands:
|
|
|
|
```bash
|
|
make build
|
|
build_release/sample/sample -f iris -m 2
|
|
build_release/sample/sample -h
|
|
```
|
|
|
|
## Test
|
|
|
|
To run the tests and see coverage (llvm with lcov and genhtml have to be installed), execute the following commands:
|
|
|
|
```bash
|
|
make test
|
|
```
|