{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:43:12Z","timestamp":1787017392588,"version":"build-2736575974"},"reference-count":125,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Royal Society Wolfson Research Merit Award","award":["WRM\/R1\/180014"],"award-info":[{"award-number":["WRM\/R1\/180014"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62202313"],"award-info":[{"award-number":["62202313"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2022A1515010120"],"award-info":[{"award-number":["2022A1515010120"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,5,26]]},"abstract":"<jats:p>This paper studies two questions about rule discovery. Can we characterize the usefulness of rules using quantitative criteria? How can we discover rules using those criteria? As a testbed, we consider entity enhancing rules (REEs), which subsume common association rules and data quality rules as special cases. We characterize REEs using a bi-criteria model, with both objective measures such as support and confidence, and subjective measures for the user's needs; we learn the subjective measure and the weight vectors via active learning. Based on the bi-criteria model, we develop a top-k algorithm to discover top-ranked REEs, and an any-time algorithm for successive discovery via lazy evaluation. We parallelize these algorithms such that they guarantee to reduce runtime when more processors are used. Using real-life and synthetic datasets, we show that the algorithms are able to find top-ranked rules and speed up conventional rule-discovery methods by 134X on average.<\/jats:p>","DOI":"10.1145\/3588924","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T13:42:05Z","timestamp":1685454125000},"page":"1-29","source":"Crossref","is-referenced-by-count":8,"title":["Discovering Top-k Rules using Subjective and Objective Criteria"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5149-2656","authenticated-orcid":false,"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[{"name":"Shenzhen Institute of Computing Sciences; University of Edinburgh; &amp; Beihang University, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6614-3755","authenticated-orcid":false,"given":"Ziyan","family":"Han","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5760-5145","authenticated-orcid":false,"given":"Yaoshu","family":"Wang","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2356-782X","authenticated-orcid":false,"given":"Min","family":"Xie","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2022. Drugbank. https:\/\/docs.drugbank.com\/xml\/#external-codes."},{"key":"e_1_2_2_2_1","unstructured":"2022. EJML library. http:\/\/ejml.org\/wiki\/index.php?title=Main_Page."},{"key":"e_1_2_2_3_1","unstructured":"2022. Full version. https:\/\/www.dropbox.com\/sh\/43p08bskxef96m2\/AADjihrBKVxvgPXwkVcRKIHla?dl=0&preview=paper-full-version.pdf."},{"key":"e_1_2_2_4_1","unstructured":"2022. Source code. https:\/\/www.dropbox.com\/sh\/43p08bskxef96m2\/AADjihrBKVxvgPXwkVcRKIHla?dl=0."},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661884"},{"key":"e_1_2_2_6_1","volume-title":"Foundations of Databases","author":"Abiteboul Serge","unstructured":"Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley."},{"key":"e_1_2_2_7_1","volume-title":"Estimating the cost of new drug development: is it really 802 million? Health affairs 25, 2","author":"Adams Christopher P","year":"2006","unstructured":"Christopher P Adams and Van V Brantner. 2006. Estimating the cost of new drug development: is it really 802 million? Health affairs 25, 2 (2006), 420--428."},{"key":"e_1_2_2_8_1","unstructured":"Rakesh Agrawal and Ramakrishnan Srikant. 1994. Fast Algorithms for Mining Association Rules in Large Databases. In VLDB Jorge B. Bocca Matthias Jarke and Carlo Zaniolo (Eds.)."},{"key":"e_1_2_2_9_1","article-title":"Learning Certifiably Optimal Rule Lists for Categorical Data","volume":"18","author":"Angelino Elaine","year":"2017","unstructured":"Elaine Angelino, Nicholas Larus-Stone, Daniel Alabi, Margo I. Seltzer, and Cynthia Rudin. 2017. Learning Certifiably Optimal Rule Lists for Categorical Data. J. Mach. Learn. Res. 18 (2017), 234:1--234:78.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Marcelo Arenas Leopoldo Bertossi and Jan Chomicki. 1999. Consistent Query Answers in Inconsistent Databases. In PODS.","DOI":"10.1145\/303976.303983"},{"key":"e_1_2_2_11_1","volume-title":"Bertossi","author":"Bahmani Zeinab","year":"2017","unstructured":"Zeinab Bahmani and Leopoldo E. Bertossi. 2017. Enforcing Relational Matching Dependencies with Datalog for Entity Resolution. In FLAIRS."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.4155\/fmc-2019-0307"},{"key":"e_1_2_2_13_1","volume-title":"Lakshmanan","author":"Bertossi Leopoldo E.","year":"2013","unstructured":"Leopoldo E. Bertossi, Solmaz Kolahi, and Laks V. S. Lakshmanan. 2013. Data Cleaning and Query Answering with Matching Dependencies and Matching Functions. Theory Comput. Syst. (2013)."},{"key":"e_1_2_2_14_1","volume-title":"Collective entity resolution in relational data. TKDD","author":"Bhattacharya Indrajit","year":"2007","unstructured":"Indrajit Bhattacharya and Lise Getoor. 2007. Collective entity resolution in relational data. TKDD (2007)."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157800"},{"key":"e_1_2_2_16_1","unstructured":"Leo Breiman J. H. Friedman R. A. Olshen and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth."},{"key":"e_1_2_2_17_1","volume-title":"Dynamic Itemset Counting and Implication Rules for Market Basket Data","author":"Brin Sergey","unstructured":"Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, and Shalom Tsur. 1997. Dynamic Itemset Counting and Implication Rules for Market Basket Data. In SIGMOD, Joan Peckham (Ed.). ACM Press, 255--264."},{"key":"e_1_2_2_18_1","volume-title":"et al","author":"Brown Tom B","year":"2020","unstructured":"Tom B Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, et al . 2020. Language models are few-shot learners. arXiv preprint arXiv:2005.14165 (2020)."},{"key":"e_1_2_2_19_1","first-page":"278","article-title":"Smurf: Self-Service String Matching Using Random Forests","volume":"12","author":"Adel Ardalan Paul Suganthan G. C.","year":"2018","unstructured":"Paul Suganthan G. C., Adel Ardalan, AnHai Doan, and Aditya Akella. 2018. Smurf: Self-Service String Matching Using Random Forests. PVLDB 12, 3 (2018), 278--291.","journal-title":"PVLDB"},{"key":"e_1_2_2_20_1","volume-title":"International Conference on Artificial Intelligence and Statistics (AISTATS)","volume":"84","author":"Chen Chaofan","year":"2018","unstructured":"Chaofan Chen and Cynthia Rudin. 2018. An Optimization Approach to Learning Falling Rule Lists. In International Conference on Artificial Intelligence and Statistics (AISTATS), Vol. 84. PMLR, 604--612."},{"key":"e_1_2_2_21_1","volume-title":"Highly Scalable Sequential Pattern Mining Based on MapReduce Model on the Cloud. In International Congress on Big Data. IEEE, 310--317","author":"Chen Chun-Chieh","year":"2013","unstructured":"Chun-Chieh Chen, Chi-Yao Tseng, and Ming-Syan Chen. 2013. Highly Scalable Sequential Pattern Mining Based on MapReduce Model on the Cloud. In International Congress on Big Data. IEEE, 310--317."},{"key":"e_1_2_2_22_1","volume-title":"An Overview of End-to-End Entity Resolution for Big Data. ACM Comput. Surv. 53, 6","author":"Christophides Vassilis","year":"2021","unstructured":"Vassilis Christophides, Vasilis Efthymiou, Themis Palpanas, George Papadakis, and Kostas Stefanidis. 2021. An Overview of End-to-End Entity Resolution for Big Data. ACM Comput. Surv. 53, 6 (2021), 127:1--127:42."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536262"},{"key":"e_1_2_2_24_1","volume-title":"Fast Effective Rule Induction. In International Conference on Machine Learning. Morgan Kaufmann, 115--123","author":"Cohen William W.","year":"1995","unstructured":"William W. Cohen. 1995. Fast Effective Rule Induction. In International Conference on Machine Learning. Morgan Kaufmann, 115--123."},{"key":"e_1_2_2_25_1","volume-title":"Mattingly","author":"Davis Allan Peter","year":"2019","unstructured":"Allan Peter Davis, Cynthia J. Grondin, Robin J. Johnson, Daniela Sciaky, Roy McMorran, Jolene Wiegers, Thomas C. Wiegers, and Carolyn J. Mattingly. 2019. The Comparative Toxicogenomics Database: update 2019. Nucleic Acids Res. 47, Database-Issue (2019), D948--D954."},{"key":"e_1_2_2_26_1","volume-title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In NAACL-HLT. 4171--4186.","author":"Devlin Jacob","year":"2019","unstructured":"Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In NAACL-HLT. 4171--4186."},{"key":"e_1_2_2_27_1","volume-title":"New drug development in the United States from 1963 to","author":"Dimasi J A.","year":"1999","unstructured":"J A. Dimasi. 2001. New drug development in the United States from 1963 to 1999. In Clinical pharmacology and therapeutics vol. 69,5."},{"key":"e_1_2_2_28_1","unstructured":"Honghua Dong Jiayuan Mao Tian Lin Chong Wang Lihong Li and Denny Zhou. 2019. Neural Logic Machines. In ICLR."},{"key":"e_1_2_2_29_1","volume-title":"Exploiting drug--disease relationships for computational drug repositioning. Briefings in bioinformatics 12, 4","author":"Dudley Joel T","year":"2011","unstructured":"Joel T Dudley, Tarangini Deshpande, and Atul J Butte. 2011. Exploiting drug--disease relationships for computational drug repositioning. Briefings in bioinformatics 12, 4 (2011), 303--311."},{"key":"e_1_2_2_30_1","volume-title":"Measurable Multiattribute Value Functions. Operations Research 27 (08","author":"Dyer James","year":"1979","unstructured":"James Dyer and Rakesh Sarin. 1979. Measurable Multiattribute Value Functions. Operations Research 27 (08 1979), 810--822."},{"key":"e_1_2_2_31_1","first-page":"1454","article-title":"Distributed Representations of Tuples for Entity Resolution","volume":"11","author":"Ebraheem Muhammad","year":"2018","unstructured":"Muhammad Ebraheem, Saravanan Thirumuruganathan, Shafiq R. Joty, Mourad Ouzzani, and Nan Tang. 2018. Distributed Representations of Tuples for Entity Resolution. PVLDB 11, 11 (2018), 1454--1467.","journal-title":"PVLDB"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0206-6"},{"key":"e_1_2_2_33_1","volume-title":"Conditional functional dependencies for capturing data inconsistencies. TODS 33, 2","author":"Fan Wenfei","year":"2008","unstructured":"Wenfei Fan, Floris Geerts, Xibei Jia, and Anastasios Kementsietsidis. 2008. Conditional functional dependencies for capturing data inconsistencies. TODS 33, 2 (2008), 6:1--6:48."},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.154"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2631923"},{"key":"e_1_2_2_36_1","unstructured":"Wenfei Fan Ziyan Han Yaoshu Wang and Min Xie. 2022. Parallel Rule Discovery from Large Datasets by Sampling. In SIGMOD."},{"key":"e_1_2_2_37_1","volume-title":"Unifying Logic Rules and Machine Learning for Entity Enhancing. Science China Information Sciences","author":"Fan Wenfei","year":"2020","unstructured":"Wenfei Fan, Ping Lu, and Chao Tian. 2020. Unifying Logic Rules and Machine Learning for Entity Enhancing. Science China Information Sciences (2020)."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457400"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824048"},{"key":"e_1_2_2_40_1","volume-title":"Database dependency discovery: A machine learning approach. AI communications 12, 3","author":"Flach Peter A","year":"1999","unstructured":"Peter A Flach and Iztok Savnik. 1999. Database dependency discovery: A machine learning approach. AI communications 12, 3 (1999), 139--160."},{"key":"e_1_2_2_41_1","volume-title":"Alexopoulos","author":"Fotis Chris","year":"2017","unstructured":"Chris Fotis, Asier Antoranz, Dimitris Hatziavramidis, Theodore Sakellaropoulos, and Leonidas G. Alexopoulos. 2017. Pathway-based technologies for early drug discovery. Drug Discovery Today (2017)."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"e_1_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Cheng Fu Xianpei Han Le Sun Bo Chen Wei Zhang Suhui Wu and Hao Kong. 2019. End-to-end multi-perspective matching for entity resolution. In IJCAI. 4961--4967.","DOI":"10.24963\/ijcai.2019\/689"},{"key":"e_1_2_2_44_1","volume-title":"Incremental Reduced Error Pruning. In International Conference on Machine Learning. Morgan Kaufmann, 70--77","author":"F\u00fcrnkranz Johannes","year":"1994","unstructured":"Johannes F\u00fcrnkranz and Gerhard Widmer. 1994. Incremental Reduced Error Pruning. In International Conference on Machine Learning. Morgan Kaufmann, 70--77."},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314107"},{"key":"e_1_2_2_46_1","volume-title":"Parallel mining of dependencies","author":"Garnaud Eve","unstructured":"Eve Garnaud, Nicolas Hanusse, Sofian Maabout, and No\u00ebl Novelli. 2014. Parallel mining of dependencies. In HPCS. IEEE, 491--498."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364332"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132960.1132963"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367564"},{"key":"e_1_2_2_50_1","volume-title":"On generating near-optimal tableaux for conditional functional dependencies. VLDB","author":"Golab Lukasz","year":"2008","unstructured":"Lukasz Golab, Howard Karloff, Flip Korn, Divesh Srivastava, and Bei Yu. 2008. On generating near-optimal tableaux for conditional functional dependencies. VLDB (2008)."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2004.03.003"},{"key":"e_1_2_2_52_1","unstructured":"Jiawei Han Jian Pei and Yiwen Yin. 2000. Mining Frequent Patterns without Candidate Generation. In SIGMOD."},{"key":"e_1_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Hado van Hasselt Arthur Guez and David Silver. 2016. Deep Reinforcement Learning with Double Q-Learning. In AAAI (Phoenix Arizona). 2094--2100.","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"e_1_2_2_54_1","doi-asserted-by":"crossref","unstructured":"Alireza Heidari Joshua McGrath Ihab F. Ilyas and Theodoros Rekatsinas. 2019. HoloDetect: Few-Shot Learning for Error Detection. In SIGMOD.","DOI":"10.1145\/3299869.3319888"},{"key":"e_1_2_2_55_1","volume-title":"Long short-term memory. Neural computation 9, 8","author":"Hochreiter Sepp","year":"1997","unstructured":"Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation 9, 8 (1997), 1735--1780."},{"key":"e_1_2_2_56_1","volume-title":"Seltzer","author":"Hu Xiyang","year":"2019","unstructured":"Xiyang Hu, Cynthia Rudin, and Margo I. Seltzer. 2019. Optimal Sparse Decision Trees. In NeurIPS. 7265--7273."},{"key":"e_1_2_2_57_1","volume-title":"TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. Comput. J.","author":"Huhtala Yk\u00e4","year":"1999","unstructured":"Yk\u00e4 Huhtala, Juha K\u00e4rkk\u00e4inen, Pasi Porkka, and Hannu Toivonen. 1999. TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. Comput. J. (1999)."},{"key":"e_1_2_2_58_1","volume-title":"Decisions with Multiple Objectives: Preferences and Value Trade-Offs. Systems, Man and Cybernetics","author":"Keeney Ralph","year":"1979","unstructured":"Ralph Keeney, Howard Raiffa, and David Rajala. 1979. Decisions with Multiple Objectives: Preferences and Value Trade-Offs. Systems, Man and Cybernetics, IEEE Transactions on 9 (08 1979), 403 -- 403."},{"key":"e_1_2_2_59_1","volume-title":"Parallel algorithms for mining of frequent itemsets. CoRR abs\/2108.05038","author":"Kessl Robert","year":"2021","unstructured":"Robert Kessl. 2021. Parallel algorithms for mining of frequent itemsets. CoRR abs\/2108.05038 (2021)."},{"key":"e_1_2_2_60_1","unstructured":"Elias B. Khalil Hanjun Dai Yuyu Zhang Bistra Dilkina and Le Song. 2017. Learning Combinatorial Optimization Algorithms over Graphs. In NeurIPS."},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920904"},{"key":"e_1_2_2_62_1","first-page":"712","article-title":"MDedup: Duplicate detection with matching dependencies","volume":"13","author":"Papenbrock Thorsten","year":"2020","unstructured":"loannis Koumarelas, Thorsten Papenbrock, and Felix Naumann. 2020. MDedup: Duplicate detection with matching dependencies. PVLDB 13, 5 (2020), 712--725.","journal-title":"PVLDB"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192968"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90192-K"},{"key":"e_1_2_2_65_1","volume-title":"Albert: A lite bert for self-supervised learning of language representations. arXiv preprint arXiv:1909.11942","author":"Lan Zhenzhong","year":"2019","unstructured":"Zhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel, Piyush Sharma, and Radu Soricut. 2019. Albert: A lite bert for self-supervised learning of language representations. arXiv preprint arXiv:1909.11942 (2019)."},{"key":"e_1_2_2_66_1","volume-title":"Improving the Efficiency and Effectiveness for BERT-based Entity Resolution","author":"Li Bing","unstructured":"Bing Li, Yukai Miao, Yaoshu Wang, Yifang Sun, and Wei Wang. 2021. Improving the Efficiency and Effectiveness for BERT-based Entity Resolution. In AAAI. AAAI Press, 13226--13233."},{"key":"e_1_2_2_67_1","volume-title":"Muhammad Asif Ali, and Yi Wang","author":"Li Bing","year":"2020","unstructured":"Bing Li, Wei Wang, Yifang Sun, Linhan Zhang, Muhammad Asif Ali, and Yi Wang. 2020. GraphER: Token-Centric Entity Resolution with Graph Convolutional Neural Networks.. In AAAI. 8172--8179."},{"key":"e_1_2_2_68_1","doi-asserted-by":"crossref","unstructured":"Weibang Li Zhanhuai Li Qun Chen Tao Jiang and Hailong Liu. 2015. Discovering functional dependencies in vertically distributed big data. In WISE. 199--207.","DOI":"10.1007\/978-3-319-26187-4_15"},{"key":"e_1_2_2_69_1","doi-asserted-by":"crossref","unstructured":"Weibang Li Zhanhuai Li Qun Chen Tao Jiang and Zhilei Yin. 2016. Discovering approximate functional dependencies from distributed big data. In APWeb. 289--301.","DOI":"10.1007\/978-3-319-45817-5_23"},{"key":"e_1_2_2_70_1","volume-title":"Deep Entity Matching with Pre-Trained Language Models. arXiv preprint arXiv:2004.00584","author":"Li Yuliang","year":"2020","unstructured":"Yuliang Li, Jinfeng Li, Yoshihiko Suhara, AnHai Doan, and Wang-Chiew Tan. 2020. Deep Entity Matching with Pre-Trained Language Models. arXiv preprint arXiv:2004.00584 (2020)."},{"key":"e_1_2_2_71_1","volume-title":"Sequence-Growth: A Scalable and Effective Frequent Itemset Mining Algorithm for Big Data Based on MapReduce Framework. In International Congress on Big Data. IEEE, 393--400","author":"Liang Yen-Hui","year":"2015","unstructured":"Yen-Hui Liang and Shiow-Yang Wu. 2015. Sequence-Growth: A Scalable and Effective Frequent Itemset Mining Algorithm for Big Data Based on MapReduce Framework. In International Congress on Big Data. IEEE, 393--400."},{"key":"e_1_2_2_72_1","volume-title":"Generalized and Scalable Optimal Sparse Decision Trees. In International Conference on Machine Learning (ICML)","volume":"119","author":"Lin Jimmy","unstructured":"Jimmy Lin, Chudi Zhong, Diane Hu, Cynthia Rudin, and Margo I. Seltzer. 2020. Generalized and Scalable Optimal Sparse Decision Trees. In International Conference on Machine Learning (ICML), Vol. 119. PMLR, 6150--6160."},{"key":"e_1_2_2_73_1","first-page":"362","article-title":"From idea to market: the drug approval process","volume":"14","author":"Lipsky Martin S","year":"2001","unstructured":"Martin S Lipsky and Lisa K Sharp. 2001. From idea to market: the drug approval process. The Journal of the American Board of Family Practice 14, 5 (2001), 362--367.","journal-title":"The Journal of the American Board of Family Practice"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_2_2_75_1","volume-title":"Roberta: A robustly optimized bert pretraining approach. arXiv preprint arXiv:1907.11692","author":"Liu Yinhan","year":"2019","unstructured":"Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. 2019. Roberta: A robustly optimized bert pretraining approach. arXiv preprint arXiv:1907.11692 (2019)."},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401966"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46439-5_24"},{"key":"e_1_2_2_78_1","volume-title":"Samuel Madden, Mourad Ouzzani, Michael Stonebraker, and Nan Tang.","author":"Mahdavi Mohammad","year":"2019","unstructured":"Mohammad Mahdavi, Ziawasch Abedjan, Raul Castro Fernandez, Samuel Madden, Mourad Ouzzani, Michael Stonebraker, and Nan Tang. 2019. Raha: A Configuration-Free Error Detection System. In SIGMOD. 865--882."},{"key":"e_1_2_2_79_1","volume-title":"Parallel association rule mining based on FI-growth algorithm","author":"Manaskasemsak Bundit","unstructured":"Bundit Manaskasemsak, Nunnapus Benjamas, Arnon Rungsawang, Athasit Surarerks, and Putchong Uthayopas. 2007. Parallel association rule mining based on FI-growth algorithm. In ICPADS. IEEE, 1--8."},{"key":"e_1_2_2_80_1","volume-title":"Seltzer","author":"McTavish Hayden","year":"2022","unstructured":"Hayden McTavish, Chudi Zhong, Reto Achermann, Ilias Karimalis, Jacques Chen, Cynthia Rudin, and Margo I. Seltzer. 2022. Fast Sparse Decision Tree Optimization via Reference Ensembles. In AAAI."},{"key":"e_1_2_2_81_1","unstructured":"Volodymyr Mnih Koray Kavukcuoglu David Silver Andrei A. Rusu Joel Veness Marc G. Bellemare Alex Graves Martin A. Riedmiller Andreas Fidjeland Georg Ostrovski Stig Petersen Charles Beattie Amir Sadik Ioannis Antonoglou Helen King Dharshan Kumaran Daan Wierstra Shane Legg and Demis Hassabis. 2015. Human-level control through deep reinforcement learning. Nat. (2015)."},{"key":"e_1_2_2_82_1","doi-asserted-by":"crossref","unstructured":"Sidharth Mudgal Han Li Theodoros Rekatsinas AnHai Doan Youngchoon Park Ganesh Krishnan Rohit Deep Esteban Arcaute and Vijay Raghavendra. 2018. Deep learning for entity matching: A design space exploration. In SIGMOD.","DOI":"10.1145\/3183713.3196926"},{"key":"e_1_2_2_83_1","volume-title":"Muggleton and Luc De Raedt","author":"Stephen","year":"1994","unstructured":"Stephen H. Muggleton and Luc De Raedt. 1994. Inductive Logic Programming: Theory and Methods. J. Log. Program. 19\/20 (1994), 629--679."},{"key":"e_1_2_2_84_1","volume-title":"Fun: An efficient algorithm for mining functional and embedded dependencies","author":"Novelli Noel","year":"2001","unstructured":"Noel Novelli and Rosine Cicchetti. 2001. Fun: An efficient algorithm for mining functional and embedded dependencies. In ICDT. Springer, 189--203."},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794377"},{"key":"e_1_2_2_86_1","doi-asserted-by":"crossref","unstructured":"Thorsten Papenbrock and Felix Naumann. 2016. A Hybrid Approach to Functional Dependency Discovery. In SIGMOD.","DOI":"10.1145\/2882903.2915203"},{"key":"e_1_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368293"},{"key":"e_1_2_2_88_1","doi-asserted-by":"crossref","unstructured":"Matthew E. Peters Mark Neumann Mohit Iyyer Matt Gardner Christopher Clark Kenton Lee and Luke Zettlemoyer. 2018. Deep contextualized word representations. In NAACL.","DOI":"10.18653\/v1\/N18-1202"},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809992"},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116251"},{"key":"e_1_2_2_91_1","unstructured":"J. Ross Quinlan. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann."},{"key":"e_1_2_2_92_1","unstructured":"J. Ross Quinlan. 2004. Data Mining Tools See5 and C5.0."},{"key":"e_1_2_2_93_1","volume-title":"Language models are unsupervised multitask learners. OpenAI blog 1, 8","author":"Radford Alec","year":"2019","unstructured":"Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. 2019. Language models are unsupervised multitask learners. OpenAI blog 1, 8 (2019), 9."},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-018-0112-0"},{"key":"e_1_2_2_95_1","doi-asserted-by":"crossref","unstructured":"Nils Reimers and Iryna Gurevych. 2019. Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. In EMNLP-IJCNLP. 3980--3990.","DOI":"10.18653\/v1\/D19-1410"},{"key":"e_1_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137631"},{"key":"e_1_2_2_97_1","doi-asserted-by":"crossref","unstructured":"Theodoros Rekatsinas Manas Joglekar Hector Garcia-Molina Aditya G. Parameswaran and Christopher R\u00e9. 2017. SLiMFast: Guaranteed Results for Data Fusion and Source Reliability. In SIGMOD. 1399--1414.","DOI":"10.1145\/3035918.3035951"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-019-0048-x"},{"key":"e_1_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2567773"},{"key":"e_1_2_2_100_1","volume-title":"a distilled version of BERT: smaller, faster, cheaper and lighter. CoRR abs\/1910.01108","author":"Sanh Victor","year":"2019","unstructured":"Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf. 2019. DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter. CoRR abs\/1910.01108 (2019)."},{"key":"e_1_2_2_101_1","volume-title":"Distributed discovery of functional dependencies","author":"Saxena Hemant","unstructured":"Hemant Saxena, Lukasz Golab, and Ihab F Ilyas. 2019. Distributed discovery of functional dependencies. In ICDE. IEEE, 1590--1593."},{"key":"e_1_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342638"},{"key":"e_1_2_2_103_1","first-page":"1","article-title":"Efficient Discovery of Matching Dependencies","volume":"45","author":"Schirmer Philipp","year":"2020","unstructured":"Philipp Schirmer, Thorsten Papenbrock, Ioannis Koumarelas, and Felix Naumann. 2020. Efficient Discovery of Matching Dependencies. RODS 45, 3 (2020), 1--33.","journal-title":"RODS"},{"key":"e_1_2_2_104_1","unstructured":"Philipp Schirmer Thorsten Papenbrock Sebastian Kruse Felix Naumann Dennis Hempfing Torben Mayer and Daniel Neusch\u00e4fer-Rube. 2019. DynFD: Functional Dependency Discovery in Dynamic Datasets. In EDBT."},{"key":"e_1_2_2_105_1","doi-asserted-by":"crossref","unstructured":"Shaoyun Shi Hanxiong Chen Weizhi Ma Jiaxin Mao Min Zhang and Yongfeng Zhang. 2020. Neural Logic Reasoning. In CIKM. 1365--1374.","DOI":"10.1145\/3340531.3411949"},{"key":"e_1_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149199"},{"key":"e_1_2_2_107_1","doi-asserted-by":"crossref","unstructured":"Shaoxu Song and Lei Chen. 2009. Discovering matching dependencies. In CIKM.","DOI":"10.1145\/1645953.1646135"},{"key":"e_1_2_2_108_1","volume-title":"Mining Sequential Patterns: Generalizations and Performance Improvements","author":"Srikant Ramakrishnan","unstructured":"Ramakrishnan Srikant and Rakesh Agrawal. 1996. Mining Sequential Patterns: Generalizations and Performance Improvements. In EDBT. Springer, 3--17."},{"key":"e_1_2_2_109_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_2_2_110_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476294"},{"key":"e_1_2_2_111_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44418-1_1"},{"key":"e_1_2_2_112_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_2_113_1","volume-title":"Honavar","author":"Vasile Flavian","year":"2006","unstructured":"Flavian Vasile, Adrian Silvescu, Dae-Ki Kang, and Vasant G. Honavar. 2006. TRIPPER: Rule Learning Using Taxonomies. In PAKDD."},{"key":"e_1_2_2_114_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N. Gomez Lukasz Kaiser and Illia Polosukhin. 2021. Attention is All you Need. In NeurIPS. 5998--6008."},{"key":"e_1_2_2_115_1","article-title":"A Bayesian Framework for Learning Rule Sets for Interpretable Classification","volume":"18","author":"Wang Tong","year":"2017","unstructured":"Tong Wang, Cynthia Rudin, Finale Doshi-Velez, Yimin Liu, Erica Klampfl, and Perry MacNeille. 2017. A Bayesian Framework for Learning Rule Sets for Interpretable Classification. J. Mach. Learn. Res. 18 (2017), 70:1--70:37.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_2_116_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0255-4"},{"key":"e_1_2_2_117_1","doi-asserted-by":"crossref","unstructured":"Renzhi Wu Sanya Chaba Saurabh Sawlani Xu Chu and Saravanan Thirumuruganathan. 2020. ZeroER: Entity Resolution using Zero Labeled Examples. In SIGMOD. 1149--1164.","DOI":"10.1145\/3318464.3389743"},{"key":"e_1_2_2_118_1","volume-title":"Robertson","author":"Wyss Catharine M.","year":"2001","unstructured":"Catharine M. Wyss, Chris Giannella, and Edward L. Robertson. 2001. FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances - Extended Abstract. In DaWak."},{"key":"e_1_2_2_119_1","volume-title":"Xlnet: Generalized autoregressive pretraining for language understanding. In NeurIPS. 5753--5763.","author":"Yang Zhilin","year":"2019","unstructured":"Zhilin Yang, Zihang Dai, Yiming Yang, Jaime Carbonell, Russ R Salakhutdinov, and Quoc V Le. 2019. Xlnet: Generalized autoregressive pretraining for language understanding. In NeurIPS. 5753--5763."},{"key":"e_1_2_2_120_1","volume-title":"Canada","author":"Yao H","unstructured":"H Yao, H Hamilton, and C Butz. 2002. Fd_mine: discovering functional dependencies in a database using equivalences, Canada. In IEEE ICDM. 1--15."},{"key":"e_1_2_2_121_1","unstructured":"Manzil Zaheer Satwik Kottur Siamak Ravanbakhsh Barnabas Poczos Ruslan R Salakhutdinov and Alexander J Smola. 2017. Deep Sets. In NeurIPS. 3391--3401."},{"key":"e_1_2_2_122_1","volume-title":"New Algorithms for Fast Discovery of Association Rules","author":"Zaki Mohammed Javeed","unstructured":"Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, and Wei Li. 1997. New Algorithms for Fast Discovery of Association Rules. In KDD. AAAI Press, 283--286."},{"key":"e_1_2_2_123_1","volume-title":"Toward better drug discovery with knowledge graph. Current opinion in structural biology 72","author":"Zeng Xiangxiang","year":"2022","unstructured":"Xiangxiang Zeng, Xinqi Tu, Yuansheng Liu, Xiangzheng Fu, and Yansen Su. 2022. Toward better drug discovery with knowledge graph. Current opinion in structural biology 72 (2022), 114--126."},{"key":"e_1_2_2_124_1","doi-asserted-by":"crossref","unstructured":"Yunjia Zhang Zhihan Guo and Theodoros Rekatsinas. 2020. A Statistical Perspective on Discovering Functional Dependencies in Noisy Data. In SIGMOD. 861--876.","DOI":"10.1145\/3318464.3389749"},{"key":"e_1_2_2_125_1","doi-asserted-by":"crossref","unstructured":"Chen Zhao and Yeye He. 2019. Auto-EM: End-to-end Fuzzy Entity-Matching using Pre-trained Deep Models and Transfer Learning. In WWW. 2413--2424.","DOI":"10.1145\/3308558.3313578"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588924","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:47:37Z","timestamp":1750164457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":125,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,26]]}},"alternative-id":["10.1145\/3588924"],"URL":"https:\/\/doi.org\/10.1145\/3588924","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}