{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:04:43Z","timestamp":1761401083996},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advanced Engineering Informatics"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s1474-0346(02)00005-8","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T18:47:31Z","timestamp":1034275651000},"page":"135-143","source":"Crossref","is-referenced-by-count":11,"title":["Graph-based induction and its applications"],"prefix":"10.1016","volume":"16","author":[{"given":"Takashi","family":"Matsuda","sequence":"first","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":"78","reference":[{"key":"10.1016\/S1474-0346(02)00005-8_BIB1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction of decision trees","volume":"1","author":"Quinlan","year":"1986","journal-title":"Mach Learn"},{"key":"10.1016\/S1474-0346(02)00005-8_BIB2","series-title":"C4.5: programs for machine learning","author":"Quinlan","year":"1993"},{"key":"10.1016\/S1474-0346(02)00005-8_BIB3","first-page":"63","article-title":"Learning flexible concepts: fundamental ideas and a method based on two-tiered representation","volume":"3","author":"Michalski","year":"1990","journal-title":"Mach Learn, Artif Intell Approach"},{"key":"10.1016\/S1474-0346(02)00005-8_BIB4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00116835","article-title":"The cn2 induction algorithm","volume":"3","author":"Breiman","year":"1989","journal-title":"Mach Learn"},{"issue":"20","key":"10.1016\/S1474-0346(02)00005-8_BIB5","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","article-title":"Inductive logic programming: theory and methods","volume":"19","author":"Muggleton","year":"1994","journal-title":"J Logic Progr"},{"key":"10.1016\/S1474-0346(02)00005-8_BIB6","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H. An a priori-based algorithm for mining frequent substructures from graph data. Proceedings of the Fourth European Conference on Principles of Data Mining and Knowledge Discovery, 2000. p. 13\u201323.","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"2","key":"10.1016\/S1474-0346(02)00005-8_BIB7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/5254.850825","article-title":"Graph-based data mining","volume":"15","author":"Cook","year":"2000","journal-title":"IEE Intell Syst"},{"issue":"1","key":"10.1016\/S1474-0346(02)00005-8_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0004-3702(94)00066-A","article-title":"Clip: concept learning from inference pattern","volume":"75","author":"Yoshida","year":"1995","journal-title":"J Artif Intell"},{"key":"10.1016\/S1474-0346(02)00005-8_BIB9","series-title":"Classification and regression trees","author":"Breiman","year":"1984"},{"key":"10.1016\/S1474-0346(02)00005-8_BIB10","series-title":"Extension of graph-based induction for general graph structured data","author":"Matsuda","year":"2000"},{"key":"10.1016\/S1474-0346(02)00005-8_BIB11","unstructured":"Blake CL, Keogh E, Merz C. Uci repository of machine learning database. http:\/\/www.ics.uci.edu\/(mlearn\/MLRepository.html, 1998."},{"key":"10.1016\/S1474-0346(02)00005-8_BIB12","doi-asserted-by":"crossref","unstructured":"Matsuda T, Horiuchi T, Motoda H, Washio T. Graph-based induction for general graph structured data and its application to chemical compound data. Proceedings of the Third International Conference on Discovery Science, 2000.","DOI":"10.1007\/3-540-44418-1_9"},{"issue":"1","key":"10.1016\/S1474-0346(02)00005-8_BIB13","first-page":"29","article-title":"Prediction of carcinogenicity of organic chlorine-containing compounds by neural network","volume":"11","author":"Matsumoto","year":"1999","journal-title":"JCPE J"},{"key":"10.1016\/S1474-0346(02)00005-8_BIB14","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1021\/jm00106a046","article-title":"Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity","volume":"34","author":"Debnath","year":"1991","journal-title":"J Med Chem"}],"container-title":["Advanced Engineering Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1474034602000058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1474034602000058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T15:22:30Z","timestamp":1555168950000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1474034602000058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S1474034602000058"],"URL":"https:\/\/doi.org\/10.1016\/s1474-0346(02)00005-8","relation":{},"ISSN":["1474-0346"],"issn-type":[{"value":"1474-0346","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}