Counting and enumerating aggregate classifiers

DOI10.1016/j.dam.2008.01.017zbMath1152.62351OpenAlexW2119630499MaRDI QIDQ955312

Frits C. R. Spieksma, Willy Gochet, Jan Adem, Yves Cramer

Publication date: 19 November 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.017

zbMATH Keywords

Boolean functionssupervised classificationweighted votinginteger sequence

Mathematics Subject Classification ID

Related Items (1)

Invariant continuous aggregation functions

Uses Software

• JBool
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bagging predictors
• Aggregating classifiers with mathematical programming
• Dualization of regular Boolean functions
• Polynomial-time algorithms for regular set-covering and threshold synthesis
• Dualization, decision lists and identification of monotone discrete functions
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Analyzing bagging
• Optimal aggregation of classifiers in statistical learning.
• Decompositions of positive self-dual Boolean functions
• Minimum self-dual decompositions of positive dual-minor Boolean functions
• Discrete Mathematics of Neural Networks
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• Enumeration of Threshold Functions of Eight Variables
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Counting and enumerating aggregate classifiers