{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:31:48Z","timestamp":1740123108941,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:00:00Z","timestamp":1467072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:00:00Z","timestamp":1467072000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Internal Affairs and Communications, Japan","award":["Novel and innovative R&D making use of brain structures"],"award-info":[{"award-number":["Novel and innovative R&D making use of brain structures"]}]},{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology, Japan","doi-asserted-by":"crossref","award":["Strategic research program for brain sciences"],"award-info":[{"award-number":["Strategic research program for brain sciences"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["24300114","25730155"],"award-info":[{"award-number":["24300114","25730155"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10994-016-5568-6","type":"journal-article","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T12:27:11Z","timestamp":1467203231000},"page":"335-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sparse and low-rank matrix regularization for learning time-varying Markov networks"],"prefix":"10.1007","volume":"105","author":[{"given":"Jun-ichiro","family":"Hirayama","sequence":"first","affiliation":[]},{"given":"Aapo","family":"Hyv\u00e4rinen","sequence":"additional","affiliation":[]},{"given":"Shin","family":"Ishii","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"issue":"29","key":"5568_CR1","doi-asserted-by":"publisher","first-page":"11878","DOI":"10.1073\/pnas.0901910106","volume":"106","author":"A Ahmed","year":"2009","unstructured":"Ahmed, A., & Xing, E. P. (2009). Recovering time-varying networks of dependencies in social and biological studies. Proceedings of the National Academy of Sciences of the United States of America, 106(29), 11878\u201311883.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"5568_CR2","unstructured":"Bachmann, P., & Precup, D. (2012). Improved estimation in time varying models. In Proceedings of the 29th international conference on machine learning (ICML\u201912), pp. 1735\u20131742."},{"key":"5568_CR3","first-page":"485","volume":"9","author":"O Banerjee","year":"2008","unstructured":"Banerjee, O., Ghaoui, L. E., & d\u2019Aspremont, A. (2008). Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data. Journal of Machine Learning Research, 9, 485\u2013516.","journal-title":"Journal of Machine Learning Research"},{"key":"5568_CR4","volume-title":"Parallel and distributed computation: Numerical methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D. P., & Tsitsiklis, J. N. (1989). Parallel and distributed computation: Numerical methods. Englewood Cliffs, NJ: Prentice-Hall."},{"issue":"3","key":"5568_CR5","first-page":"179","volume":"24","author":"J Besag","year":"1975","unstructured":"Besag, J. (1975). Statistical analysis of non-lattice data. Journal of the Royal Statistical Society: Series D, 24(3), 179\u2013195.","journal-title":"Journal of the Royal Statistical Society: Series D"},{"key":"5568_CR6","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1093\/biomet\/64.3.616","volume":"64","author":"J Besag","year":"1977","unstructured":"Besag, J. (1977). Efficiency of pseudo-likelihood estimation for simple Gaussian fields. Biometrika, 64, 616\u2013618.","journal-title":"Biometrika"},{"issue":"11","key":"5568_CR7","first-page":"1","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(11), 1\u2013122.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"5568_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge, MA: Cambridge University Press."},{"issue":"4","key":"5568_CR9","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J. F., Cand\u00e8s, E. J., & Shen, Z. (2010). A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4), 1956\u20131982.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"5568_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1214\/07-BA204","volume":"2","author":"CM Carvalho","year":"2007","unstructured":"Carvalho, C. M., & West, M. (2007). Dynamic matrix-variate graphical models. Bayesian Analysis, 2(1), 69\u201397.","journal-title":"Bayesian Analysis"},{"key":"5568_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998). Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 20, 33\u201361.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"11","key":"5568_CR12","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., & Mol, C. D. (2004). An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Communications on Pure and Applied Mathematics, 57(11), 1413\u20131457.","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"4","key":"5568_CR13","doi-asserted-by":"publisher","first-page":"2502","DOI":"10.1137\/100814251","volume":"23","author":"XV Doan","year":"2013","unstructured":"Doan, X. V., & Vavasis, S. (2013). Finding approximately rank-one submatrices with the nuclear norm and $$\\ell _1$$-norm. SIAM Journal on Optimization, 23(4), 2502\u20132540.","journal-title":"SIAM Journal on Optimization"},{"key":"5568_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"5","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., & Bertsekas, D. (1992). On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Mathematical Programming, 5, 293\u2013318.","journal-title":"Mathematical Programming"},{"key":"5568_CR15","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., & Boyd, S. (2004). Rank minimization and applications in system theory. In Proceedings of the American control conference, pp. 3273\u20133278.","DOI":"10.23919\/ACC.2004.1384521"},{"issue":"12","key":"5568_CR16","doi-asserted-by":"publisher","first-page":"3133","DOI":"10.1109\/TIP.2010.2053941","volume":"19","author":"M Figueiredo","year":"2010","unstructured":"Figueiredo, M., & Bioucas-Dias, J. (2010). Restoration of Poissonian images using alternating direction optimization. IEEE Transactions on Image Processing, 19(12), 3133\u20133145.","journal-title":"IEEE Transactions on Image Processing"},{"issue":"5814","key":"5568_CR17","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey, B. J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315(5814), 972\u2013976.","journal-title":"Science"},{"issue":"3","key":"5568_CR18","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1093\/biostatistics\/kxm045","volume":"9","author":"J Friedman","year":"2008","unstructured":"Friedman, J., Hastie, T., & Tibshirani, R. (2008). Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9(3), 432\u2013441.","journal-title":"Biostatistics"},{"issue":"3","key":"5568_CR19","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10618600.1998.10474784","volume":"7","author":"WJ Fu","year":"1998","unstructured":"Fu, W. J. (1998). Penalized regressions: The Bridge versus the Lasso. Journal of Computational and Graphical Statistics, 7(3), 397\u2013416.","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"5568_CR20","unstructured":"Guo, J., Levina, E., Michailidis, G., & Zhu, J. (2010). Joint structure estimation of categorical Markov networks. http:\/\/www-personal.umich.edu\/~guojian\/publications\/ising.pdf ."},{"issue":"2","key":"5568_CR21","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., & Yuan, X. (2012). On the $$O(1\/n)$$ convergence rate of the Douglas-Rachford alternating direction method. SIAM Journal on Numerical Analysis, 50(2), 700\u2013709.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"5568_CR22","doi-asserted-by":"crossref","unstructured":"Hirayama, J., Hyv\u00e4rinen, A., & Ishii, S. (2010). Sparse and low-rank estimation of time-varying Markov networks with alternating direction method of multipliers. In International conference on neural information processing (ICONIP\u201910), Lecture notes in computer science (Vol. 6443, pp. 371\u2013379).","DOI":"10.1007\/978-3-642-17537-4_46"},{"key":"5568_CR23","first-page":"883","volume":"10","author":"H H\u00f6fling","year":"2009","unstructured":"H\u00f6fling, H., & Tibshirani, R. (2009). Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods. Journal of Machine Learning Research, 10, 883\u2013906.","journal-title":"Journal of Machine Learning Research"},{"key":"5568_CR24","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.neuroimage.2013.05.079","volume":"80","author":"RM Hutchison","year":"2013","unstructured":"Hutchison, R. M., et al. (2013). Dynamic functional connectivity: Promise, issues, and interpretations. NeuroImage, 80, 360\u2013378.","journal-title":"NeuroImage"},{"issue":"7","key":"5568_CR25","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1162\/089976699300016214","volume":"11","author":"A Hyv\u00e4rinen","year":"1999","unstructured":"Hyv\u00e4rinen, A. (1999). Sparse code shrinkage: Denoising of nongaussian data by maximum likelihood estimation. Neural Computation, 11(7), 1739\u20131768.","journal-title":"Neural Computation"},{"issue":"10","key":"5568_CR26","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1162\/neco.2006.18.10.2283","volume":"18","author":"A Hyv\u00e4rinen","year":"2006","unstructured":"Hyv\u00e4rinen, A. (2006). Consistency of pseudolikelihood estimation of fully visible Boltzmann machines. Neural Computation, 18(10), 2283\u20132292.","journal-title":"Neural Computation"},{"key":"5568_CR27","unstructured":"Jenatton, R., Mairal, J., Obozinski, G., & Bach, F. (2010). Proximal methods for sparse hierarchical dictionary learning. In Proceedings of the 27th international conference on machine learning (ICML\u201910), pp. 487\u2013494."},{"issue":"1","key":"5568_CR28","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1214\/09-AOAS308","volume":"4","author":"M Kolar","year":"2010","unstructured":"Kolar, M., Song, L., Ahmed, A., & Xing, E. P. (2010). Estimating time-varying networks. Annals of Applied Statistics, 4(1), 94\u2013123.","journal-title":"Annals of Applied Statistics"},{"key":"5568_CR29","unstructured":"Kolar, M., Song, L., & Xing, E. P. (2009). Sparsistent learning of varying-coefficient models with structural changes. In Advances in neural information processing systems 22 (NIPS\u201909), pp. 1006\u20131014."},{"key":"5568_CR30","volume-title":"Probabilistic graphical models: Principles and techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., & Friedman, N. (2009). Probabilistic graphical models: Principles and techniques. Cambridge, MA: The MIT Press."},{"key":"5568_CR31","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"SL Lauritzen","year":"1996","unstructured":"Lauritzen, S. L. (1996). Graphical models. Oxford: Clarendon Press."},{"key":"5568_CR32","doi-asserted-by":"crossref","unstructured":"Lee, S. I., Ganapathi, V., & Koller, D. (2007). Efficient structure learning of Markov networks using L1-regularization. In Advances in neural information processing systems 19 (NIPS\u201906), pp. 817\u2013824.","DOI":"10.7551\/mitpress\/7503.003.0107"},{"key":"5568_CR33","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.neuroimage.2013.07.019","volume":"83","author":"N Leonardi","year":"2013","unstructured":"Leonardi, N., et al. (2013). Principal components of functional connectivity: A new approach to study dynamic brain connectivity during rest. NeuroImage, 83, 937\u2013950.","journal-title":"NeuroImage"},{"key":"5568_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/b98858","volume-title":"Local regression and likelihood","author":"C Loader","year":"1999","unstructured":"Loader, C. (1999). Local regression and likelihood. Berlin: Springer."},{"key":"5568_CR35","unstructured":"Mei, S., Cao, B., & Sun, J. (2012). Encoding low-rank and sparse structures simultaneously in multi-task learning. Microsoft Technical Report, MSR-TR-2012-124. http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=179139 ."},{"key":"5568_CR36","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier, L., van de Geer, S., & B\u00fchlmann, P. (2008). The group lasso for logistic regression. Journal of the Royal Statistical Society: Series B, 70, 53\u201371.","journal-title":"Journal of the Royal Statistical Society: Series B"},{"key":"5568_CR37","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1214\/009053606000000281","volume":"34","author":"N Meinshausen","year":"2006","unstructured":"Meinshausen, N., B\u00fchlmann, P., & Z\u00fcrich, E. (2006). High dimensional graphs and variable selection with the Lasso. Annals of Statistics, 34, 1436\u20131462.","journal-title":"Annals of Statistics"},{"issue":"23","key":"5568_CR38","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman, M. E. J. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences of the United States of America, 103(23), 8577\u20138582.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"5568_CR39","volume-title":"Numerical optimization. Springer series in operations research","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., & Wright, S. J. (1999). Numerical optimization. Springer series in operations research. Berlin: Springer."},{"key":"5568_CR40","volume-title":"Probabilistic reasoning in intelligent systems: Networks of plausible inference","author":"J Pearl","year":"1988","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. Los Altos, CA: Morgan Kaufmann."},{"key":"5568_CR41","doi-asserted-by":"crossref","unstructured":"Ravikumar, P., Wainwright, M. J., & Lafferty, J. D. (2010). High-dimensional Ising model selection using $$\\ell _1$$-regularized logistic regression. The Annals of Statistics, 38(3), 1287\u20131319.","DOI":"10.1214\/09-AOS691"},{"key":"5568_CR42","unstructured":"Richard, E., Savalle, P. A., & Vayatis, N. (2012). Estimation of simultaneously sparse and low rank matrices. In Proceedings of the 29th international conference on machine learning (ICML\u201912), pp. 1351\u20131358."},{"key":"5568_CR43","doi-asserted-by":"crossref","unstructured":"Rocha, G., Zhao, P., & Yu, B. (2008). A path following algorithm for sparse pseudo-likelihood inverse covariance estimation (SPLICE). Technical report 759, Statistics Department, UC Berkeley.","DOI":"10.21236\/ADA487557"},{"key":"5568_CR44","unstructured":"Schmidt, M. (2005). minFunc: Unconstrained differentiable multivariate optimization in Matlab. http:\/\/www.cs.ubc.ca\/~schmidtm\/Software\/minFunc.html ."},{"key":"5568_CR45","unstructured":"Schmidt, M., & Murphy, K. (2010). Convex structure learning in log-linear models: Beyond pairwise potentials. In Proceedings of the 13th international conference on artificial intelligence and statistics (AISTATS\u201910) (Vol.\u00a09, pp. 709\u2013716)."},{"issue":"3","key":"5568_CR46","doi-asserted-by":"publisher","first-page":"e1002385","DOI":"10.1371\/journal.pcbi.1002385","volume":"8","author":"H Shimazaki","year":"2012","unstructured":"Shimazaki, H., Amari, S., Brown, E. N., & Gr\u00fcn, S. (2012). State-space analysis of time-varying higher-order spike correlation for multiple neural spike train data. PLOS Computational Biology, 8(3), e1002385.","journal-title":"PLOS Computational Biology"},{"issue":"12","key":"5568_CR47","doi-asserted-by":"publisher","first-page":"i128","DOI":"10.1093\/bioinformatics\/btp192","volume":"25","author":"L Song","year":"2009","unstructured":"Song, L., Kolar, M., & Xing, E. P. (2009). KELLER: Estimating time-varying interactions between genes. Bioinformatics, 25(12), i128\u2013i136.","journal-title":"Bioinformatics"},{"key":"5568_CR48","unstructured":"Srebro, N., Rennie, J., & Jaakkola, T. (2005). Maximum margin matrix factorization. In Advances in neural information processing systems 17 (NIPS\u201914), pp. 1329\u20131336."},{"issue":"1","key":"5568_CR49","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267\u2013288.","journal-title":"Journal of the Royal Statistical Society: Series B"},{"key":"5568_CR50","first-page":"615","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh, K. C., & Yun, S. W. (2010). An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pacific Journal of Optimization, 6, 615\u2013640.","journal-title":"Pacific Journal of Optimization"},{"issue":"12","key":"5568_CR51","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1109\/LSP.2009.2030111","volume":"16","author":"R Tomioka","year":"2009","unstructured":"Tomioka, R., & Sugiyama, M. (2009). Dual augmented Lagrangian method for efficient sparse reconstruction. IEEE Signal Proccesing Letters, 16(12), 1067\u20131070.","journal-title":"IEEE Signal Proccesing Letters"},{"key":"5568_CR52","unstructured":"Tomioka, R., Suzuki, T., Sugiyama, M., & Kashima, H. (2010). A fast augmented Lagrangian algorithm for learning low-rank matrices. In Proceedings of the 27th annual international conference on machine learning (ICML\u201910), pp. 1087\u20131094."},{"key":"5568_CR53","doi-asserted-by":"crossref","unstructured":"Yoshida, R., Imoto, S., & Higuchi, T. (2005). Estimating time-dependent gene networks from time series microarray data by dynamic linear models with Markov switching. In Proceedings of IEEE computational systems bioinformatics conference, pp. 289\u2013298.","DOI":"10.1109\/CSB.2005.32"},{"issue":"2","key":"5568_CR54","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10915-011-9507-1","volume":"51","author":"X Yuan","year":"2012","unstructured":"Yuan, X. (2012). Alternating direction method for covariance selection models. Journal of Scientific Computing, 51(2), 261\u2013273.","journal-title":"Journal of Scientific Computing"},{"key":"5568_CR55","doi-asserted-by":"crossref","unstructured":"Yuan, M., & Lin, Y. (2006). Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B, 68(1), 49\u201367.","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"issue":"6A","key":"5568_CR56","doi-asserted-by":"publisher","first-page":"3468","DOI":"10.1214\/07-AOS584","volume":"37","author":"P Zhao","year":"2009","unstructured":"Zhao, P., Rocha, G., & Yu, B. (2009). The composite absolute penalties family for grouped and hierarchical variable selection. Annals of Statistics, 37(6A), 3468\u20133497.","journal-title":"Annals of Statistics"},{"issue":"2\u20133","key":"5568_CR57","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10994-010-5180-0","volume":"80","author":"S Zhou","year":"2010","unstructured":"Zhou, S., Lafferty, J., & Wasserman, L. (2010). Time varying undirected graphs. Machine Learning, 80(2\u20133), 295\u2013319.","journal-title":"Machine Learning"},{"key":"5568_CR58","unstructured":"Zhou, K., Zha, H., & Song, L. (2013). Learning social infectivity in sparse low-rank networks using multi-dimensional Hawkes processes. In Proceedings of the 16th international conference on artificial intelligence and statistics (AISTATS\u201913), pp. 641\u2013649."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5568-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-016-5568-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5568-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T00:23:04Z","timestamp":1718670184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-016-5568-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["5568"],"URL":"https:\/\/doi.org\/10.1007\/s10994-016-5568-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2016,6,28]]},"assertion":[{"value":"13 July 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}