mi-erasmusmc / Explore

Finding a short and accurate decision rule in disjunctive normal form by exhaustive search
https://mi-erasmusmc.github.io/Explore/
1 stars 1 forks source link

Unit tests #11

Open AniekMarkus opened 1 year ago

AniekMarkus commented 1 year ago

Checks to add:

AniekMarkus commented 2 months ago

image

AniekMarkus commented 1 month ago

Idem for dataset mix_4.arff:

image

AniekMarkus commented 1 month ago

- Verifying if the generated rules are correct / the same as before

from mix_4.results ->

2 = AND 3 = OR 4 = Candidate model: '198124209' = "FALSE" AND '316139209' = "FALSE" OR '316139210' = "FALSE" Candidate model: '198124209' = "FALSE" AND '316139209' = "FALSE" OR '316139210' = "TRUE" Candidate model: '198124209' = "FALSE" AND '316139209' = "TRUE" OR '316139210' = "FALSE" Candidate model: '198124209' = "FALSE" AND '316139209' = "TRUE" OR '316139210' = "TRUE" Candidate model: '198124209' = "TRUE" AND '316139209' = "FALSE" OR '316139210' = "FALSE" Candidate model: '198124209' = "TRUE" AND '316139209' = "FALSE" OR '316139210' = "TRUE" Candidate model: '198124209' = "TRUE" AND '316139209' = "TRUE" OR '316139210' = "FALSE" Candidate model: '198124209' = "TRUE" AND '316139209' = "TRUE" OR '316139210' = "TRUE"