{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T16:40:07Z","timestamp":1712421607345},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,5,8]],"date-time":"2011-05-08T00:00:00Z","timestamp":1304812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10115-011-0406-4","type":"journal-article","created":{"date-parts":[[2011,5,7]],"date-time":"2011-05-07T07:50:31Z","timestamp":1304754631000},"page":"55-78","source":"Crossref","is-referenced-by-count":5,"title":["Distribution-free bounds for relational classification"],"prefix":"10.1007","volume":"31","author":[{"given":"Amit","family":"Dhurandhar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alin","family":"Dobra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,8]]},"reference":[{"issue":"5","key":"406_CR1","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1016\/j.ic.2006.03.001","volume":"204","author":"M Arias","year":"2006","unstructured":"Arias M, Feigelson A, Khardon R, Servedio R (2006) Polynomial certificates for propositional classes. Inf Comput 204(5): 816\u2013834","journal-title":"Inf Comput"},{"issue":"1","key":"406_CR2","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/S0890-5401(02)93162-7","volume":"178","author":"M Arias","year":"2002","unstructured":"Arias M, Khardon R (2002) Learning closed horn expressions. Inf Comput 178(1): 214\u2013240","journal-title":"Inf Comput"},{"key":"406_CR3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7443.001.0001","volume-title":"Predicting structured data","author":"G Bakir","year":"2007","unstructured":"Bakir G, Hofmann T, Sch\u00f6lkopf B, Smola A, Taskar B, Vishwanathan SVN (2007) Predicting structured data. The MIT Press, Cambridge"},{"key":"406_CR4","first-page":"44","volume":"33","author":"P Bartlett","year":"2002","unstructured":"Bartlett P, Bousquet O, Mendelson S (2002) Local rademacher complexities. Ann Stat 33: 44\u201358","journal-title":"Ann Stat"},{"key":"406_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1080\/01621459.1962.10482149","volume":"57","author":"G Bennett","year":"1962","unstructured":"Bennett G (1962) Probability inequalities for the sums of independent random variables. JASA 57: 33\u201345","journal-title":"JASA"},{"key":"406_CR6","doi-asserted-by":"crossref","unstructured":"Blum A, Kalai A, Langford J (1999) Beating the hold-out: bounds for k-fold and progressive cross-validation. Comput Learn Theory 203\u2013208","DOI":"10.1145\/307400.307439"},{"key":"406_CR7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A Blumer","year":"1987","unstructured":"Blumer A, Ehrenfueucht A, Haussler D, Warmuth M (1987) Occam\u2019s razor. Inf Process Lett 24: 377\u2013380","journal-title":"Inf Process Lett"},{"key":"406_CR8","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff H (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Stat 23: 493\u2013507","journal-title":"Ann Math Stat"},{"key":"406_CR9","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF03037231","volume":"13","author":"W Cohen","year":"1995","unstructured":"Cohen W (1995) Polynomial learnability and inductive logic programming: methods and results. New Gener Comput 13: 369\u2013409","journal-title":"New Gener Comput"},{"key":"406_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic theory of pattern recognition","author":"L Devroye","year":"1996","unstructured":"Devroye L, Gy\u00f6rfi L, Lugosi G (1996) A Probabilistic theory of pattern recognition. Springer, New York"},{"key":"406_CR11","first-page":"269","volume":"21","author":"S Floyd","year":"1995","unstructured":"Floyd S, Warmuth M (1995) Sample compression, learnability and the vapnik-chervonenkis dimension. Mach Learn 21: 269\u2013304","journal-title":"Mach Learn"},{"key":"406_CR12","unstructured":"Friedman N, Getoor L, Koller D, Pfeffer A (1999) Learning probabilistic relational models. IJCAI 1300\u20131309"},{"key":"406_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to statistical relational learning","author":"L Getoor","year":"2007","unstructured":"Getoor L, Taskar B (2007) Introduction to statistical relational learning. MIT Press, Cambridge"},{"key":"406_CR14","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1080\/01621459.1955.10501978","volume":"50","author":"H Godwin","year":"1955","unstructured":"Godwin H (1955) On generalization of tchebyshev\u2019s inequality. JASA 50: 923\u2013945","journal-title":"JASA"},{"key":"406_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198572237.001.0001","volume-title":"Probability and random processes","author":"G Grimmett","year":"2001","unstructured":"Grimmett G, Stirzaker D (2001) Probability and random processes, 3rd edn. Oxford University Press, Oxford","edition":"3"},{"issue":"301","key":"406_CR16","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. JASA 58(301): 13\u201330","journal-title":"JASA"},{"key":"406_CR17","unstructured":"Hulten G, Domingos P, Abe Y (2003) Mining massive relational databases"},{"key":"406_CR18","unstructured":"Jensen D, Neville J (2002) Linkage and autocorrelation cause feature selection bias in relational learning"},{"key":"406_CR19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02418571","volume":"30","author":"J Jensen","year":"1906","unstructured":"Jensen J (1906) Sur les fonctions convexes et les ingalits entre les valeurs moyennes. Acta Math 30: 175\u2013193","journal-title":"Acta Math"},{"key":"406_CR20","doi-asserted-by":"crossref","unstructured":"Jia Y, Zhang J, Huan J (2011) An efficient graph-mining method for complicated and noisy data with real-world applications. Knowl Inf Syst","DOI":"10.1007\/s10115-010-0376-y"},{"key":"406_CR21","unstructured":"Kok S, Singla P, Richardson M, Domingos P (2005) The alchemy system for statistical relational ai. Technical report, department of computer science and engineering, UW, http:\/\/www.cs.washington.edu\/ai\/alchemy\/"},{"key":"406_CR22","first-page":"273","volume":"6","author":"J Langford","year":"2005","unstructured":"Langford J (2005) Tutorial on practical prediction theory for classification. J Mach Learn Res 6: 273\u2013306","journal-title":"J Mach Learn Res"},{"key":"406_CR23","doi-asserted-by":"crossref","unstructured":"Mcallester D (1999) Pac-bayesian model averaging. In: Proceedings of the twelfth annual conference on computational learning theory. ACM Press, pp 164\u2013170","DOI":"10.1145\/307400.307435"},{"key":"406_CR24","unstructured":"Neville J (2006) Statistical models and analysis techniques for learning in relational data. Ph.D. Thesis, University of Massachusetts Amhers"},{"key":"406_CR25","doi-asserted-by":"crossref","unstructured":"Neville J, Gallagher B, Eliassi-Rad T, Wang T (2011) Correcting evaluation bias of relational classifiers with network cross validation. Knowl Inf Syst","DOI":"10.1007\/s10115-010-0373-1"},{"key":"406_CR26","doi-asserted-by":"crossref","unstructured":"Neville J, Jensen D (2005) Leveraging relational autocorrelation with latent group models. In: MRDM \u201905: Proceedings of the 4th international workshop on Multi-relational mining. ACM, New York, NY, USA, pp 49\u201355","DOI":"10.1145\/1090193.1090201"},{"key":"406_CR27","first-page":"653","volume":"8","author":"J Neville","year":"2007","unstructured":"Neville J, Jensen D (2007) Relational dependency networks. J Mach Learn Res 8: 653\u2013692","journal-title":"J Mach Learn Res"},{"key":"406_CR28","unstructured":"Neville J, Jensen D, Gallagher B (2003) Simple estimators for relational bayesian classifiers"},{"key":"406_CR29","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02883985","volume":"10","author":"M Okamoto","year":"1958","unstructured":"Okamoto M (1958) Some inequalities relating to the partial sum of binomial probabilites. Ann Inst Stat Math 10: 29\u201335","journal-title":"Ann Inst Stat Math"},{"key":"406_CR30","volume-title":"Probability, random variables and stochastic processes","author":"A Papoulis","year":"1991","unstructured":"Papoulis A (1991) Probability, random variables and stochastic processes. 3. McGraw-Hill, New York","edition":"3"},{"issue":"2","key":"406_CR31","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10115-007-0093-3","volume":"14","author":"C Preisach","year":"2008","unstructured":"Preisach C, Schmidt-Thieme L (2008) Ensembles of relational classifiers. Knowl Inf Syst 14(2): 249\u2013272","journal-title":"Knowl Inf Syst"},{"key":"406_CR32","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0004-3702(94)90112-0","volume":"70","author":"L Raedt","year":"1994","unstructured":"Raedt L (1994) First order jk-clausal theories are pac-learnable. Artif Intell 70: 375\u2013392","journal-title":"Artif Intell"},{"key":"406_CR33","doi-asserted-by":"crossref","unstructured":"Reddy C, Park J (2010) Multi-resolution boosting for classification and regression problems. Knowl Inf Syst","DOI":"10.1007\/s10115-010-0358-0"},{"issue":"1\u20132","key":"406_CR34","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson M, Domingos P (2006) Markov logic networks. Mach Learn 62(1\u20132): 107\u2013136","journal-title":"Mach Learn"},{"issue":"2","key":"406_CR35","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1242524.1242528","volume":"32","author":"F Rusu","year":"2007","unstructured":"Rusu F, Dobra A (2007) Pseudo-random number generation for sketch-based estimations. ACM Trans Database Syst 32(2): 11","journal-title":"ACM Trans Database Syst"},{"key":"406_CR36","doi-asserted-by":"crossref","first-page":"211","DOI":"10.6028\/jres.065B.020","volume":"65B","author":"I Savage","year":"1961","unstructured":"Savage I (1961) Probability inequalities of the tchebyshev type. J Res Natl Bur Stand 65B: 211\u2013222","journal-title":"J Res Natl Bur Stand"},{"key":"406_CR37","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/S089548019223872X","volume":"8","author":"J Schmidt","year":"1995","unstructured":"Schmidt J, Siegel A, Srinivasan A (1995) Chernoff-hoeffding bounds for applications with limited independence. SIAM J Discret Math 8: 223\u2013250","journal-title":"SIAM J Discret Math"},{"key":"406_CR38","unstructured":"Taskar B, Abbeel P, Koller D (2002) Discriminative probabilistic models for relational data. In: Proceedings 18th conference on uncertainty in AI, pp 485\u2013492"},{"key":"406_CR39","volume-title":"Statistical learning theory","author":"V Vapnik","year":"1998","unstructured":"Vapnik V (1998) Statistical learning theory. Wiley, New York"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0406-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-011-0406-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0406-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T15:41:07Z","timestamp":1712418067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-011-0406-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,8]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["406"],"URL":"https:\/\/doi.org\/10.1007\/s10115-011-0406-4","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,8]]}}}