{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:53:40Z","timestamp":1753440820281,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T00:00:00Z","timestamp":1603756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T00:00:00Z","timestamp":1603756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key R&D Program of China","award":["No. 2018YFB1004300"],"award-info":[{"award-number":["No. 2018YFB1004300"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672332","61872226"],"award-info":[{"award-number":["61672332","61872226"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976129"],"award-info":[{"award-number":["61976129"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013318","name":"ShanXi Science and Technology Department","doi-asserted-by":"crossref","award":["2017023"],"award-info":[{"award-number":["2017023"]}],"id":[{"id":"10.13039\/501100013318","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi Province","doi-asserted-by":"publisher","award":["201701D121052"],"award-info":[{"award-number":["201701D121052"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Program for the San Jin Young Scholars of Shanxi"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Human beings may make random guesses in decision-making. Occasionally, their guesses may generate consistency with the real situation. This kind of consistency is termed random consistency. In the area of machine leaning, the randomness is unavoidable and ubiquitous in learning algorithms. However, the accuracy (A), which is a fundamental performance measure for machine learning, does not recognize the random consistency. This causes that the classifiers learnt by A contain the random consistency. The random consistency may cause an unreliable evaluation and harm the generalization performance. To solve this problem, the pure accuracy (PA) is defined to eliminate the random consistency from the A. In this paper, we mainly study the necessity, learning consistency and leaning method of the PA. We show that the PA is insensitive to the class distribution of classifier and is more fair to the majority and the minority than A. Subsequently, some novel generalization bounds on the PA and A are given. Furthermore, we show that the PA is Bayes-risk consistent in finite and infinite hypothesis space. We design a plug-in rule that maximizes the PA, and the experiments on twenty benchmark data sets demonstrate that the proposed method performs statistically better than the kernel logistic regression in terms of PA and comparable performance in terms of A. Compared with the other plug-in rules, the proposed method obtains much better performance.<\/jats:p>","DOI":"10.1007\/s10994-020-05914-3","type":"journal-article","created":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T14:02:55Z","timestamp":1603807375000},"page":"2247-2281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Learning with mitigating random consistency from the accuracy measure"],"prefix":"10.1007","volume":"109","author":[{"given":"Jieting","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6772-4247","authenticated-orcid":false,"given":"Yuhua","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Feijiang","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,27]]},"reference":[{"issue":"2","key":"5914_CR1","first-page":"393","volume":"6","author":"S Agarwal","year":"2005","unstructured":"Agarwal, S., Graepel, T., Herbrich, R., Har-Peled, S., & Roth, D. (2005a). Generalization bounds for the area under the ROC curve. Journal of Machine Learning Research, 6(2), 393\u2013425.","journal-title":"Journal of Machine Learning Research"},{"key":"5914_CR2","unstructured":"Agarwal, S., Harpeled, S., & Roth, D. (2005b). A uniform convergence bound for the area under the ROC curve. In Proceedings of the international conference on artificial intelligence and statistics (pp. 1\u20138)."},{"issue":"3","key":"5914_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11634-011-0090-y","volume":"5","author":"AN Albatineh","year":"2011","unstructured":"Albatineh, A. N., & Niewiadomska-Bugaj, M. (2011). Correcting Jaccard and other similarity indices for chance agreement in cluster analysis. Advances in Data Analysis and Classification, 5(3), 179\u2013200.","journal-title":"Advances in Data Analysis and Classification"},{"issue":"2","key":"5914_CR4","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00357-006-0017-z","volume":"23","author":"AN Albatineh","year":"2006","unstructured":"Albatineh, A. N., Niewiadomskabugaj, M., & Mihalko, D. (2006). On similarity indices and correction for chance agreement. Journal of Classification, 23(2), 301\u2013313.","journal-title":"Journal of Classification"},{"issue":"3","key":"5914_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s00500-008-0323-y","volume":"13","author":"J Alcalafdez","year":"2008","unstructured":"Alcalafdez, J., Sanchez, L., Garcia, S., Jesus, M. J. D., Ventura, S., Garrell, J. M., et al. (2008). KEEL: A software tool to assess evolutionary algorithms for data mining problems. Soft Computing, 13(3), 307\u2013318.","journal-title":"Soft Computing"},{"issue":"3","key":"5914_CR6","first-page":"463","volume":"3","author":"PL Bartlett","year":"2003","unstructured":"Bartlett, P. L., & Mendelson, S. (2003). Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3(3), 463\u2013482.","journal-title":"Journal of Machine Learning Research"},{"issue":"473","key":"5914_CR7","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1198\/016214505000000907","volume":"101","author":"PL Bartlett","year":"2006","unstructured":"Bartlett, P. L., Jordan, M. I., & Mcauliffe, J. (2006). Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101(473), 138\u2013156.","journal-title":"Journal of the American Statistical Association"},{"issue":"5","key":"5914_CR8","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1111\/j.1469-8749.1985.tb14133.x","volume":"27","author":"E Blair","year":"2008","unstructured":"Blair, E., & Stanley, F. J. (2008). Interobserver agreement in the classification of cerebral palsy. Developmental Medicine & Child Neurology, 27(5), 615\u2013622.","journal-title":"Developmental Medicine & Child Neurology"},{"issue":"4","key":"5914_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1111\/j.1745-3984.1993.tb00427.x","volume":"30","author":"D Budescu","year":"1993","unstructured":"Budescu, D., & Bar-Hillel, M. (1993). To guess or not to guess: A decision-theoretic view of formula scoring. Journal of Educational Measurement, 30(4), 277\u2013291.","journal-title":"Journal of Educational Measurement"},{"issue":"1","key":"5914_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1177\/03635465030310012601","volume":"31","author":"ML Cameron","year":"2003","unstructured":"Cameron, M. L., Briggs, K. K., & Steadman, J. R. (2003). Reproducibility and reliability of the outerbridge classification for grading chondral lesions of the knee arthroscopically. American Journal of Sports Medicine, 31(1), 83\u201386.","journal-title":"American Journal of Sports Medicine"},{"key":"5914_CR11","volume-title":"An introduction to optimization","author":"EKP Chong","year":"2011","unstructured":"Chong, E. K. P., & \u017bak, S. H. (2011). An introduction to optimization (3rd ed.). New York: Wiley.","edition":"3"},{"issue":"1","key":"5914_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1177\/001316446002000104","volume":"20","author":"J Cohen","year":"1960","unstructured":"Cohen, J. (1960). A coefficient of agreement for nominal scales. Educational and Psychological Measurement, 20(1), 37\u201346.","journal-title":"Educational and Psychological Measurement"},{"key":"5914_CR13","doi-asserted-by":"publisher","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. New York: Springer."},{"issue":"2","key":"5914_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.3102\/00346543043002181","volume":"43","author":"J Diamond","year":"1973","unstructured":"Diamond, J., & Evans, W. (1973). The correction for guessing. Review of Educational Research, 43(2), 181\u2013191.","journal-title":"Review of Educational Research"},{"key":"5914_CR15","unstructured":"Dua, D., & Graff, C. (2017). UCI machine learning repository. Retrieved May 26, 2018, from http:\/\/archive.ics.uci.edu\/ml."},{"key":"5914_CR16","first-page":"973","volume":"17","author":"C Elkan","year":"2001","unstructured":"Elkan, C. (2001). The foundations of cost-sensitive learning. Proceedings of the International Joint Conference on Artificial Intelligence, 17, 973\u2013978.","journal-title":"Proceedings of the International Joint Conference on Artificial Intelligence"},{"issue":"5","key":"5914_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.jmp.2010.06.001","volume":"54","author":"MP Espinosa","year":"2010","unstructured":"Espinosa, M. P., & Gardeazabal, J. (2010). Optimal correction for guessing in multiple-choice tests. Journal of Mathematical psychology, 54(5), 415\u2013425.","journal-title":"Journal of Mathematical psychology"},{"issue":"1","key":"5914_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.patrec.2008.08.010","volume":"30","author":"C Ferri","year":"2009","unstructured":"Ferri, C., Hernandezorallo, J., & Modroiu, R. (2009). An experimental comparison of performance measures for classification. Pattern Recognition Letters, 30(1), 27\u201338.","journal-title":"Pattern Recognition Letters"},{"key":"5914_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.03.003","volume":"236","author":"W Gao","year":"2016","unstructured":"Gao, W., Wang, L., Jin, R., Zhu, S., & Zhou, Z. (2016). One-pass AUC optimization. Artificial Intelligence, 236, 1\u201329.","journal-title":"Artificial Intelligence"},{"issue":"7553","key":"5914_CR20","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1038\/nature14541","volume":"521","author":"Z Ghahramani","year":"2015","unstructured":"Ghahramani, Z. (2015). Probabilistic machine learning and artificial intelligence. Nature, 521(7553), 452\u2013459.","journal-title":"Nature"},{"issue":"268","key":"5914_CR21","first-page":"732","volume":"49","author":"LA Goodman","year":"1963","unstructured":"Goodman, L. A., & Kruskal, W. H. (1963). Measures of association for cross classifications. Publications of the American Statistical Association, 49(268), 732\u2013764.","journal-title":"Publications of the American Statistical Association"},{"key":"5914_CR22","unstructured":"Hazan, T., Keshet, J., & Mcallester, D. A. (2010). Direct loss minimization for structured prediction. In Proceedings of the advances in neural information processing systems (pp. 1594\u20131602)."},{"issue":"9","key":"5914_CR23","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1109\/TKDE.2008.239","volume":"21","author":"H He","year":"2009","unstructured":"He, H., & Garcia, E. (2009). Learning from imbalanced data. IEEE Transactions on Knowledge and Data Engineering, 21(9), 1263\u20131284.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"5914_CR24","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2(1), 193\u2013218.","journal-title":"Journal of Classification"},{"issue":"1","key":"5914_CR25","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1109\/TIT.2004.839514","volume":"51","author":"S Ingo","year":"2005","unstructured":"Ingo, S. (2005). Consistency of support vector machines and other regularized kernel classifiers. IEEE Transactions on Information Theory, 51(1), 128\u2013142.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5914_CR26","doi-asserted-by":"crossref","unstructured":"Joachims, T. (2005). A support vector method for multivariate performance measures. In Proceedings of the International Conference on Machine learning (pp. 377\u2013384).","DOI":"10.1145\/1102351.1102399"},{"issue":"4","key":"5914_CR27","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10994-016-5591-7","volume":"106","author":"W Kotlowski","year":"2017","unstructured":"Kotlowski, W., & Dembczynski, K. (2017). Surrogate regret bounds for generalized classification performance metrics. Machine Learning, 106(4), 549\u2013572.","journal-title":"Machine Learning"},{"key":"5914_CR28","unstructured":"Koyejo, O.O., Natarajan, N., Ravikumar, P.K., & Dhillon, I. S. (2014). Consistent binary classification with generalized performance metrics. In Proceedings of the advances in neural information processing systems (pp. 2744\u20132752)."},{"issue":"3","key":"5914_CR29","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1109\/TKDE.2011.234","volume":"25","author":"LI Kuncheva","year":"2013","unstructured":"Kuncheva, L. I. (2013). A bound on kappa-error diagrams for analysis of classifier ensembles. IEEE Transactions on Knowledge and Data Engineering, 25(3), 494\u2013501.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"5914_CR30","first-page":"58","volume":"378","author":"F Li","year":"2016","unstructured":"Li, F., Qian, Y., Wang, J., & Liang, J. (2016). Multigranulation information fusion: A dempster-shafer evidence theory-based clustering ensemble method. Information Sciences, 378(1), 58\u201363.","journal-title":"Information Sciences"},{"issue":"5","key":"5914_CR31","first-page":"60","volume":"12","author":"F Li","year":"2018","unstructured":"Li, F., Qian, Y., Wang, J., Dang, C., & Liu, B. (2018). Cluster\u2019s quality evaluation and selective clustering ensemble. ACM Transactions on Knowledge Discovery from Data, 12(5), 60.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"5914_CR32","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.artint.2018.12.007","volume":"273","author":"F Li","year":"2019","unstructured":"Li, F., Qian, Y., Wang, J., Dang, C., & Jing, L. (2019). Clustering ensemble based on sample\u2019s stability. Artificial Intelligence, 273, 37\u201355.","journal-title":"Artificial Intelligence"},{"key":"5914_CR33","unstructured":"Margineantu, D. D., & Dietterich, T. G. (1997). Pruning adaptive boosting. In Proceedings of the fourteenth international conference on machine learning (pp. 211\u2013218)."},{"key":"5914_CR34","doi-asserted-by":"crossref","unstructured":"Martinezmunoz, G., & Suarez, A. (2006). Pruning in ordered bagging ensembles. In International conference on machine learning (pp. 609\u2013616).","DOI":"10.1145\/1143844.1143921"},{"key":"5914_CR35","unstructured":"Menon, A. K., Narasimhan, H., Agarwal, S., & Chawla, S. (2013). On the statistical consistency of algorithms for binary classification under class imbalance. In Proceedings of the international conference on machine learning (pp. 603\u2013611)."},{"key":"5914_CR36","unstructured":"Musicant, D. R., Kumar, V., & Ozgur, A. (2003). Optimizing F-measure with support vector machines. In Proceedings of the Florida AI Research Society (pp. 356\u2013360)."},{"key":"5914_CR37","unstructured":"Narasimhan, H., & Agarwal, S. (2013). A new support vector method for optimizing partial AUC based on a tight convex upper bound. In Proceedings of the conference on knowledge discovery and data mining."},{"key":"5914_CR38","unstructured":"Narasimhan, H., Vaish, R., & Agarwal, S. (2014). On the statistical consistency of plug-in classifiers for non-decomposable performance measures. In Advances in neural information processing systems (pp. 1493\u20131501)."},{"key":"5914_CR39","unstructured":"Narasimhan, H., Ramaswamy, H. G., Saha, A., & Agarwal, S. (2015). Consistent multiclass algorithms for complex performance measures. In Proceedings of the international conference on machine learning (pp. 2398\u20132407)."},{"issue":"10","key":"5914_CR40","doi-asserted-by":"publisher","first-page":"2047","DOI":"10.1109\/TNNLS.2015.2451151","volume":"27","author":"Y Qian","year":"2016","unstructured":"Qian, Y., Li, F., Liang, J., Liu, B., & Dang, C. (2016). Space structure and clustering of categorical data. IEEE Transactions on Neural Networks and Learning Systems, 27(10), 2047\u20132059.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"3","key":"5914_CR41","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1111\/j.1745-3984.1968.tb00635.x","volume":"5","author":"DL Sabers","year":"1968","unstructured":"Sabers, D. L., & Feldt, L. S. (1968). An empirical study of the effect of the correction for chance success on the reliability and validity of an aptitude test. Journal of Educational Measurement, 5(3), 251\u2013258.","journal-title":"Journal of Educational Measurement"},{"key":"5914_CR42","doi-asserted-by":"publisher","first-page":"1597","DOI":"10.1007\/s10994-018-5736-y","volume":"107","author":"A Sanyal","year":"2018","unstructured":"Sanyal, A., Kumar, P., Kar, P., Chawla, S., & Sebastiani, F. (2018). Optimizing non-decomposable measures with deep networks. Machine Learning, 107, 1597\u20131620.","journal-title":"Machine Learning"},{"issue":"3","key":"5914_CR43","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1086\/266577","volume":"19","author":"WA Scott","year":"1955","unstructured":"Scott, W. A. (1955). Reliability of content analysis: The case of nominal scale coding. Public Opinion Quarterly, 19(3), 321\u2013325.","journal-title":"Public Opinion Quarterly"},{"key":"5914_CR44","unstructured":"Song, Y., Schwing, A. G., Zemel, R. S., & Urtasun, R. (2016). Training deep neural networks via direct loss minimization. In Proceedings of the International Conference on Machine learning (pp. 2169\u20132177)."},{"issue":"11","key":"5914_CR45","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of ACM, 27(11), 1134\u20131142.","journal-title":"Communications of ACM"},{"issue":"2","key":"5914_CR46","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V Vapnik","year":"1971","unstructured":"Vapnik, V., & Chervonenkis, A. Y. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and Its Applications, 16(2), 264\u2013280.","journal-title":"Theory of Probability and Its Applications"},{"key":"5914_CR47","doi-asserted-by":"crossref","unstructured":"Vieira, S. M., Kaymak, U., & Sousa, J. (2010). Cohen\u2019s kappa coefficient as a performance measure for feature selection. In Proceedings of the international conference on fuzzy systems (pp. 1\u20138).","DOI":"10.1109\/FUZZY.2010.5584447"},{"key":"5914_CR48","doi-asserted-by":"crossref","unstructured":"Vinh, N.X., Epps, J., & Bailey, J. (2009). Information theoretic measures for clusterings comparison: is a correction for chance necessary? In Proceedings of the international conference on machine learning (pp. 1073\u20131080).","DOI":"10.1145\/1553374.1553511"},{"key":"5914_CR49","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh, N. X., Epps, J., & Bailey, J. (2010). Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. Journal of Machine Learning Research, 11, 2837\u20132854.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"5914_CR50","first-page":"3333","volume":"15","author":"W Waegeman","year":"2014","unstructured":"Waegeman, W., Dembczy\u0144ki, K., Jachnik, A., Cheng, W., & H\u00fcllermeier, E. (2014). On the Bayes-optimality of F-measure maximizers. Journal of Machine Learning Research, 15(1), 3333\u20133388.","journal-title":"Journal of Machine Learning Research"},{"key":"5914_CR51","doi-asserted-by":"crossref","unstructured":"Wu, Q., Laet, T.D., & Janssen, R. (2017). Elimination scoring versus correction for guessing: A simulation study. In Proceedings of the meeting of the psychometric society.","DOI":"10.1007\/978-3-319-77249-3_16"},{"issue":"1","key":"5914_CR52","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1214\/aos\/1079120130","volume":"32","author":"T Zhang","year":"2003","unstructured":"Zhang, T. (2003). Statistical behavior and consistency of classification methods based on convex risk minimization. Annals of Statistics, 32(1), 56\u2013134.","journal-title":"Annals of Statistics"},{"issue":"1","key":"5914_CR53","first-page":"1033","volume":"14","author":"M Zhao","year":"2013","unstructured":"Zhao, M., Edakunni, N. U., Pocock, A. C., & Brown, G. (2013). Beyond Fano\u2019s inequality: Bounds on the optimal F-score, BER, and cost-sensitive risk and their implications. Journal of Machine Learning Research, 14(1), 1033\u20131090.","journal-title":"Journal of Machine Learning Research"},{"key":"5914_CR54","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0004-3702(02)00190-X","volume":"137","author":"Z Zhou","year":"2002","unstructured":"Zhou, Z., Wu, J., & Tang, W. (2002). Ensembling neural networks: Many could be better than all. Artificial Intelligence, 137, 239\u2013263.","journal-title":"Artificial Intelligence"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05914-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-020-05914-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05914-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:26:56Z","timestamp":1635290816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-020-05914-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,27]]},"references-count":54,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["5914"],"URL":"https:\/\/doi.org\/10.1007\/s10994-020-05914-3","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2020,10,27]]},"assertion":[{"value":"13 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}