{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:48:47Z","timestamp":1777873727689,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1261007500, 1261007210, 1942913"],"award-info":[{"award-number":["1261007500, 1261007210, 1942913"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141812838, N000142112966, N000142412466"],"award-info":[{"award-number":["N000141812838, N000142112966, N000142412466"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3736844","type":"proceedings-article","created":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T21:05:41Z","timestamp":1754255141000},"page":"2386-2397","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Anytime Algorithms for Approximate Functional Dependencies"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9994-1128","authenticated-orcid":false,"given":"Sanjivni","family":"Rana","sequence":"first","affiliation":[{"name":"University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5200-9272","authenticated-orcid":false,"given":"Junya","family":"Ogawa","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9166-2365","authenticated-orcid":false,"given":"Suraj","family":"Shetiya","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, Maharastra, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3475-8138","authenticated-orcid":false,"given":"Senjuti","family":"Basu Roy","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4627-9065","authenticated-orcid":false,"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0436-0"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0127-9"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904491"},{"key":"e_1_3_2_2_4_1","volume-title":"Dynamic programming. science 153, 3731","author":"Bellman Richard","year":"1966","unstructured":"Richard Bellman. 1966. Dynamic programming. science 153, 3731 (1966), 34-37."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920870"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639298"},{"key":"e_1_3_2_2_7_1","volume-title":"et al","author":"Breve Bernardo","year":"2022","unstructured":"Bernardo Breve, Loredana Caruccio, Vincenzo Deufemia, Giuseppe Polese, et al . 2022. RENUVER: A Missing Value Imputation Algorithm based on Relaxed Functional Dependencies.. In EDBT. 1-52."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3625097"},{"key":"e_1_3_2_2_9_1","volume-title":"Piero Fraternali, Silvia Quarteroni, Stefano Ceri, Alessandro Bozzon, Marco Brambilla, Emanuele Della Valle, et al.","author":"Ceri Stefano","year":"2013","unstructured":"Stefano Ceri, Alessandro Bozzon, Marco Brambilla, Emanuele Della Valle, Piero Fraternali, Silvia Quarteroni, Stefano Ceri, Alessandro Bozzon, Marco Brambilla, Emanuele Della Valle, et al. 2013. An introduction to information retrieval. Web information retrieval (2013), 3-11."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536262"},{"key":"e_1_3_2_2_11_1","first-page":"855","article-title":"Unbiased estimation of size and other aggregates over hidden web databases","author":"Dasgupta Arjun","year":"2010","unstructured":"Arjun Dasgupta, Xin Jin, Bradley Jewell, Nan Zhang, and Gautam Das. 2010. Unbiased estimation of size and other aggregates over hidden web databases. In ACM SIGMOD. 855-866.","journal-title":"ACM SIGMOD."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2010413.2010417"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3565011.3569056"},{"key":"e_1_3_2_2_14_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_3_2_2_15_1","volume-title":"Computers and intractability","author":"Garey Michael R","unstructured":"Michael R Garey and David S Johnson. 2002. Computers and intractability. Vol. 29. wh freeman New York."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28640"},{"key":"e_1_3_2_2_17_1","unstructured":"Gurobi Optimization LLC. 2024. Gurobi Optimizer Reference Manual. https: \/\/www.gurobi.com"},{"key":"e_1_3_2_2_18_1","volume-title":"TANE: An efficient algorithm for discovering functional and approximate dependencies. The computer journal 42, 2","author":"Huhtala Yka","year":"1999","unstructured":"Yka Huhtala, Juha K\u00e4rkk\u00e4inen, Pasi Porkka, and Hannu Toivonen. 1999. TANE: An efficient algorithm for discovering functional and approximate dependencies. The computer journal 42, 2 (1999), 100-111."},{"key":"e_1_3_2_2_19_1","unstructured":"Kaggle. 2024. Kaggle. https:\/\/www.kaggle.com\/datasets\/muhammadroshaanriaz\/ students-performance-dataset-cleaned Accessed: 2024-11-29."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258665"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00028-U"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514901"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192968"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192968"},{"key":"e_1_3_2_2_25_1","first-page":"140","article-title":"The lattice-based approaches for mining association rules: a review","volume":"6","author":"Le Tuong","year":"2016","unstructured":"Tuong Le and Bay Vo. 2016. The lattice-based approaches for mining association rules: a review. WIREs DMKD 6, 4 (2016), 140-151.","journal-title":"WIREs DMKD"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Marie Le Guilly Jean-Marc Petit and Vasile-Marian Scuturici. 2020. Evalu- ating 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_3_2_2_27_1","volume-title":"Approxi- mate denial constraints. arXiv preprint arXiv:2005.08540","author":"Livshits Ester","year":"2020","unstructured":"Ester Livshits, Alireza Heidari, Ihab F Ilyas, and Benny Kimelfeld. 2020. Approxi- mate denial constraints. arXiv preprint arXiv:2005.08540 (2020)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098062"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/373626.373713"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017093"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794377"},{"key":"e_1_3_2_2_32_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_3_2_2_33_1","first-page":"342","article-title":"Data-driven Schema Normaliza- tion","volume":"17","author":"Papenbrock Thorsten","year":"2017","unstructured":"Thorsten Papenbrock and Felix Naumann. 2017. Data-driven Schema Normaliza- tion.. In EDBT, Vol. 17. 342-353.","journal-title":"EDBT"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Marcel Parciak Sebastiaan Weytjens Niel Hens Frank Neven Liesbet M Peeters and Stijn Vansummeren. 2024. Measuring Approximate Functional Dependencies: a Comparative Study. In ICDE.","DOI":"10.1007\/s00778-025-00931-x"},{"key":"e_1_3_2_2_35_1","volume-title":"BFASTDC: A bitwise algorithm for mining denial constraints. In DEXA","author":"Pena Eduardo HM","year":"2018","unstructured":"Eduardo HM Pena and Eduardo Cunha de Almeida. 2018. BFASTDC: A bitwise algorithm for mining denial constraints. In DEXA 2018. Springer, 53-68."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368293"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574254"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377377"},{"key":"e_1_3_2_2_39_1","volume-title":"An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms","author":"Ramalingam Ganesan","year":"1996","unstructured":"Ganesan Ramalingam and Thomas Reps. 1996. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms (1996)."},{"key":"e_1_3_2_2_40_1","volume-title":"Convergence of the iterative proportional fitting procedure. The Annals of Statistics","author":"Ruschendorf Ludger","year":"1995","unstructured":"Ludger Ruschendorf. 1995. Convergence of the iterative proportional fitting procedure. The Annals of Statistics (1995), 1160-1174."},{"key":"e_1_3_2_2_41_1","volume-title":"Theory of linear and integer programming","author":"Schrijver Alexander","unstructured":"Alexander Schrijver. 1998. Theory of linear and integer programming. John Wiley & Sons."},{"key":"e_1_3_2_2_42_1","unstructured":"Avi Silberschatz Henry F. Korth and S. Sudarshan. 2020. Database System Concepts Seventh Edition. McGraw-Hill Book Company."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367538"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/130915303"},{"key":"e_1_3_2_2_45_1","volume-title":"Conference on learning theory. PMLR.","author":"Wang Yining","year":"2013","unstructured":"Yining Wang, Liwei Wang, Yuanzhi Li, Di He, and Tie-Yan Liu. 2013. A theoretical analysis of NDCG type ranking measures. In Conference on learning theory. PMLR."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402755.3402808"},{"key":"e_1_3_2_2_47_1","volume-title":"Using anytime algorithms in intelligent systems. AI magazine 17, 3","author":"Zilberstein Shlomo","year":"1996","unstructured":"Shlomo Zilberstein. 1996. Using anytime algorithms in intelligent systems. AI magazine 17, 3 (1996), 73-73."}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3736844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:15:23Z","timestamp":1777572923000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3736844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":47,"alternative-id":["10.1145\/3711896.3736844","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3736844","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}