Regularizing conjunctive features for classification

DOI10.1016/J.JCSS.2021.01.003MaRDI QIDQ2662672zbMATH OpenOpenAlexFDO

Authors Pablo Barceló, Alexander Baumgartner, Benny Kimelfeld, Víctor 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

classificationconjunctive queriesfeature generationgeneralized hypertree widthseparability

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2080453
• Learnability of solutions to conjunctive queries
• Learning join queries from user examples
• scientific article; zbMATH DE number 1953136
• Towards scalable and data efficient learning of Markov boundaries

Cites work

• A new polynomial-time algorithm for linear programming
• A randomized exhaustive propositionalization approach for molecule classification
• Beyond Hypertree Width: Decomposition Methods Without Decompositions
• Computer Science Logic
• Distribution-based aggregation for relational learning with identifier attributes
• Foundations of machine learning
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 6999908 (Why is no real title available?)
• scientific article; zbMATH DE number 1897911 (Why is no real title available?)
• Hypertree decompositions and tractable queries
• Learning first-order definable concepts over structures of small degree
• Minimizing the error of linear separators on linearly inseparable data
• Parametrized complexity theory.
• Robust trainability of single neurons
• Sparse inverse covariance estimation with the graphical lasso
• The complexity of reverse engineering problems for conjunctive queries
• The Exact Complexity of the First-Order Logic Definability Problem
• The product homomorphism problem and applications
• Tractable hypergraph properties for constraint satisfaction and conjunctive queries
• Understanding machine learning. From theory to algorithms
• Variable precision rough set model

Cited in

(4)

• Semiconormed possibility integrals and multi-feature pattern classification
• Learning concepts definable in first-order logic with counting
• The parameterized complexity of learning monadic second-order logic
• Learning aggregate queries defined by first-order logic with counting

Describes a project that uses

Uses Software

• glasso

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2662672)