{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T16:23:46Z","timestamp":1787243026054,"version":"build-2736575974"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T00:00:00Z","timestamp":1649808000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T00:00:00Z","timestamp":1649808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["787960"],"award-info":[{"award-number":["787960"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research council KULeuven","award":["C14\/18\/068"],"award-info":[{"award-number":["C14\/18\/068"]}]},{"name":"FWO","award":["GOA4917N"],"award-info":[{"award-number":["GOA4917N"]}]},{"name":"Onderzoeksprogramma Artifici\u00eble Intelligentie (AI) Vlaanderen"},{"name":"Ford KU Leuven Research Alliance Project","award":["KUL0076"],"award-info":[{"award-number":["KUL0076"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10994-022-06165-0","type":"journal-article","created":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T11:03:23Z","timestamp":1649847803000},"page":"2213-2254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Nystr\u00f6m landmark sampling and regularized Christoffel functions"],"prefix":"10.1007","volume":"111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7438-0005","authenticated-orcid":false,"given":"Micha\u00ebl","family":"Fanuel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joachim","family":"Schreurs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johan A. K.","family":"Suykens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,13]]},"reference":[{"key":"6165_CR1","unstructured":"Askari, A., Yang, F., El\u00a0Ghaoui, L. (2018). Kernel-based outlier detection using the inverse Christoffel function. arxiv preprint arxiv:1806.06775"},{"key":"6165_CR2","unstructured":"Bach, F. (2013). Sharp analysis of low-rank kernel matrix approximations. In: Proceedings of the COLT Conference on Learning Theory, pp. 185\u2013209"},{"issue":"2","key":"6165_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1073\/pnas.0810600105","volume":"106","author":"MA Belabbas","year":"2009","unstructured":"Belabbas, M. A., & Wolfe, P. J. (2009). Spectral methods in machine learning and new strategies for very large datasets. Proceedings of the National Academy of Sciences, 106(2), 369\u2013374.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"3","key":"6165_CR4","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1137\/100795772","volume":"43","author":"P Binev","year":"2011","unstructured":"Binev, P., Cohen, A., Dahmen, W., DeVore, R., Petrova, G., & Wojtaszczyk, P. (2011). Convergence rates for greedy algorithms in reduced basis methods. SIAM Journal on Mathematical Analysis, 43(3), 1457\u20131472.","journal-title":"SIAM Journal on Mathematical Analysis"},{"key":"6165_CR5","unstructured":"Calandriello, D., Lazaric, A., & Valko, M. (2017a). Distributed adaptive sampling for kernel matrix approximation. In: Singh A, Zhu XJ (eds) Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017, 20\u201322 April 2017, Fort Lauderdale, FL, USA, PMLR, Proceedings of Machine Learning Research, vol.\u00a054, pp. 1421\u20131429."},{"key":"6165_CR6","unstructured":"Calandriello, D., Lazaric, A., & Valko, M. (2017b). Second-order kernel online convex optimization with adaptive sketching. In: Proceedings of the 34th International Conference on Machine Learning, vol.  70, JMLR.org, pp. 645\u2013653."},{"key":"6165_CR7","unstructured":"Chen, V., Wu, S., Ratner, A. J., Weng, J.,  & R\u00e9, C. (2019). Slice-based learning: A programming model for residual learning in critical data slices. In: Advances in neural information processing systems, pp. 9392\u20139402."},{"key":"6165_CR8","unstructured":"Cohen, M. B., Musco, C., & Pachocki, J. (2015). Online row sampling. In: Proceedings of the 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)."},{"key":"6165_CR9","doi-asserted-by":"crossref","unstructured":"Corless, R. M., Gonnet, G. H., Hare, D. E. G., Jeffrey, D. J., & Knuth, D. E. (1996) On the Lambert W Function. In: Advances in computational mathematics, pp. 329\u2013359.","DOI":"10.1007\/BF02124750"},{"key":"6165_CR10","unstructured":"Cortes C, Mohri M, Talwalkar A (2010) On the impact of kernel approximation on learning accuracy. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pp. 113\u2013120."},{"key":"6165_CR11","unstructured":"Derezinski, M., Calandriello, D., & Valko, M. (2019). Exact sampling of determinantal point processes with sublinear time preprocessing. In: Advances in Neural Information Processing Systems 32 (NeurIPS)."},{"key":"6165_CR12","doi-asserted-by":"crossref","unstructured":"Derezinski, M., Khanna, R., & Mahoney, M. (2020). Improved guarantees and a multiple-descent curve for the column subset selection problem and the nystr\u00f6m method. To appear at NeurIPS 2020 abs\/2002.09073.","DOI":"10.24963\/ijcai.2021\/647"},{"issue":"3","key":"6165_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s00365-013-9186-2","volume":"37","author":"R DeVore","year":"2013","unstructured":"DeVore, R., Petrova, G., & Wojtaszczyk, P. (2013). Greedy algorithms for reduced bases in Banach spaces. Constructive Approximation, 37(3), 455\u2013466.","journal-title":"Constructive Approximation"},{"key":"6165_CR14","first-page":"2153","volume":"6","author":"P Drineas","year":"2005","unstructured":"Drineas, P., & Mahoney, M. W. (2005). On the Nystr\u00f6m method for approximating a gram matrix for improved kernel-based learning. Journal of Machine Learning Research, 6, 2153\u20132175.","journal-title":"Journal of Machine Learning Research"},{"key":"6165_CR15","first-page":"775","volume":"28","author":"A El Alaoui","year":"2015","unstructured":"El Alaoui, A., & Mahoney, M. (2015). Fast randomized kernel ridge regression with statistical guarantees. Advances in Neural Information Processing Systems, 28, 775\u2013783.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"1","key":"6165_CR16","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/20M1320031","volume":"3","author":"M Fanuel","year":"2021","unstructured":"Fanuel, M., Schreurs, J., & Suykens, J. (2021). Diversity sampling is an implicit regularization for kernel methods. SIAM Journal on Mathematics of Data Science, 3(1), 280\u2013297.","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"6165_CR17","unstructured":"Farahat, A., Ghodsi, A., & Kamel, M. (2011). A novel greedy algorithm for Nystr\u00f6m approximation. In: Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research,, vol. 15, pp. 269\u2013277."},{"key":"6165_CR18","doi-asserted-by":"crossref","unstructured":"Feldman, V. (2020). Does learning require memorization? a short tale about a long tail. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 954\u2013959","DOI":"10.1145\/3357713.3384290"},{"issue":"1","key":"6165_CR19","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1137\/18M1184035","volume":"1","author":"T Gao","year":"2019","unstructured":"Gao, T., Kovalsky, S., & Daubechies, I. (2019). Gaussian process landmarking on manifolds. SIAM Journal on Mathematics of Data Science, 1(1), 208\u2013236.","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"6165_CR20","first-page":"6718","volume":"32","author":"M Gartrell","year":"2019","unstructured":"Gartrell, M., Brunel, V. E., Dohmatob, E., & Krichene, S. (2019). Learning nonsymmetric determinantal point processes. Advances in Neural Information Processing Systems, Curran Associates Inc, 32, 6718\u20136728.","journal-title":"Advances in Neural Information Processing Systems, Curran Associates Inc"},{"issue":"5","key":"6165_CR21","doi-asserted-by":"publisher","first-page":"A3636","DOI":"10.1137\/17M1123614","volume":"40","author":"B Gauthier","year":"2018","unstructured":"Gauthier, B., & Suykens, J. (2018). Optimal quadrature-sparsification for integral operator approximation. SIAM Journal on Scientific Computing, 40(5), A3636\u2013A3674.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"3","key":"6165_CR22","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1162\/089976602317250942","volume":"14","author":"M Girolami","year":"2002","unstructured":"Girolami, M. (2002). Orthogonal series density estimation and the kernel eigenvalue problem. Neural Computing, 14(3), 669\u2013688.","journal-title":"Neural Computing"},{"key":"6165_CR23","unstructured":"Gittens, A., & Mahoney, M. W. (2016). Revisiting the Nystr\u00f6m method for improved large-scale machine learning. Journal of Machine Learning Research,17, 117:1\u201311765."},{"key":"6165_CR24","unstructured":"Gong, B., Chao, W. L., Grauman, K., Sha, F. (2014). Diverse sequential subset selection for supervised video summarization. In: Advances in Neural Information Processing Systems, pp. 2069\u20132077."},{"key":"6165_CR25","unstructured":"Guyon, I., Matic, N., & Vapnik, V. (1996), Advances in knowledge discovery and data mining. Chap Discovering Informative Patterns and Data Cleaning, pp. 181\u2013203."},{"key":"6165_CR26","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1214\/154957806000000078","volume":"3","author":"JB Hough","year":"2006","unstructured":"Hough, J. B., Krishnapur, M., Peres, Y., & Vir\u00e1g, B. (2006). Determinantal processes and independence. Probability Surveys, 3, 206\u2013229.","journal-title":"Probability Surveys"},{"key":"6165_CR27","unstructured":"Kulesza, A., & Taskar, B. (2010), Structured determinantal point processes. In: Advances in neural information processing systems, pp. 1171\u20131179,"},{"key":"6165_CR28","unstructured":"Kulesza, A., & Taskar, B. (2011), k-dpps: Fixed-size determinantal point processes. In: Proceedings of the 28th International Conference on Machine Learning (ICML-11), pp. 1193\u20131200."},{"issue":"2\u20133","key":"6165_CR29","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1561\/2200000044","volume":"5","author":"A Kulesza","year":"2012","unstructured":"Kulesza, A., & Taskar, B. (2012a). Determinantal point processes for machine learning. Foundations and Trends in Machine Learning, 5(2\u20133), 123\u2013286.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"6165_CR30","doi-asserted-by":"crossref","unstructured":"Kulesza, A., & Taskar, B. (2012b) Learning determinantal point processes. arxiv preprintarxiv:1202.3738.","DOI":"10.1561\/9781601986290"},{"key":"6165_CR31","unstructured":"Lasserre, J., & Pauwels, E. (2017), The empirical Christoffel function with applications in Machine Learning, Arxiv preprintarXiv:1701.02886."},{"issue":"4","key":"6165_CR32","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1017\/jpr.2020.56","volume":"57","author":"C Launay","year":"2020","unstructured":"Launay, C., Galerne, B., & Desolneux, A. (2020). Exact sampling of determinantal point processes without eigendecomposition. Journal of Applied Probability, 57(4), 1198\u20131221.","journal-title":"Journal of Applied Probability"},{"key":"6165_CR33","unstructured":"Liang, D., & Paisley, J. (2015), Landmarking manifolds with gaussian processes. In: Proceedings of the 32nd International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a037, pp. 466\u2013474."},{"key":"6165_CR34","unstructured":"Li, C., Jegelka, S,, & Sra, S. (2016a) Efficient sampling for k-determinantal point processes. In: AISTAT."},{"key":"6165_CR35","unstructured":"Li, C., Jegelka, S,, & Sra, S. (2016b). Fast Dpp. sampling for Nystr\u00f6m with application to kernel methods. In: Proceedings of the 33rd International Conference on International Conference on Machine Learning\u2014Volume 48, ICML\u201916, pp. 2061\u20132070."},{"key":"6165_CR36","first-page":"2468","volume":"31","author":"S McCurdy","year":"2018","unstructured":"McCurdy, S. (2018). Ridge regression and provable deterministic ridge leverage score sampling. Advances in Neural Information Processing Systems, 31, 2468\u20132477.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6165_CR37","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.spl.2017.03.020","volume":"127","author":"S Minsker","year":"2017","unstructured":"Minsker, S. (2017). On some extensions of bernstein\u2019s inequality for self-adjoint operators. Statistics & Probability Letters, 127, 111\u2013119.","journal-title":"Statistics & Probability Letters"},{"key":"6165_CR38","first-page":"3833","volume":"30","author":"C Musco","year":"2017","unstructured":"Musco, C., & Musco, C. (2017). Recursive sampling for the Nystr\u00f6m method. Advances in Neural Information Processing Systems, 30, 3833\u20133845.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6165_CR39","doi-asserted-by":"crossref","unstructured":"Oakden-Rayner, L., Dunnmon, J., Carneiro, G., & R\u00e9, C. (2020), Hidden stratification causes clinically meaningful failures in machine learning for medical imaging. In: Proceedings of the ACM conference on health, inference, and learning, pp. 151\u2013159,","DOI":"10.1145\/3368555.3384468"},{"issue":"5","key":"6165_CR40","doi-asserted-by":"publisher","first-page":"2686","DOI":"10.1109\/TSP.2010.2042491","volume":"58","author":"J Paisley","year":"2010","unstructured":"Paisley, J., Liao, X., & Carin, L. (2010). Active learning and basis selection for kernel-based linear models: A bayesian perspective. IEEE Transactions on Signal Processing, 58(5), 2686\u20132700.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"6165_CR41","doi-asserted-by":"crossref","unstructured":"Papailiopoulos, D., Kyrillidis, A., &  Boutsidis, C. (2014). Provable deterministic leverage score sampling. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, New York, NY, USA, KDD \u201914, pp. 997\u20131006.","DOI":"10.1145\/2623330.2623698"},{"key":"6165_CR42","first-page":"1663","volume":"32","author":"E Pauwels","year":"2018","unstructured":"Pauwels, E., Bach, F., & Vert, J. (2018). Relating leverage scores and density using regularized Christoffel functions. In: Advances in Neural Information Processing Systems, 32, 1663\u20131672.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6165_CR43","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0024-3795(79)90046-6","volume":"27","author":"A Pinkus","year":"1979","unstructured":"Pinkus, A. (1979). Matrices and $$n$$-widths. Linear Algebra and Applications, 27, 245\u2013278.","journal-title":"Linear Algebra and Applications"},{"issue":"2166","key":"6165_CR44","doi-asserted-by":"publisher","first-page":"20190059","DOI":"10.1098\/rsta.2019.0059","volume":"378","author":"J Poulson","year":"2020","unstructured":"Poulson, J. (2020). High-performance sampling of generic determinantal point processes. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 378(2166), 20190059.","journal-title":"Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences"},{"key":"6165_CR45","unstructured":"Rahimi, A., & Recht, B. (2007). Random features for large-scale kernel machines. In: Proceedings of the 20th International Conference on Neural Information Processing Systems, pp. 1177\u20131184."},{"key":"6165_CR46","volume-title":"Gaussian Processes for Machine Learning","author":"C Rasmussen","year":"2006","unstructured":"Rasmussen, C., & Williams, C. (2006). Gaussian Processes for Machine Learning. Cambridge: The MIT Press."},{"key":"6165_CR47","first-page":"5677","volume":"31","author":"A Rudi","year":"2018","unstructured":"Rudi, A., Calandriello, D., Carratino, L., & Rosasco, L. (2018). On fast leverage score sampling and optimal learning. Advances in Neural Information Processing Systems, 31, 5677\u20135687.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6165_CR48","first-page":"3888","volume":"30","author":"A Rudi","year":"2017","unstructured":"Rudi, A., Carratino, L., & Rosasco, L. (2017). Falkon: An optimal large scale kernel method. Advances in Neural Information Processing Systems, 30, 3888\u20133898.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6165_CR49","doi-asserted-by":"publisher","first-page":"23","DOI":"10.3389\/fams.2017.00023","volume":"3","author":"A Rudi","year":"2017","unstructured":"Rudi, A., De Vito, E., Verri, A., & Odone, F. (2017). Regularized kernel algorithms for support estimation. Frontiers in Applied Mathematics and Statistics, 3, 23.","journal-title":"Frontiers in Applied Mathematics and Statistics"},{"key":"6165_CR50","first-page":"68","volume":"10","author":"G Santin","year":"2017","unstructured":"Santin, G., & Haasdonk, B. (2017). Convergence rate of the data-independent p-greedy algorithm in kernel-based approximation. Journal Dolomites Research Notes on Approximation, 10, 68\u201378.","journal-title":"Journal Dolomites Research Notes on Approximation"},{"key":"6165_CR51","unstructured":"Schreurs, J., Fanuel, M., & Suykens, J. (2020). Ensemble kernel methods, implicit regularization and determinantal point processes. ICML 2020 workshop on Negative Dependence and Submodularity, PMLR 119."},{"key":"6165_CR52","doi-asserted-by":"publisher","DOI":"10.1142\/5089","volume-title":"Least Squares Support Vector Machines","author":"JAK Suykens","year":"2002","unstructured":"Suykens, J. A. K., Gestel, T. V., Brabanter, J. D., Moor, B. D., & Vandewalle, J. (2002). Least Squares Support Vector Machines. Singapore: World Scientific."},{"issue":"168","key":"6165_CR53","first-page":"1","volume":"20","author":"N Tremblay","year":"2019","unstructured":"Tremblay, N., Barthelm\u00e9, S., & Amblard, P. (2019). Determinantal point processes for coresets. Journal of Machine Learning Research, 20(168), 1\u201370.","journal-title":"Journal of Machine Learning Research"},{"key":"6165_CR54","unstructured":"Tropp, J. (2019), Matrix concentration & computational linear algebra. Teaching Resource (Unpublished)."},{"key":"6165_CR55","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1214\/ECP.v16-1624","volume":"16","author":"J Tropp","year":"2011","unstructured":"Tropp, J. (2011). Freedman\u2019s inequality for matrix martingales. Electronic Communications in Probability, 16, 262\u2013270.","journal-title":"Electronic Communications in Probability"},{"issue":"1","key":"6165_CR56","doi-asserted-by":"publisher","first-page":"e84217","DOI":"10.1371\/journal.pone.0084217","volume":"9","author":"FJ Valverde-Albacete","year":"2014","unstructured":"Valverde-Albacete, F. J., & Pel\u00e1ez-Moreno, C. (2014). 100% classification accuracy considered harmful: The normalized information transfer factor explains the accuracy paradox. PLoS ONE, 9(1), e84217.","journal-title":"PLoS ONE"},{"key":"6165_CR57","first-page":"682","volume":"13","author":"C Williams","year":"2001","unstructured":"Williams, C., & Seeger, M. (2001). Using the Nystr\u00f6m method to speed up kernel machines. Advances in Neural Information Processing Systems, 13, 682\u2013688.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"9","key":"6165_CR58","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1162\/0899766054323008","volume":"17","author":"T Zhang","year":"2005","unstructured":"Zhang, T. (2005). Learning bounds for kernel regression using effective data dimensionality. Neural Computation, 17(9), 2077\u20132098.","journal-title":"Neural Computation"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06165-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06165-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06165-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:05:07Z","timestamp":1681329907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06165-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,13]]},"references-count":58,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["6165"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06165-0","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,13]]},"assertion":[{"value":"7 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not Applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not Applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"A demo code is available at\n                      \n                      . This software is made available for non commercial research purposes only under the GNU General Public License.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}