{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T05:19:44Z","timestamp":1741324784104,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219153"},{"type":"electronic","value":"9783642219160"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21916-0_36","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T15:16:37Z","timestamp":1309014997000},"page":"326-335","source":"Crossref","is-referenced-by-count":0,"title":["From Connected Frequent Graphs to\u00a0Unconnected Frequent Graphs"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Skonieczny","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Berthold, M.R.: Mining Molecular Fragments: Finding Relevant Substructures of Molecules. In: ICDM, vol.\u00a000:51 (2002)","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"36_CR3","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomophism (2003)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: SPIN: mining maximal frequent subgraphs from graph databases. In: KDD 2004, pp. 581\u2013586 (2004)","DOI":"10.1145\/1014052.1014123"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data (2000)","DOI":"10.1007\/3-540-45372-5_2"},{"key":"36_CR6","unstructured":"Inokuchi, A., Washio, T., Nishimura, K., Motoda, H.: A fast algorithm for mining frequent connected subgraphs. Research Report RT0448 (2002)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Kuramochi, G., Karypis, M.: Frequent subgraph discovery. In: Proceedings IEEE International Conference on Data Mining, 2001, ICDM 2001, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. In: KDD 2004, pp. 647\u2013652 (2004)","DOI":"10.1145\/1014052.1014134"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Skonieczny, L.: Mining of Unconnected Frequent Graphs with Direct Subgraph Isomorphism Tests. In: ICMMI 2009 (2009)","DOI":"10.1007\/978-3-642-00563-3_55"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","first-page":"639","volume-title":"Secure Data Management","author":"R. Ting","year":"2006","unstructured":"Ting, R., Bailey, J.: Mining minimal contrast subgraph patterns. In: Jonker, W., Petkovi\u0107, M. (eds.) SDM 2006. LNCS, vol.\u00a04165, pp. 639\u2013643. Springer, Heidelberg (2006)"},{"key":"36_CR11","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICMD, vol.\u00a000:721 (2002)"},{"key":"36_CR12","first-page":"286","volume-title":"KDD 2003","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: KDD 2003, pp. 286\u2013295. ACM , New York (2003)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21916-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T17:32:23Z","timestamp":1741282343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21916-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219153","9783642219160"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21916-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}