{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:42:30Z","timestamp":1648561350474},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T00:00:00Z","timestamp":1387238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10844-013-0294-z","type":"journal-article","created":{"date-parts":[[2013,12,16]],"date-time":"2013-12-16T01:56:08Z","timestamp":1387158968000},"page":"255-281","source":"Crossref","is-referenced-by-count":1,"title":["A method for reduction of examples in relational learning"],"prefix":"10.1007","volume":"42","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","published-online":{"date-parts":[[2013,12,17]]},"reference":[{"key":"294_CR1","doi-asserted-by":"crossref","unstructured":"Appice, A., Ceci,M., Rawles, S., Flach, P.A. (2004). Redundant feature elimination for multi-class problems. In ICML (vol. 69).","DOI":"10.1145\/1015330.1015397"},{"key":"294_CR2","doi-asserted-by":"crossref","unstructured":"Atserias, A., Bulatov, A., Dalmau, V. (2007). On the power of k-consistency. In Proceedings of ICALP-2007 (pp. 266\u2013271).","DOI":"10.1007\/978-3-540-73420-8_26"},{"issue":"3","key":"294_CR3","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M. (1983). On the desirability of acyclic database schemes. Journal of ACM, 30(3), 479\u2013513.","journal-title":"Journal of ACM"},{"key":"294_CR4","first-page":"238","volume":"6","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L., & Mohring, R.H. (1993). The pathwidth and treewidth of cographs. SIAM Journal of Discrete Methematics, 6, 238\u2013255.","journal-title":"SIAM Journal of Discrete Methematics"},{"issue":"1","key":"294_CR5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B. (1990). The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Information and Computation, 85(1), 12\u201375.","journal-title":"Information and Computation"},{"issue":"1","key":"294_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L Raedt De","year":"1997","unstructured":"De Raedt, L. (1997).) Logical settings for concept-learning. Artificial Intelligence, 95(1), 187\u2013201.","journal-title":"Artificial Intelligence"},{"key":"294_CR7","doi-asserted-by":"crossref","unstructured":"De Raedt, L. (2008). Logical and relational learning. New York: Springer.","DOI":"10.1007\/978-3-540-68856-3"},{"key":"294_CR8","unstructured":"Dechter, R. (2003). Constraint processing. San Francisco: Morgan Kaufmann."},{"key":"294_CR9","unstructured":"Erickson, J. (2009). CS 598: Computational topology, course notes, University of Illinois at Urbana-Champaign. http:\/\/compgeom.cs.uiuc.edu\/~jeffe\/teaching\/comptop\/ ."},{"issue":"3","key":"294_CR10","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin, R. (1983). Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM, 30(3), 514\u2013550.","journal-title":"Journal of the ACM"},{"issue":"1","key":"294_CR11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T Feder","year":"1998","unstructured":"Feder, T., & Vardi, M.Y. (1998). The computational structure of monotone monadic snp and constraint satisfaction: a study through datalog and group theory. SIAM Journal on Computing, 28(1), 57\u2013104.","journal-title":"SIAM Journal on Computing"},{"key":"294_CR12","unstructured":"Freuder, E.C. (1990). Complexity of k-tree structured constraint satisfaction problems. In Proceedings of the eighth national conference on artificial intelligence (vol. 1, pp. 4\u20139). AAAI\u201990: AAAI Press."},{"key":"294_CR13","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Friedman, J. (2001). The elements of statistical learning: data mining, inference, and prediction. New York: Springer.","DOI":"10.1007\/978-0-387-21606-5"},{"issue":"1","key":"294_CR14","doi-asserted-by":"crossref","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. (2001). The predictive toxicology challenge 2000\u20132001. Bioinformatics, 17(1), 107\u2013108.","journal-title":"Bioinformatics"},{"key":"294_CR15","doi-asserted-by":"crossref","unstructured":"Krogel, M.A., Rawles, S., \u017delezn\u00fd, F., Flach, P., Lavrac, N., Wrobel, S. (2003). Comparative evaluation of approaches to propositionalization. In ILP. Springer.","DOI":"10.1007\/978-3-540-39917-9_14"},{"key":"294_CR16","unstructured":"Ku\u017eelka, O., & \u017delezn\u00fd, F. (2009). Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties. In ICML 2009: the 26th International Conference on Machine Learning."},{"key":"294_CR17","doi-asserted-by":"crossref","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. (2011a). Block-wise construction of tree-like relational features with monotone reducibility and redundancy. Machine Learning, 83, 163\u2013192.","journal-title":"Machine Learning"},{"key":"294_CR18","doi-asserted-by":"crossref","unstructured":"Ku\u017eelka, O., \u017delezn\u00fd, F. (2011b). Seeing the world through homomorphism: An experimental study on reducibility of examples. In ILP\u201910: Inductive logic programming (pp. 138\u2013145).","DOI":"10.1007\/978-3-642-21295-6_17"},{"key":"294_CR19","doi-asserted-by":"crossref","unstructured":"Ku\u017eelka, O., Szab\u00f3ov\u00e1, A., \u017delezn\u00fd, F. (2013a). Bounded least general generalization. In ILP\u201912: inductive logic programming.","DOI":"10.1007\/978-3-642-38812-5_9"},{"key":"294_CR20","doi-asserted-by":"crossref","unstructured":"Ku\u017eelka, O., Szab\u00f3ov\u00e1, A., \u017delezn\u00fd, F. (2013b). Reducing examples in relational learning with bounded-treewidth hypotheses. In New frontiers in mining complex patterns (pp. 17\u201332).","DOI":"10.1007\/978-3-642-37382-4_2"},{"key":"294_CR21","first-page":"481","volume":"8","author":"N Landwehr","year":"2007","unstructured":"Landwehr, N., Kersting, K., Raedt, L.D. (2007). Integrating na\u00efve bayes and FOIL. Journal of Machine Learning Research, 8, 481\u2013507.","journal-title":"Journal of Machine Learning Research"},{"issue":"2\/3","key":"294_CR22","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0743-1066(99)00019-9","volume":"40","author":"N Lavra\u010d","year":"1999","unstructured":"Lavra\u010d, N., Gamberger, D., Jovanoski, V. (1999). A study of relevance for learning in deductive databases. Journal of Logic Programming, 40(2\/3), 215\u2013249.","journal-title":"Journal of Logic Programming"},{"key":"294_CR23","first-page":"4","volume":"10","author":"H Liu","year":"2010","unstructured":"Liu, H.,Motoda, H., Setiono, R., Zhao, Z. (2010). Feature selection: an ever evolving frontier in data mining. Journal of Machine Learning Research - Proceedings Track, 10, 4\u201313.","journal-title":"Journal of Machine Learning Research - Proceedings Track"},{"issue":"1","key":"294_CR24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A Mackworth","year":"1977","unstructured":"Mackworth, A. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99\u2013118.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"294_CR25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/B:MACH.0000023150.80092.40","volume":"55","author":"J Maloberti","year":"2004","unstructured":"Maloberti, J., & Sebag, M. (2004). Fast theta-subsumption with constraint satisfaction algorithms. Machine Learning, 55(2), 137\u2013174.","journal-title":"Machine Learning"},{"issue":"3\u20134","key":"294_CR26","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S Muggleton","year":"1995","unstructured":"Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing, Special Issue on Inductive Logic Programming, 13(3\u20134), 245\u2013286.","journal-title":"New Generation Computing, Special Issue on Inductive Logic Programming"},{"key":"294_CR27","unstructured":"Nassif, H., Al-Ali, H., Khuri, S., Keirouz, W., Page, D. (2009). An inductive logic programming approach to validate hexose biochemical knowledge. In: Proceedings of the 19th international conference on ILP (pp. 149\u2013165). Leuven."},{"key":"294_CR28","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng, S.H., de Wolf, R., (eds.) (1997). Foundations of inductive logic programming. Lecture Notes in Computer Science (vol. 1228). Springer.","DOI":"10.1007\/3-540-62927-0"},{"key":"294_CR29","unstructured":"Plotkin, G. (1970). A note on inductive generalization. Edinburgh: Edinburgh University Press."},{"key":"294_CR30","unstructured":"Rossi, F., van Beek, P., Walsh T., (Eds.) (2006). Handbook of constraint programming. New York: Elsevier."},{"key":"294_CR31","doi-asserted-by":"crossref","unstructured":"\u017dakov\u00e1, M., \u017delezn\u00fd, F., Garcia-Sedano, J., Tissot, C.M., Lavra\u010d, N., K\u0159emen, P., Molina, J. (2007). Relational data mining applied to virtual engineering of product designs. In ILP06, LNAI (vol. 4455, pp. 439\u2013453). Springer.","DOI":"10.1007\/978-3-540-73847-3_39"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0294-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-013-0294-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0294-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T23:19:44Z","timestamp":1564960784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-013-0294-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,17]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["294"],"URL":"https:\/\/doi.org\/10.1007\/s10844-013-0294-z","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,17]]}}}