4 citations · 4 across the 2 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2021
Boolean Matrix Factorization with SAT and MaxSAT
Florent Avellaneda, Roger Villemaire
The Boolean matrix factorization problem consists in approximating a matrix by the Boolean product of two smaller Boolean matrices. To obtain optimal solutions when the matrices to…
cs.LG2020
An Approach to Evaluating Learning Algorithms for Decision Trees
Tianqi Xiao, Omer Nguena Timo, Florent Avellaneda +2
Learning algorithms produce software models for realising critical classification tasks. Decision trees models are simpler than other models such as neural network and they are use…
cs.LG2019★ 4 cited
Learning Optimal Decision Trees from Large Datasets
Florent Avellaneda
Inferring a decision tree from a given dataset is one of the classic problems in machine learning. This problem consists of buildings, from a labelled dataset, a tree such that eac…