Subgroup Discovery with Small and Alternative Feature Sets

Summary: Subgroup discovery with small and alternative feature sets: limit to few features, seek subgroups with other features. SMT-based formulation enables solver search; NP-hardness proven for both constraints; evaluation on datasets shows quality subgroups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 7334
Venue: SIGMOD
Year: 2025
Pagerank: 5.093636e-05
Overall Rank: 10,778 | 26.06%
DOI: 10.1145/3725358

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Jakob Bach (Karlsruhe Institute of Technology)

BibTeX Citation

@inproceedings{bach_sigmod25,
        title = {{Subgroup Discovery with Small and Alternative Feature Sets}},
        author = {Bach, Jakob},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725358},
        url = {https://dl.acm.org/doi/10.1145/3725358},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027981772
1,535	Exploratory Mining and Pruning Optimizations of Constrained Association Rules	1998	SIGMOD	0.00010463058
2,273	SliceLine: Fast, Linear-Algebra-based Slice Finding for ML Model Debugging	2021	SIGMOD	8.8230899e-05
3,190	Looking for Trouble: Analyzing Classifier Behavior via Pattern Divergence	2021	SIGMOD	7.6532441e-05
6,759	REDS: Rule Extraction for Discovering Scenarios	2021	SIGMOD	5.7827401e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,848	Efficient Discovery of Relaxed Functional Dependencies	2025	VLDB
2	9,393	Happiness Maximizing Sets under Group Fairness Constraints	2023	VLDB
3	10,112	Classifier Construction Under Budget Constraints	2022	SIGMOD
4	11,833	Regularizing Conjunctive Features for Classification	2019	PODS
5	8,584	Efficient Summarization Framework for Multi-Attribute Uncertain Data	2014	SIGMOD
6	5,034	Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases	1998	VLDB
7	11,790	Minimization of Classifier Construction Cost for Search Queries	2020	SIGMOD
8	7,918	Subspace Exploration: Bounds on Projected Frequency Estimation	2021	PODS
9	12,602	Detecting Clusters in Moderate-to-High Dimensional Data: Subspace Clustering, Pattern-based Clustering, and Correlation Clustering	2008	VLDB
10	3,190	Looking for Trouble: Analyzing Classifier Behavior via Pattern Divergence	2021	SIGMOD