{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:13:43Z","timestamp":1742980423085,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031220630"},{"type":"electronic","value":"9783031220647"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22064-7_33","type":"book-chapter","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T19:02:04Z","timestamp":1669230124000},"page":"457-471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Graph-Walking Program Mining"],"prefix":"10.1007","author":[{"given":"Peter","family":"Belcak","sequence":"first","affiliation":[]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,24]]},"reference":[{"issue":"12","key":"33_CR1","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/3208071","volume":"61","author":"R Alur","year":"2018","unstructured":"Alur, R., Singh, R., Fisman, D., Solar-Lezama, A.: Search-based program synthesis. Commun. ACM 61(12), 84\u201393 (2018)","journal-title":"Commun. ACM"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS2006), pp. 475\u2013486. IEEE (2006)","DOI":"10.1109\/FOCS.2006.44"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-03536-9_5","volume-title":"Algorithms and Models for the Web Graph","author":"K Avrachenkov","year":"2013","unstructured":"Avrachenkov, K., Gon\u00e7alves, P., Sokol, M.: On the choice of kernel and labelled data in semi-supervised learning methods. In: Bonato, A., Mitzenmacher, M., Pra\u0142at, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 56\u201367. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03536-9_5"},{"key":"33_CR4","unstructured":"Bod\u00edk, R., Jobstmann, B.: Algorithmic program synthesis: introduction (2013)"},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-2496(75)90028-0","volume":"12","author":"RL Breiger","year":"1975","unstructured":"Breiger, R.L., Boorman, S.A., Arabie, P.: An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling. J. Math. Psychol. 12(3), 328\u2013383 (1975)","journal-title":"J. Math. Psychol."},{"key":"33_CR6","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: classification and regression trees. Statistics\/Probability Series, The Wadsworth (1984)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Burt, R.S.: Positions in networks. Social forces 55(1), 93\u2013122 (1976)","DOI":"10.2307\/2577097"},{"issue":"4","key":"33_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1080\/15427951.2016.1164100","volume":"12","author":"C Cooper","year":"2016","unstructured":"Cooper, C., Radzik, T., Siantos, Y.: Fast low-cost estimation of network properties using random walks. Internet Math. 12(4), 221\u2013238 (2016)","journal-title":"Internet Math."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Desai, A., et al.: Program synthesis using natural language. In: Proceedings of the 38th International Conference on Software Engineering, pp. 345\u2013356 (2016)","DOI":"10.1145\/2884781.2884786"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Ellis, K., et al.: Dreamcoder: bootstrapping inductive program synthesis with wake-sleep library learning. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pp. 835\u2013850 (2021)","DOI":"10.1145\/3453483.3454080"},{"issue":"4","key":"33_CR11","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/3296979.3192382","volume":"53","author":"Y Feng","year":"2018","unstructured":"Feng, Y., Martins, R., Bastani, O., Dillig, I.: Program synthesis using conflict-driven learning. ACM SIGPLAN Notices 53(4), 420\u2013435 (2018)","journal-title":"ACM SIGPLAN Notices"},{"issue":"6","key":"33_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/3140587.3062351","volume":"52","author":"Y Feng","year":"2017","unstructured":"Feng, Y., Martins, R., Van Geffen, J., Dillig, I., Chaudhuri, S.: Component-based synthesis of table consolidation and transformation tasks from examples. ACM SIGPLAN Notices 52(6), 422\u2013436 (2017)","journal-title":"ACM SIGPLAN Notices"},{"issue":"6","key":"33_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2813885.2737977","volume":"50","author":"JK Feser","year":"2015","unstructured":"Feser, J.K., Chaudhuri, S., Dillig, I.: Synthesizing data structure transformations from input-output examples. ACM SIGPLAN Notices 50(6), 229\u2013239 (2015)","journal-title":"ACM SIGPLAN Notices"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Gudes, E., Pertsev, A.: Mining module for adaptive xml path indexing. In: 16th International Workshop on Database and Expert Systems Applications (DEXA2005), pp. 1015\u20131019. IEEE (2005)","DOI":"10.1109\/DEXA.2005.134"},{"key":"33_CR15","unstructured":"Guha, S.: Efficiently mining frequent subpaths. In: Proceedings of the Eighth Australasian Data Mining Conference-vol. 101, pp. 11\u201315 (2009)"},{"key":"33_CR16","unstructured":"Huang, D., et al.: Neural program synthesis with query. In: International Conference on Learning Representations (2021)"},{"issue":"1","key":"33_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","volume":"1","author":"F Lorrain","year":"1971","unstructured":"Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. J. Math. Soc. 1(1), 49\u201380 (1971)","journal-title":"J. Math. Soc."},{"issue":"6","key":"33_CR18","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"AO Mendelzon","year":"1995","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Comput. 24(6), 1235\u20131258 (1995)","journal-title":"SIAM J. Comput."},{"key":"33_CR19","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Tech. rep, Stanford InfoLab (1999)"},{"key":"33_CR20","unstructured":"Quinlan, J.R.: C4. 5: programs for machine learning. Elsevier (2014)"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Wang, C., Cheung, A., Bodik, R.: Synthesizing highly expressive SQL queries from input-output examples. In: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 452\u2013466 (2017)","DOI":"10.1145\/3062341.3062365"},{"issue":"2","key":"33_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0378-8733(83)90025-4","volume":"5","author":"DR White","year":"1983","unstructured":"White, D.R., Reitz, K.P.: Graph and semigroup homomorphisms on networks of relations. Social Netw. 5(2), 193\u2013234 (1983)","journal-title":"Social Netw."},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"314","DOI":"10.2307\/270911","volume":"14","author":"C Winship","year":"1983","unstructured":"Winship, C., Mandel, M.: Roles and positions: a critique and extension of the blockmodeling approach. Sociol. Methodol. 14, 314\u2013344 (1983)","journal-title":"Sociol. Methodol."},{"issue":"6","key":"33_CR24","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1145\/2980983.2908088","volume":"51","author":"N Yaghmazadeh","year":"2016","unstructured":"Yaghmazadeh, N., Klinger, C., Dillig, I., Chaudhuri, S.: Synthesizing transformations on hierarchically structured data. ACM SIGPLAN Notices 51(6), 508\u2013521 (2016)","journal-title":"ACM SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22064-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T12:31:38Z","timestamp":1728477098000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22064-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031220630","9783031220647"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22064-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","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":"adma2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2022.uqcloud.net\/index.html","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":"CMT3","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"198","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":"72","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":"0","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":"36% - 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":"5","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)"}}]}}