{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:56:57Z","timestamp":1760385417688},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T00:00:00Z","timestamp":1431043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s11063-015-9429-2","type":"journal-article","created":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T02:18:11Z","timestamp":1430965091000},"page":"567-602","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Global Rademacher Complexity Bounds: From Slow to Fast Convergence Rates"],"prefix":"10.1007","volume":"43","author":[{"given":"Luca","family":"Oneto","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Ghio","sequence":"additional","affiliation":[]},{"given":"Sandro","family":"Ridella","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Anguita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,8]]},"reference":[{"key":"9429_CR1","volume-title":"Semisupervised learning in computational linguistics","author":"SP Abney","year":"2008","unstructured":"Abney SP (2008) Semisupervised learning in computational linguistics. CRC Press, Boca Raton"},{"key":"9429_CR2","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1214\/EJP.v13-521","volume":"13","author":"R Adamczak","year":"2007","unstructured":"Adamczak R (2007) A tail inequality for suprema of unbounded empirical processes with applications to markov chains. Electron J Probab 13:1000\u20131034","journal-title":"Electron J Probab"},{"key":"9429_CR3","unstructured":"Anava O, Hazan E, Mannor S, Shamir O (2013) Online learning for time series prediction. In: The 26th annual conference on learning theory, Princeton University, NJ, USA"},{"key":"9429_CR4","unstructured":"Anguita D, Ghio A, Oneto L, Ridella S (2011) The impact of unlabeled patterns in rademacher complexity theory for kernel classifiers. In: Proceedings of neural information processing systems"},{"issue":"9","key":"9429_CR5","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1109\/TNNLS.2012.2202401","volume":"23","author":"D Anguita","year":"2012","unstructured":"Anguita D, Ghio A, Oneto L, Ridella S (2012) In-sample and out-of-sample model selection and error estimation for support vector machines. IEEE Trans Neural Netw Learn Syst 23(9):1390\u20131406","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"9429_CR6","unstructured":"Anguita D, Ghio A, Oneto L, Ridella S (2013) A learning machine with a bit-based hypothesis space. In: European symposium on artificial neural networks"},{"key":"9429_CR7","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.patrec.2013.04.027","volume":"37","author":"D Anguita","year":"2014","unstructured":"Anguita D, Ghio A, Oneto L, Ridella S (2014) Unlabeled patterns to tighten Rademacher complexity error bounds for kernel classifiers. Pattern Recognit Lett 37:210\u2013219","journal-title":"Pattern Recognit Lett"},{"key":"9429_CR8","first-page":"1295","volume":"19","author":"D Anguita","year":"2013","unstructured":"Anguita D, Ghio A, Oneto L, Xavier P, Reyes-Ortiz JL (2013) Energy efficient smartphone-based activity recognition using fixed-point arithmetic. J Univers Comput Sci 19:1295\u20131314","journal-title":"J Univers Comput Sci"},{"issue":"9","key":"9429_CR9","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1016\/j.neucom.2010.12.009","volume":"74","author":"D Anguita","year":"2011","unstructured":"Anguita D, Ghio A, Ridella S (2011) Maximal discrepancy for support vector machines. Neurocomputing 74(9):1436\u20131443","journal-title":"Neurocomputing"},{"key":"9429_CR10","unstructured":"Anguita S, Ghio A, Oneto L, Ridella S (2011) Maximal discrepancy vs. rademacher complexity for error estimation. In: European symposium on artificial neural networks"},{"issue":"4","key":"9429_CR11","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1214\/08-AOS623","volume":"37","author":"JY Audibert","year":"2009","unstructured":"Audibert JY (2009) Fast learning rates in statistical inference through aggregation. Ann Stat 37(4):1591\u20131646","journal-title":"Ann Stat"},{"issue":"2","key":"9429_CR12","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1214\/009053606000001217","volume":"35","author":"JY Audibert","year":"2007","unstructured":"Audibert JY, Tsybakov AB (2007) Fast learning rates for plug-in classifiers. Ann Stat 35(2):608\u2013633","journal-title":"Ann Stat"},{"issue":"1\u20133","key":"9429_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1023\/A:1013999503812","volume":"48","author":"PL Bartlett","year":"2002","unstructured":"Bartlett PL, Boucheron S, Lugosi G (2002) Model selection and error estimation. Mach Learn 48(1\u20133):85\u2013113","journal-title":"Mach Learn"},{"key":"9429_CR14","doi-asserted-by":"crossref","unstructured":"Bartlett PL, Bousquet O, Mendelson S (2002) Localized rademacher complexities. In: Proceedings of the 15th annual conference on computational learning theory","DOI":"10.1007\/3-540-45435-7_4"},{"issue":"4","key":"9429_CR15","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1214\/009053605000000282","volume":"33","author":"PL Bartlett","year":"2005","unstructured":"Bartlett PL, Bousquet O, Mendelson S (2005) Local rademacher complexities. Ann Stat 33(4):1497\u20131537","journal-title":"Ann Stat"},{"key":"9429_CR16","first-page":"463","volume":"3","author":"PL Bartlett","year":"2003","unstructured":"Bartlett PL, Mendelson S (2003) Rademacher and gaussian complexities: Risk bounds and structural results. J Mach Learn Res 3:463\u2013482","journal-title":"J Mach Learn Res"},{"key":"9429_CR17","doi-asserted-by":"crossref","unstructured":"Belkin M, Matveeva I, Niyogi P (2004) Regularization and semi-supervised learning on large graphs. In: Conference on learning theory","DOI":"10.1007\/978-3-540-27819-1_43"},{"issue":"1\u20133","key":"9429_CR18","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/B:MACH.0000033120.25363.1e","volume":"56","author":"M Belkin","year":"2004","unstructured":"Belkin M, Niyogi P (2004) Semi-supervised learning on riemannian manifolds. Mach Learn 56(1\u20133):209\u2013239","journal-title":"Mach Learn"},{"key":"9429_CR19","unstructured":"Ben-David S, Lu T, P\u00e1l D (2008) Does unlabeled data provably help? worst-case analysis of the sample complexity of semi-supervised learning. In: Conference on computational learning theory"},{"key":"9429_CR20","unstructured":"Bennett K, Demiriz A (1999) Semi-supervised support vector machines. In: Advances in neural information processing systems 11: proceedings of the 1998 conference, p. 368. The MIT Press, Cambridge"},{"issue":"2","key":"9429_CR21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10986-008-9007-7","volume":"48","author":"V Bentkus","year":"2008","unstructured":"Bentkus V (2008) An extension of the hoeffding inequality to unbounded random variables. Lith Math J 48(2):137\u2013157","journal-title":"Lith Math J"},{"issue":"6","key":"9429_CR22","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, Ehrenfeucht A, Haussler D, Warmuth MK (1987) Occam\u2019s razor. Inf Process Lett 24(6):377\u2013380","journal-title":"Inf Process Lett"},{"issue":"3","key":"9429_CR23","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/(SICI)1098-2418(200005)16:3<277::AID-RSA4>3.0.CO;2-1","volume":"16","author":"S Boucheron","year":"2000","unstructured":"Boucheron S, Lugosi G, Massart P (2000) A sharp concentration inequality with applications. Random Struct Algorithms 16(3):277\u2013292","journal-title":"Random Struct Algorithms"},{"issue":"6","key":"9429_CR24","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/S1631-073X(02)02292-6","volume":"334","author":"O Bousquet","year":"2002","unstructured":"Bousquet O (2002) A bennett concentration inequality and its application to suprema of empirical processes. Comptes Rendus Math 334(6):495\u2013500","journal-title":"Comptes Rendus Math"},{"key":"9429_CR25","first-page":"499","volume":"2","author":"O Bousquet","year":"2002","unstructured":"Bousquet O, Elisseeff A (2002) Stability and generalization. J Mach Learn Res 2:499\u2013526","journal-title":"J Mach Learn Res"},{"key":"9429_CR26","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9780262033589.001.0001","volume-title":"Semi-supervised learning","author":"O Chapelle","year":"2006","unstructured":"Chapelle O, Sch\u00f6lkopf B, Zien A (2006) Semi-supervised learning. MIT press, Cambridge"},{"issue":"1","key":"9429_CR27","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1015007927558","volume":"1","author":"V Cherkassky","year":"2002","unstructured":"Cherkassky V (2002) Model complexity control and statistical learning theory. Nat Comput 1(1):109\u2013133","journal-title":"Nat Comput"},{"key":"9429_CR28","doi-asserted-by":"crossref","DOI":"10.1002\/9780470140529","volume-title":"Learning from data: concepts, theory, and methods","author":"V Cherkassky","year":"2007","unstructured":"Cherkassky V, Mulier FM (2007) Learning from data: concepts, theory, and methods. Wiley, New York"},{"issue":"4","key":"9429_CR29","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1093\/biomet\/26.4.404","volume":"26","author":"CJ Clopper","year":"1934","unstructured":"Clopper CJ, Pearson ES (1934) The use of confidence or fiducial limits illustrated in the case of the binomial. Biometrika 26(4):404","journal-title":"Biometrika"},{"issue":"12","key":"9429_CR30","doi-asserted-by":"crossref","first-page":"1553","DOI":"10.1109\/TPAMI.2004.127","volume":"26","author":"I Cohen","year":"2004","unstructured":"Cohen I, Cozman FG, Sebe N, Cirelo MC, Huang TS (2004) Semisupervised learning of classifiers: theory, algorithms, and their application to human-computer interaction. IEEE Trans Pattern Anal Mach Intell 26(12):1553\u20131566","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"9429_CR31","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02124750","volume":"5","author":"RM Corless","year":"1996","unstructured":"Corless RM, Gonnet GH, Hare DEG, Jeffrey DJ, Knuth DE (1996) On the Lambert w function. Adv Comput Math 5(1):329\u2013359","journal-title":"Adv Comput Math"},{"key":"9429_CR32","unstructured":"Cortes C, Kloft M, Mohri M (2013) Learning kernels using local rademacher complexity. In: Conference on neural information processing systems"},{"issue":"1","key":"9429_CR33","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1613\/jair.2587","volume":"35","author":"R El-Yaniv","year":"2009","unstructured":"El-Yaniv R, Pechyony D (2009) Transductive rademacher complexity and its applications. J Artif Intell Res 35(1):193","journal-title":"J Artif Intell Res"},{"issue":"3","key":"9429_CR34","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(3):269\u2013304","journal-title":"Mach Learn"},{"key":"9429_CR35","unstructured":"Friedland L, Jensen D, Lavine M (2013) Copy or coincidence? a model for detecting social influence and duplication events. In: International conference on machine learning"},{"key":"9429_CR36","unstructured":"Gopal S, Bai B, Yang Y, Niculescu-Mizil A (2013) Bayesian models for large-scale hierarchical classification. In: Neural information processing systems"},{"key":"9429_CR37","doi-asserted-by":"crossref","unstructured":"K\u00e4\u00e4ri\u00e4inen M (2005) Generalization error bounds using unlabeled data. In: Conference on computational learning theory","DOI":"10.1007\/11503415_9"},{"key":"9429_CR38","doi-asserted-by":"crossref","unstructured":"Katrenko S, Van Zaanen M (2010) Rademacher complexity and grammar induction algorithms: what it may (not) tell us. In: Grammatical inference: theoretical results and applications","DOI":"10.1007\/978-3-642-15488-1_29"},{"issue":"6","key":"9429_CR39","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S1631-073X(02)02303-8","volume":"334","author":"T Klein","year":"2002","unstructured":"Klein T (2002) Une in\u00e9galit\u00e9 de concentration \u00e0 gauche pour les processus empiriques. Comptes Rendus Math 334(6):501\u2013504","journal-title":"Comptes Rendus Math"},{"issue":"3","key":"9429_CR40","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1214\/009117905000000044","volume":"33","author":"T Klein","year":"2005","unstructured":"Klein T, Rio E (2005) Concentration around the mean for maxima of empirical processes. Ann Probab 33(3):1060\u20131077","journal-title":"Ann Probab"},{"key":"9429_CR41","unstructured":"Kloft M, Blanchard G (2011) The local rademacher complexity of lp-norm multiple kernel learning. In: Neural information processing systems"},{"issue":"5","key":"9429_CR42","doi-asserted-by":"crossref","first-page":"1902","DOI":"10.1109\/18.930926","volume":"47","author":"V Koltchinskii","year":"2001","unstructured":"Koltchinskii V (2001) Rademacher penalties and structural risk minimization. IEEE Trans Inf Theory 47(5):1902\u20131914","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"9429_CR43","doi-asserted-by":"crossref","first-page":"2593","DOI":"10.1214\/009053606000001019","volume":"34","author":"V Koltchinskii","year":"2006","unstructured":"Koltchinskii V (2006) Local rademacher complexities and oracle inequalities in risk minimization. Ann Stat 34(6):2593\u20132656","journal-title":"Ann Stat"},{"key":"9429_CR44","unstructured":"Kumar A, Saha A, Daume H (2010) Co-regularization based semi-supervised domain adaptation. In: Advances in neural information processing systems"},{"key":"9429_CR45","unstructured":"Kutin S (2002) Extensions to mcdiarmid\u2019s inequality when differences are bounded with high probability. In: Department Computer Science, University of Chicago, Chicago, IL. Technical report TR-2002-04"},{"issue":"1","key":"9429_CR46","first-page":"273","volume":"6","author":"J Langford","year":"2006","unstructured":"Langford J (2006) Tutorial on practical prediction theory for classification. J Mach Learn Res 6(1):273","journal-title":"J Mach Learn Res"},{"key":"9429_CR47","unstructured":"Langford J, McAllester D (2000) Computable shell decomposition bounds. In: Conference on computational learning theory"},{"key":"9429_CR48","volume-title":"Probability in banach spaces: isoperimetry and processes","author":"M Ledoux","year":"2011","unstructured":"Ledoux M, Talagrand M (2011) Probability in banach spaces: isoperimetry and processes. Springer, Berlin"},{"key":"9429_CR49","volume-title":"Sharpening Occam razor","author":"M Li","year":"2002","unstructured":"Li M, Tromp J, Vit\u00e1nyi P (2002) Sharpening Occam razor. Springer, Berlin"},{"key":"9429_CR50","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M Li","year":"1993","unstructured":"Li M, Vitanyi P (1993) An introduction to Kolmogorov complexity and its applications. Springer, New York"},{"issue":"6","key":"9429_CR51","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1214\/aos\/1017939240","volume":"27","author":"E Mammen","year":"1999","unstructured":"Mammen E, Tsybakov AB (1999) Smooth discrimination analysis. Ann Stat 27(6):1808\u20131829","journal-title":"Ann Stat"},{"issue":"2","key":"9429_CR52","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1214\/aop\/1019160263","volume":"28","author":"P Massart","year":"2000","unstructured":"Massart P (2000) About the constants in talagrand\u2019s concentration inequalities for empirical processes. Ann Probab 28(2):863\u2013884 (English summary)","journal-title":"Ann Probab"},{"key":"9429_CR53","doi-asserted-by":"crossref","unstructured":"McAllester DA (1999) Pac-bayesian model averaging. In: Conference on computational learning theory","DOI":"10.1145\/307400.307435"},{"issue":"1","key":"9429_CR54","first-page":"148","volume":"141","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid C (1989) On the method of bounded differences. Surv Comb 141(1):148\u2013188","journal-title":"Surv Comb"},{"key":"9429_CR55","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.neunet.2013.03.017","volume":"44","author":"L Oneto","year":"2013","unstructured":"Oneto L, Ghio A, Anguita D, Ridella S (2013) An improved analysis of the rademacher data-dependent bound using its self bounding property. Neural Netw 44:107\u2013111","journal-title":"Neural Netw"},{"key":"9429_CR56","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1214\/ECP.v7-1047","volume":"7","author":"D Panchenko","year":"2002","unstructured":"Panchenko D (2002) Some extensions of an inequality of vapnik and chervonenkis. Electron Commun Probab 7:55\u201365","journal-title":"Electron Commun Probab"},{"key":"9429_CR57","first-page":"3507","volume":"13","author":"E Parrado-Hern\u00e1ndez","year":"2012","unstructured":"Parrado-Hern\u00e1ndez E, Ambroladze A, Shawe-Taylor J, Sun S (2012) Pac-bayes bounds with data dependent priors. J Mach Learn Res 13:3507\u20133531","journal-title":"J Mach Learn Res"},{"issue":"9","key":"9429_CR58","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1088\/0305-4470\/26\/9\/016","volume":"26","author":"JMR Parrondo","year":"1993","unstructured":"Parrondo JMR, Van den Broeck C (1993) Vapnik-chervonenkis bounds for generalization. J Phys A 26(9):2211","journal-title":"J Phys A"},{"issue":"4","key":"9429_CR59","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.neunet.2005.10.007","volume":"19","author":"JL Paulo","year":"2006","unstructured":"Paulo JL, Azzam FGT (2006) The use of artificial neural networks in decision support in cancer: a systematic review. Neural Netw 19(4):408\u2013415","journal-title":"Neural Netw"},{"issue":"6981","key":"9429_CR60","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1038\/nature02341","volume":"428","author":"T Poggio","year":"2004","unstructured":"Poggio T, Rifkin R, Mukherjee S, Niyogi P (2004) General conditions for predictivity in learning theory. Nature 428(6981):419\u2013422","journal-title":"Nature"},{"key":"9429_CR61","unstructured":"Rosenberg DS, Bartlett PL (2007) The rademacher complexity of co-regularized kernel classes. In: International conference on artificial intelligence and statistics, pp 396\u2013403"},{"key":"9429_CR62","first-page":"2635","volume":"11","author":"S Shalev-Shwartz","year":"2010","unstructured":"Shalev-Shwartz S, Shamir O, Srebro N, Sridharan K (2010) Learnability, stability and uniform convergence. J Mach Learn Res 11:2635\u20132670","journal-title":"J Mach Learn Res"},{"issue":"8","key":"9429_CR63","doi-asserted-by":"crossref","first-page":"1969","DOI":"10.1162\/089976600300015222","volume":"12","author":"X Shao","year":"2000","unstructured":"Shao X, Cherkassky V, Li W (2000) Measuring the VC-dimension using optimized experimental design. Neural Comput 12(8):1969\u20131986","journal-title":"Neural Comput"},{"issue":"5","key":"9429_CR64","doi-asserted-by":"crossref","first-page":"1926","DOI":"10.1109\/18.705570","volume":"44","author":"J Shawe-Taylor","year":"1998","unstructured":"Shawe-Taylor J, Bartlett PL, Williamson RC, Anthony M (1998) Structural risk minimization over data-dependent hierarchies. IEEE Trans Inf Theory 44(5):1926\u20131940","journal-title":"IEEE Trans Inf Theory"},{"key":"9429_CR65","unstructured":"Srebro N, Sridharan K, Tewari A (2010) Smoothness, low-noise and fast rates. In: Neural information processing systems"},{"issue":"1","key":"9429_CR66","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1186\/2049-2618-1-11","volume":"1","author":"A Statnikov","year":"2013","unstructured":"Statnikov A, Henaff M, Narendra V, Konganti K, Li Z, Yang L, Pei Z, Blaser MJ, Aliferis CF, Alekseyenko AV (2013) A comprehensive evaluation of multicategory classification methods for microbiomic data. Microbiome 1(1):11","journal-title":"Microbiome"},{"key":"9429_CR67","first-page":"2423","volume":"11","author":"S Sun","year":"2010","unstructured":"Sun S, Shawe-Taylor J (2010) Sparse semi-supervised learning using conjugate functions. J Mach Learn Res 11:2423\u20132455","journal-title":"J Mach Learn Res"},{"issue":"1","key":"9429_CR68","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aop\/1042644705","volume":"24","author":"M Talagrand","year":"1996","unstructured":"Talagrand M (1996) A new look at independence. Ann Probab 24(1):1\u201334","journal-title":"Ann Probab"},{"key":"9429_CR69","volume-title":"Statistical learning theory","author":"VN Vapnik","year":"1998","unstructured":"Vapnik VN (1998) Statistical learning theory. Wiley, New York"},{"key":"9429_CR70","volume-title":"Theorie der Zeichenerkennung","author":"VN Vapnik","year":"1979","unstructured":"Vapnik VN, \u010cervonenkis AJ (1979) Theorie der Zeichenerkennung. Akademie-Verlag, Berlin"},{"key":"9429_CR71","unstructured":"Weisstein EW (2013) Lambert W-Function. From MathWorld-A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/LambertW-Function.html"},{"issue":"1","key":"9429_CR72","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00196ED1V01Y200906AIM006","volume":"3","author":"X Zhu","year":"2009","unstructured":"Zhu X, Goldberg AB (2009) Introduction to semi-supervised learning. Synth Lect Artif Intell Mach Learn 3(1):1\u2013130","journal-title":"Synth Lect Artif Intell Mach Learn"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-015-9429-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11063-015-9429-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11063-015-9429-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T14:02:31Z","timestamp":1566655351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11063-015-9429-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,8]]},"references-count":72,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9429"],"URL":"https:\/\/doi.org\/10.1007\/s11063-015-9429-2","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"value":"1370-4621","type":"print"},{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,8]]}}}