{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:44:58Z","timestamp":1764240298163,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030371876"},{"type":"electronic","value":"9783030371883"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37188-3_13","type":"book-chapter","created":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T15:24:22Z","timestamp":1576164262000},"page":"209-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["TKG: Efficient Mining of Top-K Frequent Subgraphs"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Fournier-Viger","sequence":"first","affiliation":[]},{"given":"Chao","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[]},{"given":"R. Uday","family":"Kiran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,12]]},"reference":[{"issue":"Suppl 1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1093\/bioinformatics\/bti1007","volume":"21","author":"KM Borgwardt","year":"2005","unstructured":"Borgwardt, K.M., Ong, C.S., Sch\u00f6nauer, S., Vishwanathan, S.V.N., Smola, A.J., Kriegel, H.P.: Protein function prediction via graph kernels. Bioinformatics 21(Suppl 1), 47\u201356 (2005)","journal-title":"Bioinformatics"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-319-57529-2_49","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Z Cheng","year":"2017","unstructured":"Cheng, Z., Flouvat, F., Selmaoui-Folcher, N.: Mining recurrent patterns in a dynamic attributed graph. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10235, pp. 631\u2013643. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57529-2_49"},{"key":"13_CR3","unstructured":"Duong, V.T.T., Khan, K.U., Jeong, B.S., Lee, Y.K.: Top-k frequent induced subgraph mining using sampling. In: Proceedings 6th International Conference on Emerging Databases: Technologies, Applications, and Theory (2016)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Duong, V.T.T., Khan, K.U., Lee, Y.K.: Top-k frequent induced subgraph mining on a sliding window using sampling. In: Proceedings 11th International Conference on Ubiquitous Information Management and Communication (2017)","DOI":"10.1145\/3022227.3022242"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-46131-1_8","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger, P., et al.: The SPMF open-source data mining library version 2. In: Berendt, B., et al. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9853, pp. 36\u201340. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46131-1_8"},{"issue":"1","key":"13_CR6","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger, P., Lin, J.C.W., Kiran, U.R., Koh, Y.S.: A survey of sequential pattern mining. Data Sci. Pattern Recogn. 1(1), 54\u201377 (2017)","journal-title":"Data Sci. Pattern Recogn."},{"key":"13_CR7","series-title":"Studies in Big Data","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-04921-8_1","volume-title":"High-Utility Pattern Mining","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger, P., Chun-Wei Lin, J., Truong-Chi, T., Nkambou, R.: A survey of high utility itemset mining. In: Fournier-Viger, P., Lin, J.C.-W., Nkambou, R., Vo, B., Tseng, V.S. (eds.) High-Utility Pattern Mining. SBD, vol. 51, pp. 1\u201345. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-04921-8_1"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Lin, J.C.W., Vo, B., Chi, T.T., Zhang, J., Le, B.: A survey of itemset mining. WIREs Data Min. Knowl. Discov. (2017)","DOI":"10.1002\/widm.1207"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"Akihiro Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 13\u201323. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45372-5_2"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang, C., Coenen, F., Zito, M.: A survey of frequent subgraph mining algorithms. Knowl. Eng. Rev. 28, 75\u2013105 (2013)","journal-title":"Knowl. Eng. Rev."},{"key":"13_CR11","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings 1st IEEE International Conference on Data Mining (2001)"},{"issue":"9","key":"13_CR12","doi-asserted-by":"publisher","first-page":"2480","DOI":"10.1166\/asl.2016.7821","volume":"22","author":"G Lee","year":"2016","unstructured":"Lee, G., Yun, U., Kim, D.: A weight-based approach: frequent graph pattern mining with length-decreasing support constraints using weighted smallest valid extension. Adv. Sci. Lett. 22(9), 2480\u20132484 (2016)","journal-title":"Adv. Sci. Lett."},{"key":"13_CR13","first-page":"537","volume-title":"Advanced Data Mining and Applications","author":"Yuhua Li","year":"2010","unstructured":"Li, Y., Lin, Q., Li, R., Duan, D.: TGP: mining top-k frequent closed graph pattern without minimum support. In: Proceedings 6th International Conference on Advanced Data Mining and Applications (2010)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Mrzic, A., et al.: Grasping frequent subgraph mining for bioinformatics applications. In: BioData Mining (2018)","DOI":"10.1186\/s13040-018-0181-9"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/1.9781611975321.35","volume-title":"Proceedings of the 2018 SIAM International Conference on Data Mining","author":"Dang Nguyen","year":"2018","unstructured":"Nguyen, D., Luo, W., Nguyen, T.D., Venkatesh, S., Phung, D.Q.: Learning graph representation via frequent subgraphs. In: Proceedings 2018 SIAM International Conference on Data Mining, pp. 306\u2013314 (2018)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","volume":"127","author":"S Nijssen","year":"2005","unstructured":"Nijssen, S., Kok, J.N.: The gaston tool for frequent subgraph mining. Electron. Notes Theor. Comput. Sci. 127, 77\u201387 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Saha, T.K., Hasan, M.A.: FS3: a sampling based method for top-k frequent subgraph mining. In: Proceedings 2014 IEEE International Conference on Big Data, pp. 72\u201379 (2014)","DOI":"10.1109\/BigData.2014.7004359"},{"issue":"24","key":"13_CR18","doi-asserted-by":"publisher","first-page":"3955","DOI":"10.1093\/bioinformatics\/btx481","volume":"33","author":"A Sankar","year":"2017","unstructured":"Sankar, A., Ranu, S., Raman, K.: Predicting novel metabolic pathways through subgraph mining. Bioinformatics 33(24), 3955\u20133963 (2017)","journal-title":"Bioinformatics"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Wale, N., Watson, I.A., Karypis, G.: Comparison of descriptor spaces for chemical compound retrieval and classification. In: Proceedings 6th International Conference on Data Mining, pp. 678\u2013689 (2006)","DOI":"10.21236\/ADA444816"},{"key":"13_CR20","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: Proceedings 2nd IEEE International Conference on Data Mining (2002)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)","DOI":"10.1145\/956750.956784"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 SIGMOD Conference (2004)","DOI":"10.1145\/1007568.1007607"},{"issue":"5","key":"13_CR23","doi-asserted-by":"publisher","first-page":"32","DOI":"10.3390\/sym8050032","volume":"8","author":"U Yun","year":"2016","unstructured":"Yun, U., Lee, G., Kim, C.H.: The smallest valid extension-based efficient, rare graph pattern mining, considering length-decreasing support constraints and symmetry characteristics of graphs. Symmetry 8(5), 32 (2016)","journal-title":"Symmetry"},{"key":"13_CR24","unstructured":"Zhu, F., Yan, X., Han, J., Yu, P.S.: gPrune: a constraint pushing framework for graph pattern mining. In: Proceedings of the 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (2007)"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37188-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:17:35Z","timestamp":1710166655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-37188-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030371876","9783030371883"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37188-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ahmedabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2019","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":"bigda2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bda2019.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"13","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":"25% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12 other papers were accepted and are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}