{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T17:59:58Z","timestamp":1774979998340,"version":"3.50.1"},"reference-count":117,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"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":[[2024,10,1]]},"abstract":"<jats:p>\n                    This paper studies the problem of discovering top-\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    relevant and diversified rules. Given a real-life dataset, it is to mine a set of\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    rules that are as close to users' interest as possible, and meanwhile, as diverse to each other as possible. It aims to reduce excessive irrelevant rules commonly returned by rule discovery. As a testbed, we consider Entity Enhancing Rules (REEs), which subsume popular data quality rules as special cases. We train a relevance model to learn users' prior knowledge, rank rules based on users' need, and propose four diversity measures to assess the diversity between rules. Based on these measures, we formulate a new discovery problem. We show that the bi-criteria discovery problem is NP-complete and hard to approximate. This said, we develop a practical algorithm for the problem, and prove its approximation bounds under certain conditions. Moreover, we develop optimization techniques to speed up the process, and parallelize the algorithm such that it guarantees to reduce runtime when given more processors. Using real-life data, we empirically verify that on average, the top-10 REEs discovered by our algorithm is able to catch 77.5% of errors detected by the entire set \u03a3\n                    <jats:sub>all<\/jats:sub>\n                    of REEs and achieve F_1 = 0.74 for real error detection; moreover, discovering top-ranked REEs is 62.4X faster than mining \u03a3\n                    <jats:sub>all<\/jats:sub>\n                    .\n                  <\/jats:p>","DOI":"10.1145\/3677131","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T17:41:44Z","timestamp":1727718104000},"page":"1-28","source":"Crossref","is-referenced-by-count":2,"title":["Discovering Top-k Relevant and Diversified Rules"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5149-2656","authenticated-orcid":false,"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[{"name":"Beihang University &amp; Shenzhen Institute of Computing Sciences, &amp; University of Edinburgh, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6614-3755","authenticated-orcid":false,"given":"Ziyan","family":"Han","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1252-7489","authenticated-orcid":false,"given":"Guangyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shenzhen Technology University, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,9,30]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2022. EJML library. http:\/\/ejml.org\/wiki\/index.php?title=Main_Page."},{"key":"e_1_2_1_2_1","unstructured":"2024. Apple Corps Ltd. https:\/\/en.wikipedia.org\/wiki\/Apple_Corps."},{"key":"e_1_2_1_3_1","unstructured":"2024. Apple Inc. https:\/\/www.apple.com\/."},{"key":"e_1_2_1_4_1","unstructured":"2024. China Organization Code - An Introduction. https:\/\/www.chinacheckup.com\/blog\/china-organization-code."},{"key":"e_1_2_1_5_1","unstructured":"2024. Full version. https:\/\/drive.google.com\/drive\/folders\/1iEZAzt6xj8K-A-8oK5XMkLBLn-Vtb_SV?usp=sharing."},{"key":"e_1_2_1_6_1","unstructured":"2024. How To Find Your Company's Unified Social Credit Code in China. https:\/\/osome.com\/hk\/blog\/how-to-findyour-companys-uscc-in-china\/."},{"key":"e_1_2_1_7_1","unstructured":"2024. Rock. http:\/\/www.grandhoo.com\/en."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661884"},{"key":"e_1_2_1_9_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_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00059"},{"key":"e_1_2_1_11_1","unstructured":"Rakesh Agrawal and Ramakrishnan Srikant. 1994. Fast Algorithms for Mining Association Rules in Large Databases. In VLDB."},{"key":"e_1_2_1_12_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_1_13_1","doi-asserted-by":"crossref","unstructured":"Marcelo Arenas Leopoldo Bertossi and Jan Chomicki. 1999. Consistent Query Answers in Inconsistent Databases. In PODS. 68--79.","DOI":"10.1145\/303976.303983"},{"key":"e_1_2_1_14_1","volume-title":"Rock: Cleaning Data by Embedding ML in Logic Rules. In SIGMOD (industrial track).","author":"Bao Xianchun","year":"2024","unstructured":"Xianchun Bao, Zian Bao, Qingsong Duan, Wenfei Fan, Hui Lei, Daji Li, Wei Lin, Peng Liu, Zhicong Lv, Mingliang Ouyang, Jiale Peng, Jing Zhang, Runxiao Zhao, Shuai Tang, Shuping Zhou, Yaoshu Wang, Qiyuan Wei, Min Xie, Jing Zhang, Xin Zhang, Runxiao Zhao, and Shuping Zhou. 2024. Rock: Cleaning Data by Embedding ML in Logic Rules. In SIGMOD (industrial track)."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1177\/109442810033005"},{"key":"e_1_2_1_16_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_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157800"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3086464"},{"key":"e_1_2_1_19_1","unstructured":"Leo Breiman J. H. Friedman R. A. Olshen and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Jane Bromley Isabelle Guyon Yann LeCun Eduard S\u00e4ckinger and Roopak Shah. 1993. Signature verification using a \"Siamese\" time delay neural network. In Advances in neural information processing systems 6.","DOI":"10.1142\/9789812797926_0003"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Jaime Carbonell and Jade Goldstein. 1998. The use of MMR diversity-based reranking for reordering documents and producing summaries. In SIGIR. ACM 335--336.","DOI":"10.1145\/290941.291025"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1145"},{"key":"e_1_2_1_23_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_1_24_1","doi-asserted-by":"crossref","unstructured":"Kewei Cheng Jiahao Liu WeiWang and Yizhou Sun. 2022. RLogic: Recursive Logical Rule Learning from Knowledge Graphs. In KDD. ACM 179--189.","DOI":"10.1145\/3534678.3539421"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3418896"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536262"},{"key":"e_1_2_1_27_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_1_28_1","unstructured":"Anirban Dasgupta Ravi Kumar and Sujith Ravi. 2013. Summarization Through Submodularity and Dispersion. In ACL. ACL 1014--1022."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602136"},{"key":"e_1_2_1_30_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_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554899"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0206-6"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366103"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.154"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Wenfei Fan Ziyan Han Yaoshu Wang and Min Xie. 2022. Parallel Rule Discovery from Large Datasets by Sampling. In SIGMOD. ACM 384--398.","DOI":"10.1145\/3514221.3526165"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588924"},{"key":"e_1_2_1_37_1","volume-title":"Unifying logic rules and machine learning for entity enhancing. Sci. China Inf. Sci. 63, 7","author":"Fan Wenfei","year":"2020","unstructured":"Wenfei Fan, Ping Lu, and Chao Tian. 2020. Unifying logic rules and machine learning for entity enhancing. Sci. China Inf. Sci. 63, 7 (2020)."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457400"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536263"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824048"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Wenfei Fan Yinghui Wu and Jingbo Xu. 2016. Functional dependencies for graphs. In SIGMOD. 1843--1857.","DOI":"10.1145\/2882903.2915232"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_2_1_43_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_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34624-8_4"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Piero Fraternali Davide Martinenghi and Marco Tagliasacchi. 2012. Top-k bounded diversification. In SIGMOD. ACM 421--432.","DOI":"10.1145\/2213836.2213884"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"e_1_2_1_47_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_1_48_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael","unstructured":"Michael Garey and David Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364332"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132960.1132963"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453900"},{"key":"e_1_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Sreenivas Gollapudi and Aneesh Sharma. 2009. An axiomatic approach for result diversification. In WWW.","DOI":"10.1145\/1526709.1526761"},{"key":"e_1_2_1_53_1","volume-title":"Clique is hard to approximate within n\/sup 1-\/spl epsiv","author":"Hastad Johan","unstructured":"Johan Hastad. 1996. Clique is hard to approximate within n\/sup 1-\/spl epsiv. In FOCS. IEEE, 627--636."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3283-2"},{"key":"e_1_2_1_55_1","volume-title":"p-index--A Fair Alternative to h-index. Department of Automatics and Biomedical Engineering. Poland","author":"Horzyk Adrian","year":"2014","unstructured":"Adrian Horzyk. 2014. p-index--A Fair Alternative to h-index. Department of Automatics and Biomedical Engineering. Poland (2014)."},{"key":"e_1_2_1_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_1_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_1_58_1","volume-title":"Jian-Yun Nie, and Ming Yue.","author":"Jiang Zhengbao","year":"2017","unstructured":"Zhengbao Jiang, Ji-Rong Wen, Zhicheng Dou, Wayne Xin Zhao, Jian-Yun Nie, and Ming Yue. 2017. Learning to diversify search results via subtopic attention. In SIGIR. 545--554."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00028-U"},{"key":"e_1_2_1_60_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_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192968"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90192-K"},{"key":"e_1_2_1_63_1","doi-asserted-by":"crossref","unstructured":"Himabindu Lakkaraju Stephen H Bach and Jure Leskovec. 2016. Interpretable decision sets: A joint framework for description and prediction. In SIGKDD. ACM 1675--1684.","DOI":"10.1145\/2939672.2939874"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00057-9"},{"key":"e_1_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Marie Le Guilly Jean-Marc Petit and Vasile-Marian Scuturici. 2020. Evaluating classification feasibility using functional dependencies. Transactions on Large-Scale Data-and Knowledge-Centered Systems XLIV: Special Issue on Data Management--Principles Technologies and Applications (2020) 132--159.","DOI":"10.1007\/978-3-662-62271-1_5"},{"key":"e_1_2_1_66_1","unstructured":"Adam Lerer Ledell Wu Jiajun Shen Timoth\u00e9e Lacroix Luca Wehrstedt Abhijit Bose and Alex Peysakhovich. 2019. Pytorch-BigGraph: A Large Scale Graph Embedding System. In MLSys."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421431"},{"key":"e_1_2_1_68_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_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00067"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401966"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46439-5_24"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407801"},{"key":"e_1_2_1_73_1","doi-asserted-by":"crossref","unstructured":"Panagiotis Mandros Mario Boley and Jilles Vreeken. 2017. Discovering reliable approximate functional dependencies. In SIGKDD. 355--363.","DOI":"10.1145\/3097983.3098062"},{"key":"e_1_2_1_74_1","volume-title":"Knowledge Discovery in Databases","author":"Mannila Heikki","unstructured":"Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. 1994. Efficient Algorithms for Discovering Association Rules. In Knowledge Discovery in Databases: AAAI. AAAI Press, 181--192."},{"key":"e_1_2_1_75_1","volume-title":"IFIP Conference on Optimization Techniques. Springer, 234--243","author":"Minoux Michel","year":"2005","unstructured":"Michel Minoux. 2005. Accelerated greedy algorithms for maximizing submodular set functions. In IFIP Conference on Optimization Techniques. Springer, 234--243."},{"key":"e_1_2_1_76_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_1_77_1","volume-title":"An analysis of approximations for maximizing submodular set functions?I. Mathematical programming 14","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser, Laurence AWolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions?I. Mathematical programming 14 (1978), 265--294."},{"key":"e_1_2_1_78_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_1_79_1","first-page":"320","article-title":"The power of Student's t-test","volume":"60","author":"Owen Donald B","year":"1965","unstructured":"Donald B Owen. 1965. The power of Student's t-test. J. Amer. Statist. Assoc. 60, 309 (1965), 320--333.","journal-title":"J. Amer. Statist. Assoc."},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794377"},{"key":"e_1_2_1_81_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_1_82_1","volume-title":"Measuring Approximate Functional Dependencies: a Comparative Study. arXiv preprint arXiv:2312.06296","author":"Parciak Marcel","year":"2023","unstructured":"Marcel Parciak, Sebastiaan Weytjens, Niel Hens, Frank Neven, Liesbet M Peeters, and Stijn Vansummeren. 2023. Measuring Approximate Functional Dependencies: a Comparative Study. arXiv preprint arXiv:2312.06296 (2023)."},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368293"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103737"},{"key":"e_1_2_1_85_1","volume-title":"Jeffrey Xu Yu, and Lijun Chang","author":"Qin Lu","year":"2012","unstructured":"Lu Qin, Jeffrey Xu Yu, and Lijun Chang. 2012. Diversifying top-K results. PVLDB (2012)."},{"key":"e_1_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022643204877"},{"key":"e_1_2_1_87_1","unstructured":"J. Ross Quinlan. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann."},{"key":"e_1_2_1_88_1","unstructured":"J. Ross Quinlan. 2004. Data Mining Tools See5 and C5.0."},{"key":"e_1_2_1_89_1","volume-title":"Heuristic and special case algorithms for dispersion problems. Operations research 42, 2","author":"Ravi Sekharipuram S","year":"1994","unstructured":"Sekharipuram S Ravi, Daniel J Rosenkrantz, and Giri Kumar Tayi. 1994. Heuristic and special case algorithms for dispersion problems. Operations research 42, 2 (1994), 299--310."},{"key":"e_1_2_1_90_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_1_91_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137631"},{"key":"e_1_2_1_92_1","unstructured":"Rock. 2024. Entity Deduplication in a Major Domestic Research Institution. https:\/\/www.grandhoo.com\/en\/rock\/customer-case\/entity-reduction\/."},{"key":"e_1_2_1_93_1","unstructured":"Rock. 2024. Keyword Search in an Open Data Platform. https:\/\/www.grandhoo.com\/en\/rock\/customer-case\/fieldsearch\/."},{"key":"e_1_2_1_94_1","unstructured":"Rock. 2024. Multi-source Entity Resolution in a Commercial Bank. https:\/\/www.grandhoo.com\/en\/rock\/customercase\/ bank-entity\/."},{"key":"e_1_2_1_95_1","unstructured":"Rock. 2024. Regulatory Reporting in a Leading Bank in Shenzhen. https:\/\/www.grandhoo.com\/en\/rock\/customercase\/ bank-supervision\/."},{"key":"e_1_2_1_96_1","doi-asserted-by":"crossref","unstructured":"Sudeepa Roy and Dan Suciu. 2014. A formal approach to finding explanations for database queries. In SIGMOD. ACM 1579--1590.","DOI":"10.1145\/2588555.2588578"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2567773"},{"key":"e_1_2_1_98_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_1_99_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_1_100_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149199"},{"key":"e_1_2_1_101_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_1_102_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_1_103_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.113043"},{"key":"e_1_2_1_104_1","doi-asserted-by":"crossref","unstructured":"Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. ArnetMiner: Extraction and Mining of Academic Social Networks. In KDD. 990--998.","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_2_1_105_1","volume-title":"Maria Camila Nardini Barioni, Marios Hadjieleftheriou, Divesh Srivastava, Caetano Traina Jr., and Vassilis J. Tsotras.","author":"Vieira Marcos R.","year":"2011","unstructured":"Marcos R. Vieira, Humberto Luiz Razente, Maria Camila Nardini Barioni, Marios Hadjieleftheriou, Divesh Srivastava, Caetano Traina Jr., and Vassilis J. Tsotras. 2011. On query result diversification. In ICDE."},{"key":"e_1_2_1_106_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_1_107_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0255-4"},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536356"},{"key":"e_1_2_1_109_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_1_110_1","doi-asserted-by":"crossref","unstructured":"Dong Xin Hong Cheng Xifeng Yan and Jiawei Han. 2006. Extracting redundancy-aware top-k patterns. In SIGKDD. 444--453.","DOI":"10.1145\/1150402.1150452"},{"key":"e_1_2_1_111_1","volume-title":"Ada Wai-Chee Fu, and Ruifeng Liu","author":"Yang Zhengwei","year":"2016","unstructured":"Zhengwei Yang, Ada Wai-Chee Fu, and Ruifeng Liu. 2016. Diversified top-k subgraph querying in a large graph. In SIGMOD. 1167--1182."},{"key":"e_1_2_1_112_1","volume-title":"Butz","author":"Yao Hong","year":"2002","unstructured":"Hong Yao, Howard J. Hamilton, and Cory J. Butz. 2002. FD_Mine: Discovering functional dependencies in a database using equivalences. In IEEE ICDM. 1--15."},{"key":"e_1_2_1_113_1","volume-title":"ICML (Proceedings of Machine Learning Research)","volume":"80","author":"Yoon Jinsung","unstructured":"Jinsung Yoon, James Jordon, and Mihaela van der Schaar. 2018. GAIN: Missing Data Imputation using Generative Adversarial Nets. In ICML (Proceedings of Machine Learning Research), Vol. 80. PMLR, 5675--5684."},{"key":"e_1_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0408-z"},{"key":"e_1_2_1_115_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_1_116_1","doi-asserted-by":"crossref","unstructured":"Guangyi Zhang and Aristides Gionis. 2020. Diverse rule sets. In SIGKDD. ACM 1532--1541.","DOI":"10.1145\/3394486.3403204"},{"key":"e_1_2_1_117_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"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677131","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3677131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T17:11:52Z","timestamp":1774977112000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,30]]},"references-count":117,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,10,1]]}},"alternative-id":["10.1145\/3677131"],"URL":"https:\/\/doi.org\/10.1145\/3677131","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,30]]}}}