{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:50:10Z","timestamp":1762444210522},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,11,25]],"date-time":"2010-11-25T00:00:00Z","timestamp":1290643200000},"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":[[2011,3]]},"DOI":"10.1007\/s10994-010-5225-4","type":"journal-article","created":{"date-parts":[[2010,11,24]],"date-time":"2010-11-24T16:29:29Z","timestamp":1290616169000},"page":"399-443","source":"Crossref","is-referenced-by-count":31,"title":["Knows what it knows: a\u00a0framework for\u00a0self-aware learning"],"prefix":"10.1007","volume":"82","author":[{"given":"Lihong","family":"Li","sequence":"first","affiliation":[]},{"given":"Michael L.","family":"Littman","sequence":"additional","affiliation":[]},{"given":"Thomas J.","family":"Walsh","sequence":"additional","affiliation":[]},{"given":"Alexander L.","family":"Strehl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,25]]},"reference":[{"key":"5225_CR1","first-page":"1","volume-title":"Proceedings of the twenty-second international conference on machine learning","author":"P. Abbeel","year":"2005","unstructured":"Abbeel, P., & Ng, A. Y. (2005). Exploration and apprenticeship learning in reinforcement learning. In Proceedings of the twenty-second international conference on machine learning (pp. 1\u20138)."},{"key":"5225_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319\u2013342.","journal-title":"Machine Learning"},{"key":"5225_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.tcs.2003.11.004","volume":"313","author":"D. Angluin","year":"2004","unstructured":"Angluin, D. (2004). Queries revisited. Theoretical Computer Science, 313, 175\u2013194.","journal-title":"Theoretical Computer Science"},{"key":"5225_CR4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1162\/153244303321897663","volume":"3","author":"P. Auer","year":"2002","unstructured":"Auer, P. (2002). Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research, 3, 397\u2013422.","journal-title":"Journal of Machine Learning Research"},{"key":"5225_CR5","unstructured":"Bagnell, J., Ng, A. Y., & Schneider, J. (2001). Solving uncertain Markov decision problems (Technical Report CMU-RI-TR-01-25). Robotics Institute, Carnegie Mellon University, Pittsburgh, PA."},{"key":"5225_CR6","volume-title":"Dynamic programming","author":"R. Bellman","year":"1957","unstructured":"Bellman, R. (1957). Dynamic programming. Princeton: Princeton University Press."},{"key":"5225_CR7","volume-title":"Stochastic optimal control: The discrete time case","author":"D. Bertsekas","year":"1978","unstructured":"Bertsekas, D., & Shreve, S. (1978). Stochastic optimal control: The discrete time case. New York: Academic Press."},{"key":"5225_CR8","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1137\/S009753979223455X","volume":"23","author":"A. Blum","year":"1994","unstructured":"Blum, A. (1994). Separating distribution-free and mistake-bound learning models over the Boolean domain. SIAM Journal on Computing, 23, 990\u20131000.","journal-title":"SIAM Journal on Computing"},{"key":"5225_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.575","volume":"11","author":"C. Boutilier","year":"1999","unstructured":"Boutilier, C., Dean, T., & Hanks, S. (1999). Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 11, 1\u201394.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5225_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1162\/153244303765208377","volume":"3","author":"R. I. Brafman","year":"2002","unstructured":"Brafman, R. I., & Tennenholtz, M. (2002). R-MAX\u2014a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research, 3, 213\u2013231.","journal-title":"Journal of Machine Learning Research"},{"key":"5225_CR11","first-page":"53","volume-title":"Proceedings of the twenty-fourth conference on uncertainty in artificial intelligence (UAI-08)","author":"E. Brunskill","year":"2008","unstructured":"Brunskill, E., Leffler, B. R., Li, L., Littman, M. L., & Roy, N. (2008). CORL: A continuous-state offset-dynamics reinforcement learner. In Proceedings of the twenty-fourth conference on uncertainty in artificial intelligence (UAI-08) (pp. 53\u201361)."},{"key":"5225_CR12","first-page":"1955","volume":"10","author":"E. Brunskill","year":"2009","unstructured":"Brunskill, E., Leffler, B. R., Li, L., Littman, M. L., & Roy, N. (2009). Provably efficient learning with typed parametric models. Journal of Machine Learning Research, 10, 1955\u20131988.","journal-title":"Journal of Machine Learning Research"},{"key":"5225_CR13","doi-asserted-by":"crossref","first-page":"2152","DOI":"10.1109\/TIT.2005.847729","volume":"51","author":"N. Cesa-Bianchi","year":"2005","unstructured":"Cesa-Bianchi, N., Lugosi, G., & Stoltz, G. (2005). Minimizing regret with label efficient prediction. IEEE Transactions on Information Theory, 51, 2152\u20132162.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5225_CR14","first-page":"1205","volume":"7","author":"N. Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Gentile, C., & Zaniboni, L. (2006). Worst-case analysis of selective sampling for linear classification. Journal of Machine Learning Research, 7, 1205\u20131230.","journal-title":"Journal of Machine Learning Research"},{"key":"5225_CR15","first-page":"121","volume-title":"Proceedings of the twenty-sixth international conference on machine learning (ICML-09)","author":"N. Cesa-Bianchi","year":"2009","unstructured":"Cesa-Bianchi, N., Gentile, C., & Orabona, F. (2009). Robust bounds for classification via selective sampling. In Proceedings of the twenty-sixth international conference on machine learning (ICML-09) (pp. 121\u2013128)."},{"key":"5225_CR16","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/0885-064X(89)90021-6","volume":"5","author":"C.-S. Chow","year":"1989","unstructured":"Chow, C.-S., & Tsitsiklis, J. N. (1989). The complexity of dynamic programming. Journal of Complexity, 5, 466\u2013488.","journal-title":"Journal of Complexity"},{"key":"5225_CR17","first-page":"201","volume":"15","author":"D. A. Cohn","year":"1994","unstructured":"Cohn, D. A., Atlas, L., & Ladner, R. E. (1994). Improving generalization with active learning. Machine Learning, 15, 201\u2013221.","journal-title":"Machine Learning"},{"key":"5225_CR18","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1111\/j.1467-8640.1989.tb00324.x","volume":"5","author":"T. Dean","year":"1989","unstructured":"Dean, T., & Kanazawa, K. (1989). A model for reasoning about persistence and causation. Computational Intelligence, 5, 142\u2013150.","journal-title":"Computational Intelligence"},{"key":"5225_CR19","first-page":"249","volume-title":"Proceedings of the twenty-sixth international conference on machine learning (ICML-09)","author":"C. Diuk","year":"2009","unstructured":"Diuk, C., Li, L., & Leffler, B. R. (2009). The adaptive k-meteorologists problem and its application to structure discovery and feature selection in reinforcement learning. In Proceedings of the twenty-sixth international conference on machine learning (ICML-09) (pp. 249\u2013256)."},{"key":"5225_CR20","first-page":"226","volume-title":"Proceedings of the twelfth international conference on machine learning (ICML-95)","author":"P. W. L. Fong","year":"1995","unstructured":"Fong, P. W. L. (1995a). A quantitative study of hypothesis selection. In Proceedings of the twelfth international conference on machine learning (ICML-95) (pp. 226\u2013234)."},{"key":"5225_CR21","unstructured":"Fong, P. W. L. (1995b). A\u00a0quantitative study of hypothesis selection. Master\u2019s thesis, Department of Computer Science, University of Waterloo, Ontario, Canada."},{"key":"5225_CR22","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1145\/258533.258616","volume-title":"STOC\u201997: Proceedings of the twenty-ninth annual ACM symposium on theory of computing","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1997a). Using and combining predictors that specialize. In STOC\u201997: Proceedings of the twenty-ninth annual ACM symposium on theory of computing (pp. 334\u2013343)."},{"key":"5225_CR23","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1007330508534","volume":"28","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Seung, H. S., Shamir, E., & Tishby, N. (1997b). Selective sampling using the query by committee algorithm. Machine Learning, 28, 133\u2013168.","journal-title":"Machine Learning"},{"key":"5225_CR24","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1214\/009053604000000058","volume":"32","author":"Y. Freund","year":"2004","unstructured":"Freund, Y., Mansour, Y., & Schapire, R. E. (2004). Generalization bounds for averaged classifiers. The Annals of Statistics, 32, 1698\u20131722.","journal-title":"The Annals of Statistics"},{"key":"5225_CR25","volume-title":"Matrix computations","author":"G. H. Golub","year":"1989","unstructured":"Golub, G. H., & Van Loan, C. F. (1989). Matrix computations (2nd ed.). Baltimore: The Johns Hopkins University Press.","edition":"2"},{"key":"5225_CR26","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/inco.2000.2870","volume":"161","author":"D. P. Helmbold","year":"2000","unstructured":"Helmbold, D. P., Littlestone, N., & Long, P. M. (2000). Apple tasting. Information and Computation, 161, 85\u2013139.","journal-title":"Information and Computation"},{"key":"5225_CR27","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","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":"5225_CR28","unstructured":"Kakade, S. M. (2003). On the sample complexity of reinforcement learning. Doctoral dissertation, Gatsby Computational Neuroscience Unit, University College London."},{"key":"5225_CR29","volume-title":"Proceedings of the 20th international conference on machine learning","author":"S. Kakade","year":"2003","unstructured":"Kakade, S., Kearns, M., & Langford, J. (2003). Exploration in metric state spaces. In Proceedings of the 20th international conference on machine learning."},{"key":"5225_CR30","first-page":"740","volume-title":"Proceedings of the 16th International joint conference on artificial intelligence (IJCAI)","author":"M. J. Kearns","year":"1999","unstructured":"Kearns, M. J., & Koller, D. (1999). Efficient reinforcement learning in factored MDPs. In Proceedings of the 16th International joint conference on artificial intelligence (IJCAI) (pp. 740\u2013747)."},{"key":"5225_CR31","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/S0022-0000(05)80062-5","volume":"48","author":"M. J. Kearns","year":"1994","unstructured":"Kearns, M. J., & Schapire, R. E. (1994). Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48, 464\u2013497.","journal-title":"Journal of Computer and System Sciences"},{"key":"5225_CR32","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1017984413808","volume":"49","author":"M. J. Kearns","year":"2002","unstructured":"Kearns, M. J., & Singh, S. P. (2002). Near-optimal reinforcement learning in polynomial time. Machine Learning, 49, 209\u2013232.","journal-title":"Machine Learning"},{"key":"5225_CR33","first-page":"115","volume":"17","author":"M. J. Kearns","year":"1994","unstructured":"Kearns, M. J., Schapire, R. E., & Sellie, L. (1994). Toward efficient agnostic learning. Machine Learning, 17, 115\u2013141.","journal-title":"Machine Learning"},{"key":"5225_CR34","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1017932429737","volume":"49","author":"M. J. Kearns","year":"2002","unstructured":"Kearns, M. J., Mansour, Y., & Ng, A. Y. (2002). A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Machine Learning, 49, 193\u2013208.","journal-title":"Machine Learning"},{"key":"5225_CR35","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1145\/225298.225328","volume-title":"Proceedings of the eighth annual conference on computational learning theory (COLT-95)","author":"N. Klasner","year":"1995","unstructured":"Klasner, N., & Simon, H. U. (1995). From noise-free to noise-tolerant and from on-line to batch learning. In Proceedings of the eighth annual conference on computational learning theory (COLT-95) (pp. 250\u2013257)."},{"key":"5225_CR36","first-page":"282","volume-title":"Proceedings of the seventeenth European conference on machine learning (ECML-06)","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., & Szepesv\u00e1ri, C. (2006). Bandit based Monte-Carlo planning. In Proceedings of the seventeenth European conference on machine learning (ECML-06) (pp. 282\u2013293)."},{"key":"5225_CR37","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1021830128811","volume":"51","author":"T. Lane","year":"2003","unstructured":"Lane, T., & Brodley, C. E. (2003). An empirical study of two approaches to sequence learning for anomaly detection. Machine Learning, 51, 73\u2013107.","journal-title":"Machine Learning"},{"key":"5225_CR38","volume-title":"Proceedings of the twenty-second conference on artificial intelligence (AAAI-07)","author":"B. R. Leffler","year":"2007","unstructured":"Leffler, B. R., Littman, M. L., & Edmunds, T. (2007). Efficient reinforcement learning with relocatable action models. In Proceedings of the twenty-second conference on artificial intelligence (AAAI-07)."},{"key":"5225_CR39","unstructured":"Li, L. (2009). A unifying framework for computational reinforcement learning theory. Doctoral dissertation, Rutgers University, New Brunswick, NJ."},{"key":"5225_CR40","author":"L. Li","year":"2010","unstructured":"Li, L., & Littman, M. L. (2010). Reducing reinforcement learning to KWIK online regression. Annals of Mathematics and Artificial Intelligence. doi: 10.1007\/s10472-010-9201-2 .","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"5225_CR41","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1145\/1390156.1390228","volume-title":"Proceedings of the twenty-fifth international conference on machine learning","author":"L. Li","year":"2008","unstructured":"Li, L., Littman, M. L., & Walsh, T. J. (2008). Knows what it knows: A framework for self-aware learning. In Proceedings of the twenty-fifth international conference on machine learning (pp. 568\u2013575)."},{"key":"5225_CR42","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1145\/1772690.1772758","volume-title":"Proceedings of the nineteenth international conference on World Wide Web (WWW-10)","author":"L. Li","year":"2010","unstructured":"Li, L., Chu, W., Langford, J., & Schapire, R. E. (2010). A contextual-bandit approach to personalized news article recommendation. In Proceedings of the nineteenth international conference on World Wide Web (WWW-10) (pp. 661\u2013670)."},{"key":"5225_CR43","first-page":"285","volume":"2","author":"N. Littlestone","year":"1987","unstructured":"Littlestone, N. (1987). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285\u2013318.","journal-title":"Machine Learning"},{"key":"5225_CR44","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/B978-0-08-094829-4.50022-2","volume-title":"Proceedings of the second annual workshop on computational learning theory (COLT-89)","author":"N. Littlestone","year":"1989","unstructured":"Littlestone, N. (1989). From on-line to batch learning. In Proceedings of the second annual workshop on computational learning theory (COLT-89) (pp. 269\u2013284)."},{"key":"5225_CR45","first-page":"103","volume":"13","author":"A. W. Moore","year":"1993","unstructured":"Moore, A. W., & Atkeson, C. G. (1993). Prioritized sweeping: Reinforcement learning with less data and less real time. Machine Learning, 13, 103\u2013130.","journal-title":"Machine Learning"},{"key":"5225_CR46","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes\u2014discrete stochastic dynamic programming","author":"M. L. Puterman","year":"1994","unstructured":"Puterman, M. L. (1994). Markov decision processes\u2014discrete stochastic dynamic programming. New York: Wiley."},{"key":"5225_CR47","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/130385.130417","volume-title":"Proceedings of the fifth annual workshop on computational learning theory (COLT-92)","author":"H. S. Seung","year":"1992","unstructured":"Seung, H. S., Opper, M., & Tishby, N. (1992). Query by committee. In Proceedings of the fifth annual workshop on computational learning theory (COLT-92) (pp. 287\u2013294)."},{"key":"5225_CR48","first-page":"371","volume":"9","author":"G. Shafer","year":"2008","unstructured":"Shafer, G., & Vovk, V. (2008). A tutorial on conformal prediction. Journal of Machine Learning Research, 9, 371\u2013421.","journal-title":"Journal of Machine Learning Research"},{"key":"5225_CR49","first-page":"227","volume":"16","author":"S. P. Singh","year":"1994","unstructured":"Singh, S. P., & Yee, R. C. (1994). An upper bound on the loss from approximate optimal-value functions. Machine Learning, 16, 227.","journal-title":"Machine Learning"},{"key":"5225_CR50","series-title":"Texts in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0577-7","volume-title":"Mathematical control theory: Deterministic finite dimensional systems","author":"E. D. Sontag","year":"1998","unstructured":"Sontag, E. D. (1998). Texts in Applied Mathematics: Vol.\u00a06. Mathematical control theory: Deterministic finite dimensional systems (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"5225_CR51","unstructured":"Strehl, A. L., & Littman, M. L. (2008). Online linear regression and its application to model-based reinforcement learning. Advances in Neural Information Processing Systems, 20."},{"key":"5225_CR52","volume-title":"Proceedings of the 22nd conference on uncertainty in artificial intelligence (UAI 2006)","author":"A. L. Strehl","year":"2006","unstructured":"Strehl, A. L., Li, L., & Littman, M. L. (2006a). Incremental model-based learners with formal learning-time guarantees. In Proceedings of the 22nd conference on uncertainty in artificial intelligence (UAI 2006)."},{"key":"5225_CR53","volume-title":"Proceedings of the twenty-third international conference on machine learning (ICML-06)","author":"A. L. Strehl","year":"2006","unstructured":"Strehl, A. L., Li, L., Wiewiora, E., Langford, J., & Littman, M. L. (2006b). PAC model-free reinforcement learning. In Proceedings of the twenty-third international conference on machine learning (ICML-06)."},{"key":"5225_CR54","volume-title":"Proceedings of the twenty-third international conference on machine learning (ICML-06)","author":"A. L. Strehl","year":"2006","unstructured":"Strehl, A. L., Mesterharm, C., Littman, M. L., & Hirsh, H. (2006c). Experience-efficient learning in associative bandit problems. In Proceedings of the twenty-third international conference on machine learning (ICML-06)."},{"key":"5225_CR55","volume-title":"Proceedings of the twenty-second national conference on artificial intelligence (AAAI-07)","author":"A. L. Strehl","year":"2007","unstructured":"Strehl, A. L., Diuk, C., & Littman, M. L. (2007). Efficient structure learning in factored-state MDPs. In Proceedings of the twenty-second national conference on artificial intelligence (AAAI-07)"},{"key":"5225_CR56","first-page":"2413","volume":"10","author":"A. L. Strehl","year":"2009","unstructured":"Strehl, A. L., Li, L., & Littman, M. L. (2009). Reinforcement learning in finite MDPs: PAC analysis. Journal of Machine Learning Research, 10, 2413\u20132444.","journal-title":"Journal of Machine Learning Research"},{"key":"5225_CR57","volume-title":"Reinforcement learning: An introduction","author":"R. S. Sutton","year":"1998","unstructured":"Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction. Cambridge: The MIT Press."},{"key":"5225_CR58","volume-title":"Proceedings of the twenty-seventh international conference on machine learning (ICML-2010)","author":"I. Szita","year":"2010","unstructured":"Szita, I., & Szepesv\u00e1ri, C. (2010). Model-based reinforcement learning with nearly tight exploration complexity bounds. In Proceedings of the twenty-seventh international conference on machine learning (ICML-2010)."},{"key":"5225_CR59","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"5225_CR60","first-page":"591","volume-title":"Proceedings of the twenty-fifth conference on uncertainty in artificial intelligence (UAI-09)","author":"T. J. Walsh","year":"2009","unstructured":"Walsh, T. J., Szita, I., Diuk, C., & Littman, M. L. (2009). Exploring compact reinforcement-learning representations with linear regression. In Proceedings of the twenty-fifth conference on uncertainty in artificial intelligence (UAI-09) (pp. 591\u2013598). A refined version is available as Technical Report DCS-tr-660, Department of Computer Science, Rutgers University, December, 2009."},{"key":"5225_CR61","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1233321.1233325","volume":"8","author":"G. M. Weiss","year":"2006","unstructured":"Weiss, G. M., & Tian, Y. (2006). Maximizing classifier utility when training data is costly. SIGKDD Explorations, 8, 31\u201338.","journal-title":"SIGKDD Explorations"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5225-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5225-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5225-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,14]],"date-time":"2021-11-14T02:52:34Z","timestamp":1636858354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5225-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,25]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["5225"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5225-4","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,25]]}}}