{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:22:43Z","timestamp":1742944963024,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819723027"},{"type":"electronic","value":"9789819723034"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-2303-4_2","type":"book-chapter","created":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T08:02:03Z","timestamp":1716883323000},"page":"16-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining Frequent Geo-Subgraphs in\u00a0a\u00a0Knowledge Graph"],"prefix":"10.1007","author":[{"given":"Yixin","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jingyan","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Dingming","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[]},{"given":"Kezhong","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,29]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abdelhamid, E., Canim, M., Sadoghi, M., Bhattacharjee, B., Chang, Y., Kalnis, P.: Incremental frequent subgraph mining on large evolving graphs. In: ICDE, pp. 1767\u20131768 (2018)","DOI":"10.1109\/ICDE.2018.00241"},{"key":"2_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499 (1994)"},{"key":"2_CR3","unstructured":"Alobaidi, I.A., Leopold, J.L., Allami, A.A.: The use of frequent subgraph mining to develop a recommender system for playing real-time strategy games. In: ICDM, pp. 146\u2013160 (2019)"},{"key":"2_CR4","unstructured":"Ashraf, N., et al.: Wefres: weighted frequent subgraph mining in a single large graph. In: ICDM, pp. 201\u2013215 (2019)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.G.: Dbpedia: a nucleus for a web of open data. In: ISWC, vol.\u00a04825, pp. 722\u2013735 (2007)","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Bollacker, K.D., Evans, C., Paritosh, P.K., Sturge, T., Taylor, J.: Freebase: a collaboratively created graph database for structuring human knowledge. In: SIGMOD, pp. 1247\u20131250 (2008)","DOI":"10.1145\/1376616.1376746"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: PAKDD, pp. 858\u2013863 (2008)","DOI":"10.1007\/978-3-540-68125-0_84"},{"issue":"8","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/TKDE.2005.127","volume":"17","author":"M Deshpande","year":"2005","unstructured":"Deshpande, M., Kuramochi, M., Wale, N., Karypis, G.: Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng. 17(8), 1036\u20131050 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"7","key":"2_CR9","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 Endow. 7(7), 517\u2013528 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR10","unstructured":"Fiedler, M., Borgelt, C.: Support computation for mining frequent subgraphs in a single graph. In: MLG (2007)"},{"key":"2_CR11","unstructured":"Henderson, T.A.: Frequent subgraph analysis and its software engineering applications. Case Western Reserve University (2017)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kavitha, D., Haritha, D., Padma, Y.: Optimized candidate generation for frequent subgraph mining in a single graph. In: ICDE, pp. 259\u2013272 (2021)","DOI":"10.1007\/978-981-15-8767-2_23"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov. 11(3), 243\u2013271 (2005)","journal-title":"Data Min. Knowl. Discov."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ins.2019.12.010","volume":"514","author":"N Le","year":"2020","unstructured":"Le, N., Vo, B., Nguyen, L.B.Q., Fujita, H., Le, B.: Mining weighted subgraphs in a single large graph. Inf. Sci. 514, 149\u2013165 (2020)","journal-title":"Inf. Sci."},{"issue":"4","key":"2_CR16","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1007\/s10618-020-00686-9","volume":"34","author":"J Meng","year":"2020","unstructured":"Meng, J., Pitaksirianan, N., Tu, Y.: Counting frequent patterns in large labeled graphs: a hypergraph-based approach. Data Min. Knowl. Discov. 34(4), 980\u20131021 (2020)","journal-title":"Data Min. Knowl. Discov."},{"issue":"9","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.14778\/3397230.3397245","volume":"13","author":"A Prateek","year":"2020","unstructured":"Prateek, A., Khan, A., Goyal, A., Ranu, S.: Mining top-k pairs of correlated subgraphs in a large network. Proc. VLDB Endow. 13(9), 1511\u20131524 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Ranu, S., Singh, A.K.: Graphsig: a scalable approach to mining significant subgraphs in large graph databases. In: ICDE, pp. 844\u2013855 (2009)","DOI":"10.1109\/ICDE.2009.133"},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1109\/TCBB.2017.2756879","volume":"16","author":"TK Saha","year":"2019","unstructured":"Saha, T.K., Katebi, A., Dhifli, W., Hasan, M.A.: Discovery of functional motifs from the interface region of oligomeric proteins using frequent subgraph mining. IEEE ACM Trans. Comput. Biol. Bioinform. 16(5), 1537\u20131549 (2019)","journal-title":"IEEE ACM Trans. Comput. Biol. Bioinform."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Suchanek, F.M., Kasneci, G., Weikum, G.: YAGO: a core of semantic knowledge. In: WWW, pp. 697\u2013706 (2007)","DOI":"10.1145\/1242572.1242667"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Thomas, L.T., Valluri, S.R., Karlapalem, K.: MARGIN: maximal frequent subgraph mining. In: ICDM, pp. 1097\u20131101 (2006)","DOI":"10.1109\/ICDM.2006.102"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Vanetik, N., Gudes, E., Shimony, S.E.: Computing frequent graph patterns from semistructured data. In: ICDM, pp. 458\u2013465 (2002)","DOI":"10.1109\/ICDM.2002.1183988"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Wang, X., Tang, L., Liu, Y., Zhan, H., Feng, X.: Diversified pattern mining on large graphs. In: DEXA, pp. 171\u2013184 (2021)","DOI":"10.1007\/978-3-030-86472-9_16"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by leap search. In: SIGMOD, pp. 433\u2013444 (2008)","DOI":"10.1145\/1376616.1376662"},{"key":"2_CR25","unstructured":"Yan, X., Han, J.: GSPAN: graph-based substructure pattern mining. In: ICDM, pp. 721\u2013724 (2002)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: SIGKDD, pp. 286\u2013295 (2003)","DOI":"10.1145\/956750.956784"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Zeng, J., U, L.H., Yan, X., Han, M., Tang, B.: Fast core-based top-$$k$$ frequent pattern discovery in knowledge graphs. In: ICDE, pp. 936\u2013947 (2021)","DOI":"10.1109\/ICDE51399.2021.00086"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2303-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T05:14:59Z","timestamp":1732079699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2303-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819723027","9789819723034"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2303-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"6 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.apweb-waim2023.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}