{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T14:51:18Z","timestamp":1725720678714},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642373817"},{"type":"electronic","value":"9783642373824"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37382-4_2","type":"book-chapter","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T06:09:33Z","timestamp":1364191773000},"page":"17-32","source":"Crossref","is-referenced-by-count":1,"title":["Reducing Examples in Relational Learning with Bounded-Treewidth Hypotheses"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"Ku\u017eelka","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Szab\u00f3ov\u00e1","sequence":"additional","affiliation":[]},{"given":"Filip","family":"\u017delezn\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","first-page":"4","volume":"10","author":"H. Liu","year":"2010","unstructured":"Liu, H., Motoda, H., Setiono, R., Zhao, Z.: Feature selection: An ever evolving frontier in data mining. Journal of Machine Learning Research - Proceedings Track\u00a010, 4\u201313 (2010)","journal-title":"Journal of Machine Learning Research - Proceedings Track"},{"issue":"2-3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0743-1066(99)00019-9","volume":"40","author":"N. Lavrac","year":"1999","unstructured":"Lavrac, N., Gamberger, D., Jovanoski, V.: A study of relevance for learning in deductive databases. J. Log. Program.\u00a040(2-3), 215\u2013249 (1999)","journal-title":"J. Log. Program."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Appice, A., Ceci, M., Rawles, S., Flach, P.A.: Redundant feature elimination for multi-class problems. In: ICML, vol.\u00a069 (2004)","DOI":"10.1145\/1015330.1015397"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Raedt, L.D.: Logical and Relational Learning: From ILP to MRDM (Cognitive Technologies). Springer-Verlag New York, Inc. (2008)","DOI":"10.1007\/978-3-540-68856-3"},{"key":"2_CR5","first-page":"153","volume":"5","author":"G.D. Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Machine Intelligence\u00a05, 153\u2013163 (1970)","journal-title":"Machine Intelligence"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-21295-6_17","volume-title":"Inductive Logic Programming","author":"O. Ku\u017eelka","year":"2011","unstructured":"Ku\u017eelka, O., \u017delezn\u00fd, F.: Seeing the world through homomorphism: An experimental study on reducibility of examples. In: Frasconi, P., Lisi, F.A. (eds.) ILP 2010. LNCS, vol.\u00a06489, pp. 138\u2013145. Springer, Heidelberg (2011)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-13840-9_14","volume-title":"Inductive Logic Programming","author":"H. Nassif","year":"2010","unstructured":"Nassif, H., Al-Ali, H., Khuri, S., Keirouz, W., Page, D.: An inductive logic programming approach to validate hexose binding biochemical knowledge. In: De Raedt, L. (ed.) ILP 2009. LNCS, vol.\u00a05989, pp. 149\u2013165. Springer, Heidelberg (2010)"},{"key":"2_CR8","unstructured":"Erickson, J.: CS 598: Computational Topology, course notes, University of Illinois at Urbana-Champaign (2009)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Ku\u017eelka, O., \u017delezn\u00fd, F.: Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties. In: ICML 2009: the 26th Int. Conf. on Machine Learning (2009)","DOI":"10.1145\/1553374.1553448"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10994-010-5208-5","volume":"83","author":"O. Ku\u017eelka","year":"2011","unstructured":"Ku\u017eelka, O., \u017delezn\u00fd, F.: Block-wise construction of tree-like relational features with monotone reducibility and redundancy. Machine Learning\u00a083, 163\u2013192 (2011)","journal-title":"Machine Learning"},{"key":"2_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-39917-9_14","volume-title":"Inductive Logic Programming","author":"M.-A. Krogel","year":"2003","unstructured":"Krogel, M.-A., Rawles, S., \u017delezn\u00fd, F., Flach, P.A., Lavra\u010d, N., Wrobel, S.: Comparative evaluation of approaches to propositionalization. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 197\u2013214. Springer, Heidelberg (2003)"},{"key":"2_CR12","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers (2003)"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput.\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/B:MACH.0000023150.80092.40","volume":"55","author":"J. Maloberti","year":"2004","unstructured":"Maloberti, J., Sebag, M.: Fast theta-subsumption with constraint satisfaction algorithms. Machine Learning\u00a055(2), 137\u2013174 (2004)","journal-title":"Machine Learning"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73420-8_26","volume-title":"Automata, Languages and Programming","author":"A. Atserias","year":"2007","unstructured":"Atserias, A., Bulatov, A., Dalmau, V.: On the power of k-consistency. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 279\u2013290. Springer, Heidelberg (2007)"},{"key":"2_CR16","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier (2006)"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L. Raedt De","year":"1997","unstructured":"De Raedt, L.: Logical settings for concept-learning. Artif. Intell.\u00a095(1), 187\u2013201 (1997)","journal-title":"Artif. Intell."},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. Journal of Computer and System Sciences\u00a064(3), 579\u2013627 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR19","first-page":"481","volume":"8","author":"N. Landwehr","year":"2007","unstructured":"Landwehr, N., Kersting, K., Raedt, L.D.: Integrating na\u00efve bayes and FOIL. Journal of Machine Learning Research\u00a08, 481\u2013507 (2007)","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"Mackworth, A.: Consistency in networks of relations. Artificial Intelligence\u00a08(1), 99\u2013118 (1977)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"2_CR21","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":"2_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-73847-3_39","volume-title":"Inductive Logic Programming","author":"M. \u017d\u00e1kov\u00e1","year":"2007","unstructured":"\u017d\u00e1kov\u00e1, M., \u017delezn\u00fd, F., Garcia-Sedano, J.A., Masia Tissot, C., Lavra\u010d, N., K\u0159emen, P., Molina, J.: Relational data mining applied to virtual engineering of product designs. In: Muggleton, S.H., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol.\u00a04455, pp. 439\u2013453. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Mining Complex Patterns"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37382-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T19:35:00Z","timestamp":1557603300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37382-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642373817","9783642373824"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37382-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}