{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:22:59Z","timestamp":1768278179977,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030109271","type":"print"},{"value":"9783030109288","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-10928-8_33","type":"book-chapter","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T08:19:39Z","timestamp":1548317979000},"page":"552-568","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Revisiting Conditional Functional Dependency Discovery: Splitting the \u201cC\u201d from the \u201cFD\u201d"],"prefix":"10.1007","author":[{"given":"Joeri","family":"Rammelaere","sequence":"first","affiliation":[]},{"given":"Floris","family":"Geerts","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,23]]},"reference":[{"key":"33_CR1","unstructured":"Abedjan, Z., Schulze, P., Naumann, F.: DFD: efficient functional dependency discovery. In: CIKM, pp. 949\u2013958. ACM (2014)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, pp. 207\u2013216. ACM (1993)","DOI":"10.1145\/170036.170072"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-45372-5_8","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"J-F Boulicaut","year":"2000","unstructured":"Boulicaut, J.-F., Bykowski, A., Rigotti, C.: Approximation of frequency queries by means of free-sets. In: Zighed, D.A., Komorowski, J., \u017bytkow, J. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 75\u201385. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45372-5_8"},{"key":"33_CR4","unstructured":"Chiang, F.: Data Quality Through Active Constraint Discovery and Maintenance. Ph.D. thesis, University of Toronto (Canada) (2012)"},{"issue":"1","key":"33_CR5","first-page":"1166","volume":"1","author":"F Chiang","year":"2008","unstructured":"Chiang, F., Miller, R.J.: Discovering data quality rules. PVLDB 1(1), 1166\u20131177 (2008)","journal-title":"PVLDB"},{"issue":"3","key":"33_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1504\/IJDMMM.2012.048104","volume":"4","author":"T Diallo","year":"2012","unstructured":"Diallo, T., Novelli, N., Petit, J.M.: Discovering (frequent) constant conditional functional dependencies. IJDMMM 4(3), 205\u2013223 (2012)","journal-title":"IJDMMM"},{"key":"33_CR7","series-title":"Synthesis Lectures on Data Management","doi-asserted-by":"publisher","DOI":"10.2200\/S00439ED1V01Y201207DTM030","volume-title":"Foundations of Data Quality Management","author":"W Fan","year":"2012","unstructured":"Fan, W., Geerts, F.: Foundations of Data Quality Management. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2012)"},{"issue":"2","key":"33_CR8","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1366102.1366103","volume":"33","author":"W Fan","year":"2008","unstructured":"Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for capturing data inconsistencies. TODS 33(2), 6 (2008)","journal-title":"TODS"},{"issue":"5","key":"33_CR9","first-page":"683","volume":"23","author":"W Fan","year":"2011","unstructured":"Fan, W., Geerts, F., Li, J., Xiong, M.: Discovering conditional functional dependencies. TKDE 23(5), 683\u2013698 (2011)","journal-title":"TKDE"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Goethals, B., Page, W.L., Mannila, H.: Mining association rules of simple conjunctive queries. In: SDM, pp. 96\u2013107. SIAM (2008)","DOI":"10.1137\/1.9781611972788.9"},{"issue":"2","key":"33_CR11","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y Huhtala","year":"1999","unstructured":"Huhtala, Y., K\u00e4rkk\u00e4inen, J., Porkka, P., Toivonen, H.: TANE: an efficient algorithm for discovering functional and approximate dependencies. Comput. J. 42(2), 100\u2013111 (1999)","journal-title":"Comput. J."},{"issue":"4","key":"33_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1561\/1900000045","volume":"5","author":"IF Ilyas","year":"2015","unstructured":"Ilyas, I.F., Chu, X.: Trends in cleaning relational data: consistency and deduplication. Found. Trends Databases 5(4), 281\u2013393 (2015)","journal-title":"Found. Trends Databases"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Mandros, P., Boley, M., Vreeken, J.: Discovering reliable approximate functional dependencies. In: KDD, pp. 355\u2013363. ACM (2017)","DOI":"10.1145\/3097983.3098062"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-01815-2_9","volume-title":"Formal Concept Analysis","author":"R Medina","year":"2009","unstructured":"Medina, R., Nourine, L.: A unified hierarchy for functional dependencies, conditional functional dependencies and association rules. In: Ferr\u00e9, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol. 5548, pp. 98\u2013113. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01815-2_9"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44503-X_13","volume-title":"Database Theory \u2014 ICDT 2001","author":"N Novelli","year":"2001","unstructured":"Novelli, N., Cicchetti, R.: FUN: an efficient algorithm for mining functional and embedded dependencies. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 189\u2013203. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44503-X_13"},{"issue":"10","key":"33_CR16","first-page":"1082","volume":"8","author":"T Papenbrock","year":"2015","unstructured":"Papenbrock, T.: Functional dependency discovery: an experimental evaluation of seven algorithms. PVLDB 8(10), 1082\u20131093 (2015)","journal-title":"PVLDB"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: ICDT, pp. 398\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"33_CR18","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1, 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-03915-7_34","volume-title":"Advances in Intelligent Data Analysis VIII","author":"L Szathmary","year":"2009","unstructured":"Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: Efficient vertical mining of frequent closures and generators. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J.-F. (eds.) IDA 2009. LNCS, vol. 5772, pp. 393\u2013404. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03915-7_34"},{"key":"33_CR20","unstructured":"Yao, H., Hamilton, H.J., Butz, C.J.: Fd\\_mine: discovering functional dependencies in a database using equivalences. In: ICDM, pp. 729\u2013732. IEEE (2002)"},{"key":"33_CR21","unstructured":"Full version. https:\/\/bit.ly\/2II2oWq"},{"key":"33_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810114","volume-title":"Data Mining and Analysis: Fundamental Concepts and Algorithms","author":"MJ Zaki","year":"2014","unstructured":"Zaki, M.J., Meira Jr., W.: Data Mining and Analysis: Fundamental Concepts and Algorithms. Cambridge University Press, Cambridge (2014)"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W., et al.: New algorithms for fast discovery of association rules. In: KDD, pp. 283\u2013286 (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10928-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T01:07:50Z","timestamp":1705885670000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10928-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030109271","9783030109288"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10928-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ecmlpkdd2018.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"535","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"131","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}