Regularizing conjunctive features for classification

DOI10.1016/j.jcss.2021.01.003zbMath1477.68087OpenAlexW3129880345MaRDI QIDQ2662672

Pablo Barceló, Benny Kimelfeld, Alexander Baumgartner, Victor Dalmau

Publication date: 14 April 2021

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2021.01.003

zbMATH Keywords

classificationseparabilityconjunctive queriesgeneralized hypertree widthfeature generation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Uses Software

• glasso

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse inverse covariance estimation with the graphical lasso
• Minimizing the error of linear separators on linearly inseparable data
• Hypertree decompositions and tractable queries
• A new polynomial-time algorithm for linear programming
• Variable precision rough set model
• Robust trainability of single neurons
• Parametrized complexity theory.
• Distribution-based aggregation for relational learning with identifier attributes
• A Randomized Exhaustive Propositionalization Approach for Molecule Classification
• Beyond Hypertree Width: Decomposition Methods Without Decompositions
• Constraint solving via fractional edge covers
• Agnostic Learning of Monomials by Halfspaces Is Hard
• The Exact Complexity of the First-Order Logic Definability Problem
• Computer Science Logic
• Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
• Understanding Machine Learning
• The Product Homomorphism Problem and Applications

This page was built for publication: Regularizing conjunctive features for classification