{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:12:58Z","timestamp":1794377578177,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642136719","type":"print"},{"value":"9783642136726","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13672-6_18","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T10:38:17Z","timestamp":1274179097000},"page":"178-188","source":"Crossref","is-referenced-by-count":4,"title":["GTRACE2: Improving Performance Using Labeled Union Graphs"],"prefix":"10.1007","author":[{"given":"Akihiro","family":"Inokuchi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takashi","family":"Washio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Berlingerio, M., et al.: Mining Graph Evolution Rules. In: Proc. of Euro. Conf. on Principles and Practice of Knowledge Discovery in Databases, pp. 115\u2013130 (2009)","DOI":"10.1007\/978-3-642-04180-8_25"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Borgwardt, K.M., et al.: Pattern Mining in Frequent Dynamic Subgraphs. In: Proc. of Int\u2019l Conf. on Data Mining, pp. 818\u2013822 (2006)","DOI":"10.1109\/ICDM.2006.124"},{"key":"18_CR3","unstructured":"Enron Email Dataset, \n                    \n                      http:\/\/www.cs.cmu.edu\/~enron\/"},{"key":"18_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"18_CR5","series-title":"Lecture Notes in Artificial Intelligence","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":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., et al.: An Apriori-based Algorithm for Mining Frequent Substructures from Graph Data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T.: A Fast Method to Mine Frequent Subsequences from Graph Sequence Data. In: Proc. of Int\u2019l Conf. on Data Mining, pp. 303\u2013312 (2008)","DOI":"10.1109\/ICDM.2008.106"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T.: Mining Frequent Graph Sequence Patterns Induced by Vertices. In: Proc. of SIAM Int\u2019l Conf. on Data Mining (2010)","DOI":"10.1137\/1.9781611972801.41"},{"key":"18_CR8","unstructured":"Inokuchi, A., et al.: A Fast Algorithm for Mining Frequent Connected Subgraphs. IBM Research Report, RT0448 (2002)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: A Quickstart in Frequent Structure Mining can Make a Difference. In: Proc. of Int\u2019l Conf. on Knowledge Discovery and Data Mining, pp. 647\u2013652 (2004)","DOI":"10.1145\/1014052.1014134"},{"key":"18_CR10","unstructured":"Pei, J., et al.: PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth. In: Proc. of Int\u2019l Conf. on Data Eng., pp. 2\u20136 (2001)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Proc. of Int\u2019l Conf. on Extending Database Technology, pp. 3\u201317 (1996)","DOI":"10.1007\/BFb0014140"},{"key":"18_CR12","unstructured":"Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proc. of Int\u2019l Conf. on Data Mining, pp. 721\u2013724 (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13672-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:49:48Z","timestamp":1558277388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13672-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136719","9783642136726"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6_18","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}