Regularizing Conjunctive Features for Classification
Summary: Study of generating conjunctive-feature queries that linearly separate labeled entities, introducing regularizers on feature dimension, join count, and generalized hypertree width (ghw), plus approximate variants allowing bounded misclassification. Main results: separability is tractable for bounded ghw, explicit feature-generation is intractable due to potential query size, but classification can be done efficiently without materializing features under bounded ghw. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Pablo Barceló (IMFD Chile; University of Chile)
- 2. Alexander Baumgartner (Johannes Kepler University; University of Chile)
- 3. Victor Dalmau (Pompeu Fabra University)
- 4. Benny Kimelfeld (Technion)
BibTeX Citation
@inproceedings{barcelo_pods19,
address = {New York, NY, USA},
series = {{PODS} '19},
title = {{Regularizing Conjunctive Features for Classification}},
url = {https://dl.acm.org/doi/10.1145/3294052.3319680},
doi = {10.1145/3294052.3319680},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Barceló, Pablo and Baumgartner, Alexander and Dalmau, Victor and Kimelfeld, Benny},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,363 | Extremal Fitting Problems for Conjunctive Queries | 2023 | PODS | 5.093636e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 530 | An Analytical Study of Large SPARQL Query Logs | 2018 | VLDB | 0.0001709169 |
| 640 | Materialization Optimizations for Feature Selection Workloads | 2014 | SIGMOD | 0.00015409494 |
| 814 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00013841737 |
| 5,804 | A Relational Framework for Classifier Engineering | 2017 | PODS | 6.0829486e-05 |
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,728 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS |
| 2 | 11,523 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS |
| 3 | 2,266 | On Functional Aggregate Queries with Additive Inequalities | 2019 | PODS |
| 4 | 5,854 | Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis | 2023 | PODS |
| 5 | 2,678 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |
| 6 | 4,393 | Bounded Conjunctive Queries | 2014 | VLDB |
| 7 | 12,229 | The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity | 2013 | PODS |
| 8 | 9,009 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 9 | 11,790 | Minimization of Classifier Construction Cost for Search Queries | 2020 | SIGMOD |
| 10 | 5,804 | A Relational Framework for Classifier Engineering | 2017 | PODS |