joschout/LazyBum

Source code related to the ILP 2019 paper 'LazyBum: Decision tree learning using lazy propositionalization'

20
/ 100
Experimental

This project helps data analysts and researchers extract meaningful patterns from complex relational databases by summarizing them into a single table, then building a decision tree to classify entries. You provide a database with a target table for classification, and it outputs a feature table and a decision tree model. This is for professionals who work with interconnected data and need to build classification models.

No commits in the last 6 months.

Use this if you need to build a decision tree classifier on a relational database and want an efficient way to automatically generate relevant features from across your connected tables.

Not ideal if your data is not in a relational database or you need to predict numerical outcomes instead of categories.

data-analysis classification relational-databases predictive-modeling feature-engineering
Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 4 / 25
Maturity 16 / 25
Community 0 / 25

How are scores calculated?

Stars

8

Forks

Language

Java

License

Apache-2.0

Last pushed

Jan 22, 2021

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/joschout/LazyBum"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.