{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:22Z","timestamp":1725564982081},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260769"},{"type":"electronic","value":"9783540319351"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11430919_74","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T06:06:46Z","timestamp":1283839606000},"page":"639-649","source":"Crossref","is-referenced-by-count":8,"title":["Cl-GBI: A Novel Approach for Extracting Typical Patterns from Graph-Structured Data"],"prefix":"10.1007","author":[{"given":"Phu Chien","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouzou","family":"Ohara","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":"74_CR1","unstructured":"Blake, C.L., Keogh, E., Merz, C.J.: UCI Repository of Machine Learning Database (1998), \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"74_CR2","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Berthold, M.R.: Mining Molecular Fragments: Finding Relevant Substructures of Molecules. In: Proc. ICDM 2002, pp. 51\u201358 (2002)","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"74_CR3","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth & Brooks\/Cole Advanced Books & Software (1984)"},{"key":"74_CR4","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. Artificial Intelligence Research\u00a01, 231\u2013255 (1994)","journal-title":"Artificial Intelligence Research"},{"key":"74_CR5","unstructured":"Fortin, S.: The Graph Isomorphism Problem, Technical Report TR96-20, Department of Computer Science, University of Alberta, Edmonton, Canada (1996)"},{"key":"74_CR6","doi-asserted-by":"crossref","unstructured":"Gaemsakul, W., Matsuda, T., Yoshida, T., Motoda, M., Washio, T.: Classifier Construction by Graph-Based Induction for Graph-Structured Data. In: Proc. PAKDD 2003, pp. 52\u201362 (2003)","DOI":"10.1007\/3-540-36175-8_6"},{"key":"74_CR7","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism. In: Proc. ICDM 2003, pp. 549\u2013552 (2003)","DOI":"10.1109\/ICDM.2003.1250974"},{"issue":"3","key":"74_CR8","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"},{"key":"74_CR9","unstructured":"Inokuchi, A., Washio, T., Nishimura, K., Motoda, H.: A Fast Algorithm for Mining Frequent Connected Subgraphs. IBM Research Report RT0448, Tokyo Research Laboratory, IBM Japan (2002)"},{"issue":"9","key":"74_CR10","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":"74_CR11","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: GREW\u2013A Scalable Frequent Subgraph Discovery Algorithm. In: Proc. ICDM 2004, pp. 439\u2013442 (2004)","DOI":"10.1109\/ICDM.2004.10024"},{"key":"74_CR12","doi-asserted-by":"crossref","unstructured":"Matsuda, T., Motoda, H., Yoshida, T., Washio, T.: Mining Patterns from Structured Data by Beam-wise Graph-Based Induction. In: Proc. DS 2002, pp. 422\u2013429 (2002)","DOI":"10.1007\/3-540-36182-0_44"},{"key":"74_CR13","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"},{"key":"74_CR14","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Francisco (1993)"},{"key":"74_CR15","unstructured":"Yan, X., Han, J.: gSpan: Graph-Based Structure Pattern Mining. In: Proc. ICDM 2002, pp. 721\u2013724 (2002)"},{"issue":"1","key":"74_CR16","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, M.: CLIP: Concept Learning from Inference Patterns. Artificial Intelligence\u00a075(1), 63\u201392 (1995)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11430919_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:04Z","timestamp":1619507464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11430919_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260769","9783540319351"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11430919_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}