{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T04:40:08Z","timestamp":1743828008849,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319501"},{"type":"electronic","value":"9783642319518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31951-8_13","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:56:20Z","timestamp":1342832180000},"page":"98-112","source":"Crossref","is-referenced-by-count":1,"title":["Graph-Based Relational Learning with a Polynomial Time Projection Algorithm"],"prefix":"10.1007","author":[{"given":"Brahim","family":"Douar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Liquiere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiraz","family":"Latiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yahya","family":"Slimani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume-title":"Principles and Practice of Constraint Programming - CP\u201996","author":"C. Bessi\u00e8re","year":"1996","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C.: Mac and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol.\u00a01118, pp. 61\u201375. Springer, Heidelberg (1996)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Cook, D.J., Holder, L.B.: Mining Graph Data. John Wiley & Sons (2006)","DOI":"10.1002\/0470073047"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Debnath, A., Compadre, R.D., Debnath, G., Schusterman, A., Hansch, C.: Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity. J. Medicinal Chemistry\u00a034 (1991)","DOI":"10.1021\/jm00106a046"},{"key":"13_CR4","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and homomorphism","author":"P. Hell","year":"2004","unstructured":"Hell, P., Nesetril, J.: Graphs and homomorphism, vol.\u00a028. Oxford University Press, Oxford (2004)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1093\/bioinformatics\/17.1.107","volume":"17","author":"C. Helma","year":"2001","unstructured":"Helma, C., King, R.D., Kramer, S., Srinivasan, A.: The predictive toxicology challenge 2000-2001. Bioinformatics\u00a017(1), 107\u2013108 (2001)","journal-title":"Bioinformatics"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Cercone, N., Lin, T.Y., Wu, X. (eds.) International Conference on Data Mining, pp. 313\u2013320. IEEE Computer Society (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"13_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-73681-3_25","volume-title":"Conceptual Structures: Knowledge Architectures for Smart Applications","author":"M. Liquiere","year":"2007","unstructured":"Liquiere, M.: Arc Consistency Projection: A New Generalization Relation for Graphs. In: Priss, U., Polovina, S., Hill, R. (eds.) ICCS 2007. LNCS (LNAI), vol.\u00a04604, pp. 333\u2013346. Springer, Heidelberg (2007)"},{"key":"13_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-44797-0_13","volume-title":"Inductive Logic Programming","author":"D. Malerba","year":"2001","unstructured":"Malerba, D., Lisi, F.A.: Discovering Associations between Spatial Objects: An ILP Application. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol.\u00a02157, pp. 156\u2013163. Springer, Heidelberg (2001)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng, S.H., de\u00a0Wolf, R.: Least generalizations and greatest specializations of sets of clauses. CoRR cs.AI\/9605102 (1996)","DOI":"10.1613\/jair.259"},{"key":"13_CR10","unstructured":"Plotkin, G.D.: A note on inductive generalization. Machine Intelligence\u00a05 (1970)"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1007601015854","volume":"42","author":"F.J. Provost","year":"2001","unstructured":"Provost, F.J., Fawcett, T.: Robust Classification for Imprecise Environments. Machine Learning\u00a042(3), 203\u2013231 (2001)","journal-title":"Machine Learning"},{"key":"13_CR12","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning, 1st edn. Morgan Kaufmann (January 1993)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Sowa, J.F.: Conceptual graphs summary, pp. 3\u201351. Ellis Horwood (1992)","DOI":"10.1016\/0950-7051(92)90028-E"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1021\/ci980029a","volume":"38","author":"M.D. Wessel","year":"1998","unstructured":"Wessel, M.D., Jurs, P.C., Tolan, J.W., Muskal, S.M.: Prediction of human intestinal absorption of drug compounds from molecular structure. Journal of Chemical Information and Computer Sciences\u00a038(4), 726\u2013735 (1998)","journal-title":"Journal of Chemical Information and Computer Sciences"},{"key":"13_CR15","series-title":"Morgan Kaufmann Series in Data Management Systems","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann Publishers Inc., San Francisco (2005)","edition":"2"},{"key":"13_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/11564126_39","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"M. W\u00f6rlein","year":"2005","unstructured":"W\u00f6rlein, M., Meinl, T., Fischer, I., Philippsen, M.: A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 392\u2013403. Springer, Heidelberg (2005)"},{"key":"13_CR17","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: International Conference on Data Mining, pp. 721\u2013724. IEEE Computer Society (2002)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31951-8_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T04:16:41Z","timestamp":1743826601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31951-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319501","9783642319518"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31951-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}