DBScholar

Back to papers

Discovering Top-k Rules using Subjective and Objective Criteria

Summary: Proposes entity-enhancing rules (REEs) and a bi-criteria model that blends objective support and confidence with user-specific subjective criteria learned via active learning for top-k rule discovery. Introduces top-k and any-time lazy-discovery algorithms, parallelizable to reduce runtime with more cores, delivering up to 134x speedups over traditional rule discovery on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h3ecd580b3d94239b
Venue
SIGMOD
Year
2023
Pagerank
5.1527671e-05
Overall Rank
9,608 | 35.41%
DOI
10.1145/3588924

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fan_sigmod23,
        title = {{Discovering Top-k Rules using Subjective and Objective Criteria}},
        author = {Fan, Wenfei and Han, Ziyan and Wang, Yaoshu and Xie, Min},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3588924},
        url = {https://dl.acm.org/doi/10.1145/3588924},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 26 of 26 cited papers.

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

Rank Cited Paper Year Venue Pagerank
33 Consistent Query Answers in Inconsistent Databases 1999 PODS 0.00049349003
104 HoloClean: Holistic Data Repairs with Probabilistic Inference 2017 VLDB 0.00033690989
158 Deep Learning for Entity Matching: A Design Space Exploration 2018 SIGMOD 0.00028046388
164 Mining Frequent Patterns without Candidate Generation 2000 SIGMOD 0.00027412227
350 Discovering Denial Constraints 2013 VLDB 0.00020253521
457 Distributed Representations of Tuples for Entity Resolution 2018 VLDB 0.00017907103
603 A Hybrid Approach to Functional Dependency Discovery 2016 SIGMOD 0.00015699254
721 Dynamic Itemset Counting and Implication Rules for Market Basket Data 1997 SIGMOD 0.0001452081
727 Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms 2015 VLDB 0.00014443394
883 HoloDetect: Few-Shot Learning for Error Detection 2019 SIGMOD 0.00013268059
1,031 On Generating Near-Optimal Tableaux for Conditional Functional Dependencies 2008 VLDB 0.00012405065
1,488 Efficient Discovery of Approximate Dependencies 2018 VLDB 0.00010517437
1,493 Synthesizing Entity Matching Rules by Examples 2018 VLDB 0.00010505174
1,619 Efficient Denial Constraint Discovery with Hydra 2018 VLDB 0.00010055625
1,805 Raha: A Configuration-Free Error Detection System 2019 SIGMOD 9.59842e-05
2,323 ZeroER: Entity Resolution using Zero Labeled Examples 2020 SIGMOD 8.6348884e-05
2,443 Approximate Denial Constraints 2020 VLDB 8.4586656e-05
2,514 Deep Learning for Blocking in Entity Matching: A Design Space Exploration 2021 VLDB 8.3648432e-05
3,193 A Statistical Perspective on Discovering Functional Dependencies in Noisy Data 2020 SIGMOD 7.5505481e-05
3,791 SLiMFast: Guaranteed Results for Data Fusion and Source Reliability 2017 SIGMOD 7.0189865e-05
4,107 Smurf: Self-Service String Matching Using Random Forests 2019 VLDB 6.8026037e-05
4,858 Association Rules with Graph Patterns 2015 VLDB 6.3793644e-05
5,130 Distributed implementations of dependency discovery algorithms 2019 VLDB 6.2603084e-05
5,522 MDedup: Duplicate Detection with Matching Dependencies 2020 VLDB 6.0956156e-05
6,525 Parallel Discrepancy Detection and Incremental Detection 2021 VLDB 5.756805e-05
10,339 Parallel Rule Discovery from Large Datasets by Sampling 2022 SIGMOD 5.0195045e-05
Previous Page 1 / 1 Next

Semantically Similar Papers