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.1332977e-05
Overall Rank
9,645 | 35.35%
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.00049435337
100 HoloClean: Holistic Data Repairs with Probabilistic Inference 2017 VLDB 0.00033951027
158 Deep Learning for Entity Matching: A Design Space Exploration 2018 SIGMOD 0.00028049555
165 Mining Frequent Patterns without Candidate Generation 2000 SIGMOD 0.00027323925
348 Discovering Denial Constraints 2013 VLDB 0.00020216677
459 Distributed Representations of Tuples for Entity Resolution 2018 VLDB 0.00017863654
602 A Hybrid Approach to Functional Dependency Discovery 2016 SIGMOD 0.00015670535
723 Dynamic Itemset Counting and Implication Rules for Market Basket Data 1997 SIGMOD 0.00014470041
727 Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms 2015 VLDB 0.00014426954
853 HoloDetect: Few-Shot Learning for Error Detection 2019 SIGMOD 0.00013437314
1,033 On Generating Near-Optimal Tableaux for Conditional Functional Dependencies 2008 VLDB 0.00012373297
1,489 Synthesizing Entity Matching Rules by Examples 2018 VLDB 0.00010480559
1,490 Efficient Discovery of Approximate Dependencies 2018 VLDB 0.0001047928
1,627 Efficient Denial Constraint Discovery with Hydra 2018 VLDB 0.00010021689
1,731 Raha: A Configuration-Free Error Detection System 2019 SIGMOD 9.7585913e-05
2,271 ZeroER: Entity Resolution using Zero Labeled Examples 2020 SIGMOD 8.7110698e-05
2,451 Approximate Denial Constraints 2020 VLDB 8.4303553e-05
2,520 Deep Learning for Blocking in Entity Matching: A Design Space Exploration 2021 VLDB 8.3343971e-05
3,205 A Statistical Perspective on Discovering Functional Dependencies in Noisy Data 2020 SIGMOD 7.5221127e-05
3,797 SLiMFast: Guaranteed Results for Data Fusion and Source Reliability 2017 SIGMOD 6.9951279e-05
4,080 Smurf: Self-Service String Matching Using Random Forests 2019 VLDB 6.8020845e-05
4,838 Association Rules with Graph Patterns 2015 VLDB 6.3753978e-05
5,156 Distributed implementations of dependency discovery algorithms 2019 VLDB 6.2366568e-05
5,544 MDedup: Duplicate Detection with Matching Dependencies 2020 VLDB 6.0726379e-05
6,539 Parallel Discrepancy Detection and Incremental Detection 2021 VLDB 5.7351897e-05
10,373 Parallel Rule Discovery from Large Datasets by Sampling 2022 SIGMOD 5.0005386e-05
Previous Page 1 / 1 Next

Semantically Similar Papers