{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T14:28:56Z","timestamp":1695652136893},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T00:00:00Z","timestamp":1194652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10994-007-5034-6","type":"journal-article","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T10:18:57Z","timestamp":1194603537000},"page":"189-206","source":"Crossref","is-referenced-by-count":16,"title":["Margin-based first-order rule learning"],"prefix":"10.1007","volume":"70","author":[{"given":"Ulrich","family":"R\u00fcckert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,10]]},"reference":[{"issue":"3","key":"5034_CR1","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/S0022-0000(03)00038-2","volume":"66","author":"S. Ben-David","year":"2003","unstructured":"Ben-David, S., Eiron, N., & Long, P. M. (2003). On the difficulty of approximately maximizing agreements. Journal of Computer and System Sciences, 66(3), 496\u2013514.","journal-title":"Journal of Computer and System Sciences"},{"key":"5034_CR2","first-page":"335","volume-title":"Proceedings of the sixteenth national conference on artificial intelligence (AAAI-99)","author":"W. Cohen","year":"1999","unstructured":"Cohen, W., & Singer, Y. (1999). A simple, fast, and effective rule learner. In Proceedings of the sixteenth national conference on artificial intelligence (AAAI-99) (pp. 335\u2013342). Menlo Park: AAAI Press."},{"issue":"1","key":"5034_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L. D. Raedt De","year":"1997","unstructured":"De\u00a0Raedt, L. D. (1997). Logical settings for concept-learning. Artificial Intelligence, 95(1), 187\u2013201.","journal-title":"Artificial Intelligence"},{"key":"5034_CR4","unstructured":"Dias, A. M. (2006). CxProlog. http:\/\/ctp.di.fct.unl.pt\/~amd\/cxprolog\/ ."},{"key":"5034_CR5","unstructured":"Friedman, J. H., & Popescu, B. E. (2005). Predictive learning via rule ensembles (Technical report). Stanford University."},{"key":"5034_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58, 13\u201330.","journal-title":"Journal of the American Statistical Association"},{"key":"5034_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An introduction to computational learning theory","author":"M. J. Kearns","year":"1994","unstructured":"Kearns, M. J., & Vazirani, U. V. (1994). An introduction to computational learning theory. Cambridge: MIT Press."},{"issue":"3\u20134","key":"5034_CR8","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF03037232","volume":"13","author":"R. King","year":"1995","unstructured":"King, R., & Srinivasan, A. (1995). Relating chemical activity to structure: an examination of ILP successes. New Generation Computing, Special issue on Inductive Logic Programming, 13(3\u20134), 411\u2013434.","journal-title":"New Generation Computing, Special issue on Inductive Logic Programming"},{"key":"5034_CR9","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-662-04599-2_11","volume-title":"Relational Data Mining","author":"S. Kramer","year":"2001","unstructured":"Kramer, S., Lavrac, N., & Flach, P. (2001). Propositionalization approaches to relational data mining. In S.\u00a0Dzeroski & N. Lavrac (Eds.), Relational Data Mining (pp. 262\u2013291). Berlin: Springer."},{"key":"5034_CR10","volume-title":"Proceedings of the twenty-first national conference on artificial intelligence and the eighteenth innovative applications of artificial intelligence conference","author":"N. Landwehr","year":"2006","unstructured":"Landwehr, N., Passerini, A., De Raedt, L., & Frasconi, P. (2006). kFOIL: Learning simple relational kernels. In Proceedings of the twenty-first national conference on artificial intelligence and the eighteenth innovative applications of artificial intelligence conference, Boston, Massachusetts, USA, 16\u201320 July 2006. Menlo Park: AAAI Press."},{"issue":"5","key":"5034_CR11","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1021\/ci050135u","volume":"45","author":"H. Li","year":"2005","unstructured":"Li, H., Yap, C. W., Ung, C. Y., Xue, Y., Cao, Z. W., & Chen, Y. Z. (2005). Effect of selection of molecular descriptors on the prediction of blood-brain barrier penetrating and nonpenetrating agents by statistical learning methods. Journal of Chemical Information and Modeling, 45(5), 1376\u20131384.","journal-title":"Journal of Chemical Information and Modeling"},{"key":"5034_CR12","series-title":"London mathematical society lecture note series","first-page":"148","volume-title":"Surveys in combinatorics","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C. (1989). On the method of bounded differences. In London mathematical society lecture note series : Vol. 141. Surveys in combinatorics (pp. 148\u2013188). Cambridge: Cambridge Univ. Press."},{"key":"5034_CR13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/11563983_15","volume-title":"Discovery science","author":"S. Muggleton","year":"2005","unstructured":"Muggleton, S., Lodhi, H., Amini, A., & Sternberg, M.\u00a0J.\u00a0E. (2005). Support vector inductive logic programming. In A.\u00a0G. Hoffmann, H. Motoda, & T. Scheffer (Eds.), Discovery science (pp. 163\u2013175). New York: Springer."},{"key":"5034_CR14","unstructured":"Popescul, A., & Ungar, L. (2003). Statistical relational learning for link prediction. In IJCAI workshop on learning statistical models from relational data."},{"key":"5034_CR15","first-page":"564","volume-title":"Proceedings of the ACM symposium on applied computing","author":"U. R\u00fcckert","year":"2004","unstructured":"R\u00fcckert, U., & Kramer, S. (2004). Frequent free tree discovery in graph data. In H. Haddad & A. Omicini (Eds.), Proceedings of the ACM symposium on applied computing (pp. 564\u2013570). New York: ACM."},{"key":"5034_CR16","first-page":"785","volume-title":"Machine learning, proceedings of the twenty-third international conference (ICML 2006)","author":"U. R\u00fcckert","year":"2006","unstructured":"R\u00fcckert, U., & Kramer, S. (2006). A statistical approach to rule learning. In Machine learning, proceedings of the twenty-third international conference (ICML 2006) (pp. 785\u2013792), Pittsburgh, Pennsylvania, USA, 25\u201329 June 2006. New York: ACM."},{"issue":"1\u20132","key":"5034_CR17","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0004-3702(95)00122-0","volume":"85","author":"A. Srinivasan","year":"1996","unstructured":"Srinivasan, A., Muggleton, S., Sternberg, M.\u00a0J.\u00a0E., & King, R.\u00a0D. (1996). Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence, 85(1\u20132), 277\u2013299.","journal-title":"Artificial Intelligence"},{"key":"5034_CR18","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/11430919_68","volume-title":"PAKDD","author":"A. Wo\u017anica","year":"2005","unstructured":"Wo\u017anica, A., Kalousis, A., & Hilario, M. (2005). Kernels over relational algebra structures. In T.\u00a0B. Ho, D.\u00a0Cheung, & H. Liu (Eds.), Lecture notes in computer science : Vol. 3518. PAKDD (pp. 588\u2013598). Berlin: Springer."},{"key":"5034_CR19","doi-asserted-by":"crossref","first-page":"2575","DOI":"10.1021\/jm0000564","volume":"43","author":"F. Yoshida","year":"2000","unstructured":"Yoshida, F., & Topliss, J. (2000). QSAR model for drug human oral bioavailability. Journal of Medicinal Chemistry, 43, 2575\u20132585.","journal-title":"Journal of Medicinal Chemistry"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5034-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-007-5034-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5034-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:24Z","timestamp":1559338824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-007-5034-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,10]]},"references-count":19,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["5034"],"URL":"https:\/\/doi.org\/10.1007\/s10994-007-5034-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,10]]}}}