{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T02:54:00Z","timestamp":1782356040688,"version":"3.54.5"},"publisher-location":"Singapore","reference-count":37,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819972531","type":"print"},{"value":"9789819972548","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-7254-8_35","type":"book-chapter","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:01:47Z","timestamp":1697864507000},"page":"451-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["FastAGEDs: Fast Approximate Graph Entity Dependency Discovery"],"prefix":"10.1007","author":[{"given":"Guangtong","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Selasi","family":"Kwashie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yidi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Bewong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent M.","family":"Nofong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junwei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Debo","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keqing","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shanmei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zaiwen","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"issue":"4","key":"35_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3129246","volume":"42","author":"CR Aberger","year":"2017","unstructured":"Aberger, C.R., Lamb, A., Tu, S., N\u00f6tzli, A., Olukotun, K., R\u00e9, C.: Emptyheaded: a relational engine for graph processing. ACM Trans. Database Syst. (TODS) 42(4), 1\u201344 (2017)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"35_CR2","unstructured":"Alipourlangouri, M., Chiang, F.: Keyminer: discovering keys for graphs. In: VLDB Workshop TD-LSG (2018)"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Bleifu\u00df, T., et al.: Approximate discovery of functional dependencies for large datasets. In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, pp. 1803\u20131812 (2016)","DOI":"10.1145\/2983323.2983781"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1007\/978-3-540-68125-0_84","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B Bringmann","year":"2008","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 858\u2013863. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68125-0_84"},{"issue":"2","key":"35_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10618-019-00667-7","volume":"34","author":"L Caruccio","year":"2020","unstructured":"Caruccio, L., Deufemia, V., Polese, G.: Mining relaxed functional dependencies from data. Data Min. Knowl. Disc. 34(2), 443\u2013477 (2020)","journal-title":"Data Min. Knowl. Disc."},{"issue":"7","key":"35_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.14778\/2732286.2732289","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy, M., Abdelhamid, E., Skiadopoulos, S., Kalnis, P.: GRAMI: frequent subgraph and pattern mining in a single large graph. Proc. VLDB Endowment 7(7), 517\u2013528 (2014)","journal-title":"Proc. VLDB Endowment"},{"issue":"12","key":"35_CR7","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.14778\/2824032.2824056","volume":"8","author":"W Fan","year":"2015","unstructured":"Fan, W., Fan, Z., Tian, C., Dong, X.L.: Keys for graphs. Proc. VLDB Endowment 8(12), 1590\u20131601 (2015)","journal-title":"Proc. VLDB Endowment"},{"issue":"3","key":"35_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3397198","volume":"45","author":"W Fan","year":"2020","unstructured":"Fan, W., Chunming, H., Liu, X., Ping, L.: Discovering graph functional dependencies. ACM Trans. Database Syst. (TODS) 45(3), 1\u201342 (2020)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Fan, W., Lu, P.: Dependencies for graphs. In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 403\u2013416 (2017)","DOI":"10.1145\/3034786.3056114"},{"issue":"2","key":"35_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3287285","volume":"44","author":"W Fan","year":"2019","unstructured":"Fan, W., Ping, L.: Dependencies for graphs. ACM Trans. Database Syst. (TODS) 44(2), 1\u201340 (2019)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"7","key":"35_CR11","doi-asserted-by":"publisher","first-page":"752","DOI":"10.14778\/3317315.3317318","volume":"12","author":"W Fan","year":"2019","unstructured":"Fan, W., Ping, L., Tian, C., Zhou, J.: Deducing certain fixes to graphs. Proc. VLDB Endowment 12(7), 752\u2013765 (2019)","journal-title":"Proc. VLDB Endowment"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Fan, W., Wu, Y., Xu, J.: Functional dependencies for graphs. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1843\u20131857 (2016)","DOI":"10.1145\/2882903.2915232"},{"issue":"6","key":"35_CR13","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.is.2003.10.006","volume":"29","author":"C Giannella","year":"2004","unstructured":"Giannella, C., Robertson, E.: On approximation measures for functional dependencies. Inf. Syst. 29(6), 483\u2013507 (2004)","journal-title":"Inf. Syst."},{"issue":"1","key":"35_CR14","doi-asserted-by":"publisher","first-page":"376","DOI":"10.14778\/1453856.1453900","volume":"1","author":"L Golab","year":"2008","unstructured":"Golab, L., Karloff, H., Korn, F., Srivastava, D., Bei, Yu.: On generating near-optimal tableaux for conditional functional dependencies. Proc. VLDB Endowment 1(1), 376\u2013390 (2008)","journal-title":"Proc. VLDB Endowment"},{"issue":"2","key":"35_CR15","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":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","volume":"149","author":"J Kivinen","year":"1995","unstructured":"Kivinen, J., Mannila, H.: Approximate inference of functional dependencies from relations. Theoret. Comput. Sci. 149(1), 129\u2013149 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Koudas, N., Saha, A., Srivastava, D., Venkatasubramanian, S.: Metric functional dependencies. In: 2009 IEEE 25th International Conference on Data Engineering, pp. 1275\u20131278. IEEE (2009)","DOI":"10.1109\/ICDE.2009.219"},{"key":"35_CR18","unstructured":"Kramer, S., Pfahringer, B.: E cient search for strong partial determinations. In: Proceedings of the International Conference on Knowledge Discover and Data Mining, pp. 371\u2013378. Citeseer (1996)"},{"issue":"7","key":"35_CR19","doi-asserted-by":"publisher","first-page":"759","DOI":"10.14778\/3192965.3192968","volume":"11","author":"S Kruse","year":"2018","unstructured":"Kruse, S., Naumann, F.: Efficient discovery of approximate dependencies. Proc. VLDB Endowment 11(7), 759\u2013772 (2018)","journal-title":"Proc. VLDB Endowment"},{"key":"35_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-08608-8_5","volume-title":"Databases Theory and Applications","author":"S Kwashie","year":"2014","unstructured":"Kwashie, S., Liu, J., Li, J., Ye, F.: Mining differential dependencies: a subspace clustering approach. In: Wang, H., Sharaf, M.A. (eds.) ADC 2014. LNCS, vol. 8506, pp. 50\u201361. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08608-8_5"},{"key":"35_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-23135-8_1","volume-title":"Advances in Databases and Information Systems","author":"S Kwashie","year":"2015","unstructured":"Kwashie, S., Liu, J., Li, J., Ye, F.: Conditional differential dependencies (CDDs). In: Morzy, T., Valduriez, P., Bellatreche, L. (eds.) ADBIS 2015. LNCS, vol. 9282, pp. 3\u201317. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23135-8_1"},{"key":"35_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-19548-3_1","volume-title":"Databases Theory and Applications","author":"S Kwashie","year":"2015","unstructured":"Kwashie, S., Liu, J., Li, J., Ye, F.: Efficient discovery of differential dependencies through association rules mining. In: Sharaf, M.A., Cheema, M.A., Qi, J. (eds.) ADC 2015. LNCS, vol. 9093, pp. 3\u201315. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19548-3_1"},{"issue":"6","key":"35_CR23","doi-asserted-by":"publisher","first-page":"653","DOI":"10.14778\/3311880.3311883","volume":"12","author":"S Kwashie","year":"2019","unstructured":"Kwashie, S., Liu, L., Liu, J., Stumptner, M., Li, J., Yang, L.: Certus: an effective entity resolution approach with graph differential dependencies (GDDs). Proc. VLDB Endowment 12(6), 653\u2013666 (2019)","journal-title":"Proc. VLDB Endowment"},{"issue":"4","key":"35_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s41019-018-0082-4","volume":"3","author":"P Lin","year":"2018","unstructured":"Lin, P., Song, Q., Yinghui, W.: Fact checking in knowledge graphs with ontological subgraph patterns. Data Sci. Eng. 3(4), 341\u2013358 (2018)","journal-title":"Data Sci. Eng."},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Liu, D., et al.: An efficient approach for discovering graph entity dependencies (GEDs). arXiv preprint arXiv:2301.06264 (2023)","DOI":"10.2139\/ssrn.4578555"},{"key":"35_CR26","unstructured":"Liu, J., Kwashie, S., Li, J., Ye, F., Vincent, M.: Discovery of approximate differential dependencies. arXiv preprint arXiv:1309.3733 (2013)"},{"issue":"2","key":"35_CR27","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TKDE.2010.197","volume":"24","author":"J Liu","year":"2010","unstructured":"Liu, J., Li, J., Liu, C., Chen, Y.: Discover dependencies from data-a review. IEEE Trans. Knowl. Data Eng. 24(2), 251\u2013264 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"10","key":"35_CR28","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.14778\/3339490.3339501","volume":"12","author":"H Ma","year":"2019","unstructured":"Ma, H., Alipourlangouri, M., Yinghui, W., Chiang, F., Pi, J.: Ontology-based entity matching in attributed graphs. Proc. VLDB Endowment 12(10), 1195\u20131207 (2019)","journal-title":"Proc. VLDB Endowment"},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Mandros, P., Boley, M., Vreeken, J.: Discovering reliable approximate functional dependencies. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 355\u2013363 (2017)","DOI":"10.1145\/3097983.3098062"},{"key":"35_CR30","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.J.: Dependency inference. In Proceedings of the 13th International Conference on Very Large Data Bases, pp. 155\u2013158 (1987)"},{"issue":"1","key":"35_CR31","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0169-023X(94)90023-X","volume":"12","author":"H Mannila","year":"1994","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.-J.: Algorithms for inferring functional dependencies from relations. Data Knowl. Eng. 12(1), 83\u201399 (1994)","journal-title":"Data Knowl. Eng."},{"key":"35_CR32","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":"35_CR33","doi-asserted-by":"crossref","unstructured":"Mhedhbi, A., Salihoglu, S.: Optimizing subgraph queries by combining binary and worst-case optimal joins. Proc. VLDB Endowment 12(11)","DOI":"10.14778\/3342263.3342643"},{"key":"35_CR34","unstructured":"Piatetsky-Shapiro, G.: Probabilistic data dependencies. In: Machine Discovery Workshop (Aberdeen, Scotland) (1992)"},{"key":"35_CR35","doi-asserted-by":"crossref","unstructured":"Reimherr, M., Nicolae, D.L.: On quantifying dependence: a framework for developing interpretable measures (2013)","DOI":"10.1214\/12-STS405"},{"key":"35_CR36","doi-asserted-by":"crossref","unstructured":"Teixeira, C.H., Fonseca, A.J., Serafini, M., Siganos, G., Zaki, M.J., Aboulnaga, A.: Arabesque: a system for distributed graph mining. In: Proceedings of the 25th Symposium on Operating Systems Principles, pp. 425\u2013440 (2015)","DOI":"10.1145\/2815400.2815410"},{"key":"35_CR37","unstructured":"Weytjens, S.: Approximate functional dependencies: a comparison of measures and a relevance focused tool for discovery (2021)"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems Engineering \u2013 WISE 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7254-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T05:08:03Z","timestamp":1697864883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7254-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819972531","9789819972548"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7254-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wise2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wise-conferences.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"137","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":"33","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":"40","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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}