{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:51:04Z","timestamp":1767912664505,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642037290","type":"print"},{"value":"9783642037306","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03730-6_26","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T06:41:58Z","timestamp":1251355318000},"page":"325-338","source":"Crossref","is-referenced-by-count":12,"title":["HDB-Subdue: A Scalable Approach to Graph Mining"],"prefix":"10.1007","author":[{"given":"Srihari","family":"Padmanabhan","sequence":"first","affiliation":[]},{"given":"Sharma","family":"Chakravarthy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/11731139_77","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R. Balachandran","year":"2006","unstructured":"Balachandran, R., Padmanabhan, S., Chakravarthy, S.: Enhanced DB-subdue: Supporting subtle aspects of graph mining using a relational approach. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS, vol.\u00a03918, pp. 673\u2013678. Springer, Heidelberg (2006)"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D.J. Cook","year":"2000","unstructured":"Cook, D.J., Holder, L.B.: Graph-based data mining. IEEE Intelligent Systems\u00a015(2), 32\u201341 (2000)","journal-title":"IEEE Intelligent Systems"},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A. Inokuchi","year":"2003","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: Mining graph data. Mach. Learn.\u00a050(3), 321\u2013354 (2003)","journal-title":"Mach. Learn."},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1109\/ICDM.2001.989534","volume-title":"ICDM 2001: Proceedings of the 2001 IEEE International Conference on Data Mining","author":"M. Kuramochi","year":"2001","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM 2001: Proceedings of the 2001 IEEE International Conference on Data Mining, Washington, DC, USA, pp. 313\u2013320. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Mishra, P., Chakravarthy, S.: Performance evaluation and analysis of k-way join variants for association rule mining. In: BNCOD, pp. 95\u2013114 (2003)","DOI":"10.1007\/3-540-45073-4_9"},{"key":"26_CR6","unstructured":"Padmanabhan, S.: HDB-Subdue: A relational database approach to graph mining and hierarchical reduction. Master\u2019s thesis, Department of Computer Science and Engineering, University of Texas at Arlington \/Students\/sharma\/theses\/Pad05MS.pdf (December 2005), \n                    \n                      http:\/\/itlab.uta.edu\/ITLABWEB"},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/ICDE.2001.914830","volume-title":"Proceedings of the 17th International Conference on Data Engineering","author":"J. Pei","year":"2001","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Prefixspan: Mining sequential patterns by prefix-projected growth. In: Proceedings of the 17th International Conference on Data Engineering, Washington, DC, USA, pp. 215\u2013224. IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T. Washio","year":"2003","unstructured":"Washio, T., Motoda, H.: State of the art of graph-based data mining. SIGKDD Explor. Newsl.\u00a05(1), 59\u201368 (2003)","journal-title":"SIGKDD Explor. Newsl."},{"key":"26_CR9","first-page":"721","volume-title":"ICDM 2002: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002)","author":"X. Yan","year":"2002","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM 2002: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), Washington, DC, USA, p. 721. IEEE Computer Society Press, Los Alamitos (2002)"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03730-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T15:03:47Z","timestamp":1552143827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03730-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037290","9783642037306"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03730-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}