{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:24:58Z","timestamp":1725531898962},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642017148"},{"type":"electronic","value":"9783642017155"}],"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-01715-5_5","type":"book-chapter","created":{"date-parts":[[2009,5,12]],"date-time":"2009-05-12T05:15:30Z","timestamp":1242105330000},"page":"50-60","source":"Crossref","is-referenced-by-count":3,"title":["Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining"],"prefix":"10.1007","author":[{"given":"Kouzou","family":"Ohara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Hara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyoto","family":"Takabayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Washio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D.J. Cook","year":"1994","unstructured":"Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research\u00a01, 231\u2013255 (1994)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0004-3702(94)00066-A","volume":"75","author":"K. Yoshida","year":"1995","unstructured":"Yoshida, K., Motoda, H.: Clip: Concept learning from inference patterns. Artificial Intelligence\u00a075(1), 63\u201392 (1995)","journal-title":"Artificial Intelligence"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-36182-0_44","volume-title":"Discovery Science","author":"T. Matsuda","year":"2002","unstructured":"Matsuda, T., Motoda, H., Yoshida, T., Washio, T.: Mining patterns from structured data by beam-wise graph-based induction. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS, vol.\u00a02534, pp. 422\u2013429. Springer, Heidelberg (2002)"},{"unstructured":"Yan, X., Han, J.: gSpan: Graph-based structure pattern mining. In: 2002 IEEE International Conference on Data Mining (ICDM 2002), pp. 721\u2013724 (2002)","key":"5_CR4"},{"issue":"3","key":"5_CR5","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. Machine Learning\u00a050(3), 321\u2013354 (2003)","journal-title":"Machine Learning"},{"issue":"9","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M. Kuramochi","year":"2004","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowledge and Data Engineering\u00a016(9), 1038\u20131051 (2004)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"5_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/11430919_74","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P.C. Nguyen","year":"2005","unstructured":"Nguyen, P.C., Ohara, K., Motoda, H., Washio, T.: Cl-gbi: A novel approach for extracting typical patterns from graph-structured data. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 639\u2013649. Springer, Heidelberg (2005)"},{"key":"5_CR8","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Machine Learning\u00a01, 81\u2013106 (1986)","journal-title":"Machine Learning"},{"doi-asserted-by":"crossref","unstructured":"Morishita, S., Sese, j.: Traversing itemset lattices with statical metric pruning. In: 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 226\u2013236 (2000)","key":"5_CR9","DOI":"10.1145\/335168.335226"},{"key":"5_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/11731139_45","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P.C. Nguyen","year":"2006","unstructured":"Nguyen, P.C., Ohara, K., Mogi, A., Motoda, H., Washio, T.: Constructing decision trees for graph-structured data by chunkingless graph-based induction. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol.\u00a03918, pp. 390\u2013399. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"5_CR11","first-page":"131","volume":"66","author":"W. Geamsakul","year":"2005","unstructured":"Geamsakul, W., Yoshida, T., Ohara, K., Motoda, H., Yokoi, H., Takabayashi, K.: Constructing a decision tree for graph-structured data and its applications. Fundamenta Informaticae\u00a066(1-2), 131\u2013160 (2005)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Knowledge Acquisition: Approaches, Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01715-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:30:27Z","timestamp":1558312227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01715-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642017148","9783642017155"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01715-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}