Probabilistic learning of boolean functions applied to the binary classification problem with categorical covariates

03/20/2020
by   Paulo Hubert, et al.
0

In this work we cast the problem of binary classification in terms of estimating a partition on Bernoulli data. When the explanatory variables are all categorical, the problem can be modelled using the language of boolean functions. We offer a probabilistic analysis of the problem, and propose two algorithms for learning boolean functions from binary data.

READ FULL TEXT
research
08/30/2019

Property testing of the Boolean and binary rank

We present algorithms for testing if a (0,1)-matrix M has Boolean/binary...
research
07/24/2021

A Model-Agnostic Algorithm for Bayes Error Determination in Binary Classification

This paper presents the intrinsic limit determination algorithm (ILD Alg...
research
11/23/2021

ptype-cat: Inferring the Type and Values of Categorical Variables

Type inference is the task of identifying the type of values in a data c...
research
03/03/2023

On the complexity of PAC learning in Hilbert spaces

We study the problem of binary classification from the point of view of ...
research
02/21/2020

cutpointr: Improved Estimation and Validation of Optimal Cutpoints in R

'Optimal cutpoints' for binary classification tasks are often establishe...
research
03/15/2019

A Faster Algorithm Enumerating Relevant Features over Finite Fields

A k-junta function is a function which depends on only k coordinates of ...
research
03/11/2019

Un duel probabiliste pour départager deux présidents (LIA @ DEFT'2005)

We present a set of probabilistic models applied to binary classificatio...

Please sign up or login with your details

Forgot password? Click here to reset