Hello i have a condsat python code that is done using pulp solver. i need to use the same code to solve the following: create a decision tree with a simple dataset.
It is important to prove it like a “base-case”
1. Pick a simple binary dataset with a known problem
2. Apply condsat on it to build a decision tree using the matrix of condsat (1 or 0)
3. Shows the result of using condsat as decision tree for this dataset
Only bid if you understand the problem
7 freelancers are bidding on average $51 for this job
Hi,i'm a data scientist with a BS degree in computer science i will do your task as fast as i can and i will achieve it exactly as you want,don't worry about any thing contact me for discussion