Probabilistic learning of boolean functions applied to the binary classification problem with categorical covariates
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.
Code (1)
Tasks
Binary ClassificationGeneral ClassificationSimilar Papers 제목 키워드 기반
Correct classification for big/smart/fast data machine learning
Table (database) / Relational database Classification for big/smart/fast data machine learning is one of the most important tasks of predictive analytics and extracting valuable information from data. It is core applied …
BIG-bench Machine LearningClassificationGeneral ClassificationAdaptive n-ary Activation Functions for Probabilistic Boolean Logic
Balancing model complexity against the information contained in observed data is the central challenge to learning. In order for complexity-efficient models to exist and be discoverable in high dimensions, we require a c…
Logical Activation Functions: Logit-space equivalents of Probabilistic Boolean Operators
The choice of activation functions and their motivation is a long-standing issue within the neural network community. Neuronal representations within artificial neural networks are commonly understood as logits, represen…
Compositional Zero-Shot Learningimage-classificationImage ClassificationTransfer Learning+1Noise Sensitivity and Stability of Deep Neural Networks for Binary Classification
A first step is taken towards understanding often observed non-robustness phenomena of deep neural net (DNN) classifiers. This is done from the perspective of Boolean functions by asking if certain sequences of Boolean f…
Binary ClassificationSensitivityWeighted Positive Binary Decision Diagrams for Exact Probabilistic Inference
Recent work on weighted model counting has been very successfully applied to the problem of probabilistic inference in Bayesian networks. The probability distribution is encoded into a Boolean normal form and compiled to…