{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T16:26:37Z","timestamp":1783441597964,"version":"3.54.6"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:00:00Z","timestamp":1622851200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T00:00:00Z","timestamp":1622851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1916425"],"award-info":[{"award-number":["1916425"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1734853"],"award-info":[{"award-number":["1734853"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1636840"],"award-info":[{"award-number":["1636840"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1416953"],"award-info":[{"award-number":["1416953"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0716055"],"award-info":[{"award-number":["0716055"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1023115"],"award-info":[{"award-number":["1023115"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["P20 NR015331"],"award-info":[{"award-number":["P20 NR015331"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["U54 EB020406"],"award-info":[{"award-number":["U54 EB020406"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["P50 NS091856"],"award-info":[{"award-number":["P50 NS091856"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["P30 DK089503"],"award-info":[{"award-number":["P30 DK089503"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["UL1TR002240"],"award-info":[{"award-number":["UL1TR002240"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01CA233487"],"award-info":[{"award-number":["R01CA233487"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["R01MH121079"],"award-info":[{"award-number":["R01MH121079"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["K23 ES027221"],"award-info":[{"award-number":["K23 ES027221"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-15-1-0479"],"award-info":[{"award-number":["W911NF-15-1-0479"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Data-driven innovation is propelled by recent scientific advances, rapid technological progress, substantial reductions of manufacturing costs, and significant demands for effective decision support systems. This has led to efforts to collect massive amounts of heterogeneous and multisource data, however, not all data is of equal quality or equally informative. Previous methods to capture and quantify the utility of data include value of information (VoI), quality of information (QoI), and mutual information (MI). This manuscript introduces a new measure to quantify whether larger volumes of increasingly more complex data enhance, degrade, or alter their information content and utility with respect to specific tasks. We present a new information-theoretic measure, called Data Value Metric (DVM), that quantifies the useful information content (energy) of large and heterogeneous datasets. The DVM formulation is based on a regularized model balancing data analytical value (utility) and model complexity. DVM can be used to determine if appending, expanding, or augmenting a dataset may be beneficial in specific application domains. Subject to the choices of data analytic, inferential, or forecasting techniques employed to interrogate the data, DVM quantifies the information boost, or degradation, associated with increasing the data size or expanding the richness of its features. DVM is defined as a mixture of a fidelity and a regularization terms. The fidelity captures the usefulness of the sample data specifically in the context of the inferential task. The regularization term represents the computational complexity of the corresponding inferential method. Inspired by the concept of information bottleneck in deep learning, the fidelity term depends on the performance of the corresponding supervised or unsupervised model. We tested the DVM method for several alternative supervised and unsupervised regression, classification, clustering, and dimensionality reduction tasks. Both real and simulated datasets with weak and strong signal information are used in the experimental validation. Our findings suggest that DVM captures effectively the balance between analytical-value and algorithmic-complexity. Changes in the DVM expose the tradeoffs between algorithmic complexity and data analytical value in terms of the sample-size and the feature-richness of a dataset. DVM values may be used to determine the size and characteristics of the data to optimize the relative utility of various supervised or unsupervised algorithms.<\/jats:p>","DOI":"10.1186\/s40537-021-00446-6","type":"journal-article","created":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T17:02:45Z","timestamp":1622912565000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A data value metric for quantifying information content and utility"],"prefix":"10.1186","volume":"8","author":[{"given":"Morteza","family":"Noshad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jerome","family":"Choi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuming","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"suffix":"III","given":"Alfred","family":"Hero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3825-4375","authenticated-orcid":false,"given":"Ivo D.","family":"Dinov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,5]]},"reference":[{"key":"446_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72347-1","volume-title":"Data science and predictive analytics biomedical and health applications using R","author":"ID Dinov","year":"2018","unstructured":"Dinov ID. Data science and predictive analytics biomedical and health applications using R. Berlin: Springer; 2018."},{"key":"446_CR2","unstructured":"Raiffa H, Schlaifer R. Applied statistical decision theory 1961."},{"issue":"1","key":"446_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1146\/annurev-statistics-031017-100404","volume":"5","author":"G Baio","year":"2018","unstructured":"Baio G. Statistical modeling for health economic evaluations. Ann Revi Statist Appl. 2018;5(1):289\u2013309. https:\/\/doi.org\/10.1146\/annurev-statistics-031017-100404.","journal-title":"Ann Revi Statist Appl"},{"key":"446_CR4","volume-title":"When simple becomes complicated: why Excel should lose its place at the top table","author":"G Baio","year":"2017","unstructured":"Baio G, Heath A. When simple becomes complicated: why Excel should lose its place at the top table. London: SAGE Publications Sage UK; 2017."},{"key":"446_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/9780470746684","volume-title":"Decision Theory: Principles and Approaches","author":"G Parmigiani","year":"2009","unstructured":"Parmigiani G, Inoue L. Decision Theory: Principles and Approaches, vol. 812. Hoboken: Wiley; 2009."},{"issue":"528","key":"446_CR6","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1080\/01621459.2018.1562932","volume":"114","author":"C Jackson","year":"2019","unstructured":"Jackson C, Presanis A, Conti S, Angelis DD. Value of information: sensitivity analysis and research design in bayesian evidence synthesis. J Am Statist Associat. 2019;114(528):1436\u201349. https:\/\/doi.org\/10.1080\/01621459.2018.1562932.","journal-title":"J Am Statist Associat"},{"issue":"3","key":"446_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1177\/0272989X13514774","volume":"34","author":"J Madan","year":"2014","unstructured":"Madan J, Ades AE, Price M, Maitland K, Jemutai J, Revill P, Welton NJ. Strategies for efficient computation of the expected value of partial perfect information. Med Decis Making. 2014;34(3):327\u201342.","journal-title":"Med Decis Making"},{"issue":"6","key":"446_CR8","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1177\/0272989X12465123","volume":"33","author":"M Strong","year":"2013","unstructured":"Strong M, Oakley JE. An efficient method for computing single-parameter partial expected value of perfect information. Med Decis Making. 2013;33(6):755\u201366.","journal-title":"Med Decis Making"},{"issue":"2","key":"446_CR9","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.jval.2012.10.018","volume":"16","author":"M Sadatsafavi","year":"2013","unstructured":"Sadatsafavi M, Bansback N, Zafari Z, Najafzadeh M, Marra C. Need for speed: an efficient algorithm for calculation of single-parameter expected value of partial perfect information. Value Health. 2013;16(2):438\u201348.","journal-title":"Value Health"},{"issue":"3","key":"446_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1177\/0272989X13505910","volume":"34","author":"M Strong","year":"2014","unstructured":"Strong M, Oakley JE, Brennan A. Estimating multiparameter partial expected value of perfect information from a probabilistic sensitivity analysis sample: a nonparametric regression approach. Med Decis Making. 2014;34(3):311\u201326.","journal-title":"Med Decis Making"},{"issue":"5","key":"446_CR11","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1177\/0272989X15575286","volume":"35","author":"M Strong","year":"2015","unstructured":"Strong M, Oakley JE, Brennan A, Breeze P. Estimating the expected value of sample information using the probabilistic sensitivity analysis sample: a fast, nonparametric regression-based method. Med Decis Making. 2015;35(5):570\u201383.","journal-title":"Med Decis Making"},{"issue":"23","key":"446_CR12","doi-asserted-by":"publisher","first-page":"4264","DOI":"10.1002\/sim.6983","volume":"35","author":"A Heath","year":"2016","unstructured":"Heath A, Manolopoulou I, Baio G. Estimating the expected value of partial perfect information in health economic evaluations using integrated nested laplace approximation. Statist Med. 2016;35(23):4264\u201380.","journal-title":"Statist Med"},{"issue":"2","key":"446_CR13","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1214\/18-AOAS1161SF","volume":"12","author":"X-L Meng","year":"2018","unstructured":"Meng X-L. Statistical paradises and paradoxes in big data (i): law of large populations, big data paradox, and the 2016 us presidential election. Ann Appl Stat. 2018;12(2):685\u2013726. https:\/\/doi.org\/10.1214\/18-AOAS1161SF.","journal-title":"Ann Appl Stat"},{"issue":"9","key":"446_CR14","doi-asserted-by":"publisher","first-page":"3064","DOI":"10.1109\/TIT.2005.853314","volume":"51","author":"Q Wang","year":"2005","unstructured":"Wang Q, Kulkarni SR, Verd\u00fa S. Divergence estimation of continuous distributions based on data-dependent partitions. IEEE Transact Informat Theory. 2005;51(9):3064\u201374.","journal-title":"IEEE Transact Informat Theory."},{"key":"446_CR15","unstructured":"P\u00f3czos B, Xiong L, Schneider J. Nonparametric divergence estimation with applications to machine learning on distributions. In: UAI (also arXiv Preprint arXiv:1202.3758 2012) 2011."},{"issue":"3","key":"446_CR16","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TSP.2015.2477805","volume":"64","author":"V Berisha","year":"2016","unstructured":"Berisha V, Wisler A, Hero AO, Spanias A. Empirically estimable classification bounds based on a nonparametric divergence measure. IEEE Transact Signal Process. 2016;64(3):580\u201391.","journal-title":"IEEE Transact Signal Process"},{"key":"446_CR17","doi-asserted-by":"crossref","unstructured":"Noshad M, Hero A. Scalable hash-based estimation of divergence measures. In: International Conference on Artificial Intelligence and Statistics, 2018;pp. 1877\u20131885.","DOI":"10.1109\/ITA.2018.8503092"},{"key":"446_CR18","unstructured":"Noshad M, Xu L, Hero A. Learning to benchmark: Determining best achievable misclassification error from training data. arXiv preprint arXiv:1909.07192 2019."},{"key":"446_CR19","doi-asserted-by":"crossref","unstructured":"Ho S-W, Verd\u00fa S. Convexity\/concavity of renyi entropy and $$\\alpha$$-mutual information. In: Information Theory (ISIT), 2015 IEEE International Symposium On, 2015;pp. 745\u2013749. IEEE","DOI":"10.1109\/ISIT.2015.7282554"},{"key":"446_CR20","volume-title":"Elements of information theory","author":"TM Cover","year":"2012","unstructured":"Cover TM, Thomas JA. Elements of information theory. Hoboken: Wiley; 2012."},{"key":"446_CR21","unstructured":"Shwartz-Ziv R, Tishby N. Opening the black box of deep neural networks via information. arXiv preprint arXiv:1703.00810 2017."},{"key":"446_CR22","doi-asserted-by":"crossref","unstructured":"Noshad M, Zeng Y, Hero AO. Scalable mutual information estimation using dependence graphs. In: ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2019;pp. 2962\u20132966. IEEE","DOI":"10.1109\/ICASSP.2019.8683351"},{"issue":"1","key":"446_CR23","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1111\/j.1467-985X.2005.00377.x","volume":"169","author":"A Ades","year":"2006","unstructured":"Ades A, Sutton A. Multiparameter evidence synthesis in epidemiology and medical decision-making: current approaches. J Royal Stat Soci Series A. 2006;169(1):5\u201335.","journal-title":"J Royal Stat Soci Series A"},{"issue":"3","key":"446_CR24","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1111\/j.1467-9868.2004.05304.x","volume":"66","author":"JE Oakley","year":"2004","unstructured":"Oakley JE, O\u2019Hagan A. Probabilistic sensitivity analysis of complex models: a bayesian approach. J Royal Statist Soc Series B. 2004;66(3):751\u201369.","journal-title":"J Royal Statist Soc Series B"},{"key":"446_CR25","unstructured":"Saltelli A, Tarantola S, Campolongo F, Ratto M. Sensitivity analysis in practice: a guide to assessing scientific models. Chichester. 2004."},{"issue":"10","key":"446_CR26","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1109\/TKDE.2009.191","volume":"22","author":"SJ Pan","year":"2010","unstructured":"Pan SJ, Yang Q. A survey on transfer learning. IEEE Transact Knowl Data Eng. 2010;22(10):1345\u201359. https:\/\/doi.org\/10.1109\/TKDE.2009.191.","journal-title":"IEEE Transact Knowl Data Eng"},{"key":"446_CR27","unstructured":"Denison DD, Hansen MH, Holmes CC, Mallick B, Yu B. Nonlinear Estimation and Classification. Lecture Notes in Statistics. Springer. 2013. https:\/\/books.google.com\/books?id=0IDuBwAAQBAJ"},{"issue":"7553","key":"446_CR28","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1038\/nature14541","volume":"521","author":"Z Ghahramani","year":"2015","unstructured":"Ghahramani Z. Probabilistic machine learning and artificial intelligence. Nature. 2015;521(7553):452\u20139.","journal-title":"Nature"},{"key":"446_CR29","doi-asserted-by":"crossref","unstructured":"Faraway JJ. Extending the Linear Model with R: Generalized Linear, Mixed Effects and Nonparametric Regression Models. Chapman and Hall\/CRC, ??? 2016.","DOI":"10.1201\/9781315382722"},{"issue":"4","key":"446_CR30","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1002\/(SICI)1097-0258(19970228)16:4<385::AID-SIM380>3.0.CO;2-3","volume":"16","author":"R Tibshirani","year":"1997","unstructured":"Tibshirani R. The lasso method for variable selection in the cox model. Statist Med. 1997;16(4):385\u201395.","journal-title":"Statist Med"},{"issue":"3","key":"446_CR31","first-page":"18","volume":"2","author":"A Liaw","year":"2002","unstructured":"Liaw A, Wiener M, et al. Classification and regression by randomforest. R News. 2002;2(3):18\u201322.","journal-title":"R News"},{"key":"446_CR32","unstructured":"Margineantu DD, Dietterich TG. Pruning adaptive boosting. In: ICML, 1997;vol. 97, pp. 211\u2013218. Citeseer"},{"key":"446_CR33","doi-asserted-by":"publisher","unstructured":"Chen T, Guestrin C. Xgboost: A scalable tree boosting system. In: Proceedings of the 22Nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201916, pp. 785\u2013794. ACM, New York 2016. https:\/\/doi.org\/10.1145\/2939672.2939785.","DOI":"10.1145\/2939672.2939785"},{"key":"446_CR34","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/TSMC.1976.5408784","volume":"4","author":"SA Dudani","year":"1976","unstructured":"Dudani SA. The distance-weighted k-nearest-neighbor rule. IEEE Transact Syst Man Cybernet. 1976;4:325\u20137.","journal-title":"IEEE Transact Syst Man Cybernet"},{"issue":"1","key":"446_CR35","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA. Algorithm as 136: a k-means clustering algorithm. J Royal Statist Soc Series C. 1979;28(1):100\u20138.","journal-title":"J Royal Statist Soc Series C"},{"issue":"17","key":"446_CR36","doi-asserted-by":"publisher","first-page":"2463","DOI":"10.1093\/bioinformatics\/btr406","volume":"27","author":"U Bodenhofer","year":"2011","unstructured":"Bodenhofer U, Kothmeier A, Hochreiter S. Apcluster: an r package for affinity propagation clustering. Bioinformatics. 2011;27(17):2463\u20134.","journal-title":"Bioinformatics"},{"issue":"3","key":"446_CR37","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00357-014-9161-z","volume":"31","author":"F Murtagh","year":"2014","unstructured":"Murtagh F, Legendre P. Ward\u2019s hierarchical agglomerative clustering method: which algorithms implement ward\u2019s criterion? J Classificat. 2014;31(3):274\u201395.","journal-title":"J Classificat"},{"key":"446_CR38","unstructured":"Alemi AA, Fischer I, Dillon JV, Murphy K. Deep variational information bottleneck. arXiv preprint arXiv:1612.00410 2016."},{"issue":"6","key":"446_CR39","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/MSP.2012.2211477","volume":"29","author":"L Deng","year":"2012","unstructured":"Deng L. The mnist database of handwritten digit images for machine learning research [best of the web]. IEEE Signal Process Magaz. 2012;29(6):141\u20132. https:\/\/doi.org\/10.1109\/MSP.2012.2211477.","journal-title":"IEEE Signal Process Magaz"},{"issue":"6","key":"446_CR40","doi-asserted-by":"publisher","first-page":"066138","DOI":"10.1103\/PhysRevE.69.066138","volume":"69","author":"A Kraskov","year":"2004","unstructured":"Kraskov A, St\u00f6gbauer H, Grassberger P. Estimating mutual information. Phys Rev E. 2004;69(6):066138.","journal-title":"Phys Rev E"},{"issue":"3","key":"446_CR41","doi-asserted-by":"publisher","first-page":"2318","DOI":"10.1103\/PhysRevE.52.2318","volume":"52","author":"Y Moon","year":"1995","unstructured":"Moon Y, Rajagopalan B, Lall U. Estimation of mutual information using kernel density estimators. Phys Rev E. 1995;52(3):2318.","journal-title":"Phys Rev E"},{"issue":"12","key":"446_CR42","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1109\/TPAMI.2002.1114861","volume":"24","author":"N Kwak","year":"2002","unstructured":"Kwak N, Choi C-H. Input feature selection by mutual information based on parzen window. IEEE Transact Pattern Analy Mach Intell. 2002;24(12):1667\u201371.","journal-title":"IEEE Transact Pattern Analy Mach Intell"},{"issue":"6","key":"446_CR43","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/LSP.2009.2017346","volume":"16","author":"D Stowell","year":"2009","unstructured":"Stowell D, Plumbley MD. Fast multidimensional entropy estimation by $$k$$-d partitioning. IEEE Signal Process Lett. 2009;16(6):537\u201340. https:\/\/doi.org\/10.1109\/LSP.2009.2017346.","journal-title":"IEEE Signal Process Lett"},{"key":"446_CR44","doi-asserted-by":"crossref","unstructured":"Evans D. A computationally efficient estimator for mutual information. In: Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, 2008;vol. 464, pp. 1203\u20131215. The Royal Society","DOI":"10.1098\/rspa.2007.0196"},{"key":"446_CR45","doi-asserted-by":"crossref","unstructured":"Walters-Williams J, Li Y. Estimation of mutual information: A survey. In: International Conference on Rough Sets and Knowledge Technology, 2009;pp. 389\u2013396. Springer","DOI":"10.1007\/978-3-642-02962-2_49"},{"key":"446_CR46","unstructured":"Singh S, P\u00f3czos B. Generalized exponential concentration inequality for r\u00e9nyi divergence estimation. In: International Conference on Machine Learning, 2014;pp. 333\u2013341."},{"key":"446_CR47","doi-asserted-by":"crossref","unstructured":"Noshad M, Moon KR, Sekeh SY, Hero AO. Direct estimation of information divergence using nearest neighbor ratios. In: 2017 IEEE International Symposium on Information Theory (ISIT), 2017;pp. 903\u2013907. IEEE","DOI":"10.1109\/ISIT.2017.8006659"},{"key":"446_CR48","doi-asserted-by":"crossref","unstructured":"Noshad M, Hero AO. Scalable hash-based estimation of divergence measures. In: 2018 Information Theory and Applications Workshop (ITA), 2018; pp. 1\u201310. IEEE","DOI":"10.1109\/ITA.2018.8503092"},{"issue":"3","key":"446_CR49","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s12021-018-9406-9","volume":"17","author":"M Tang","year":"2019","unstructured":"Tang M, Gao C, Goutman SA, Kalinin A, Mukherjee B, Guan Y, Dinov ID. Model-based and model-free techniques for amyotrophic lateral sclerosis diagnostic prediction and patient clustering. Neuroinformatics. 2019;17(3):407\u201321. https:\/\/doi.org\/10.1007\/s12021-018-9406-9.","journal-title":"Neuroinformatics"},{"issue":"6","key":"446_CR50","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.3171\/2014.7.JNS131430","volume":"121","author":"R Rahme","year":"2014","unstructured":"Rahme R, Yeatts SD, Abruzzo TA, Jimenez L, Fan L, Tomsick TA, Ringer AJ, Furlan AJ, Broderick JP, Khatri P. Early reperfusion and clinical outcomes in patients with m2 occlusion: pooled analysis of the proact ii, ims, and ims ii studies. J Neurosurgery JNS. 2014;121(6):1354\u20138.","journal-title":"J Neurosurgery JNS"},{"key":"446_CR51","doi-asserted-by":"publisher","unstructured":"Glass JD, Hertzberg VS, Boulis NM, Riley J, Federici T, Polak M, Bordeau J, Fournier C, Johe K, Hazel T, Cudkowicz M, Atassi N, Borges LF, Rutkove SB, Duell J, Patil PG, Goutman SA, Feldman EL. Transplantation of spinal cord\u2013derived neural stem cells for als. Neurology. 2016;87(4):392\u2013400. https:\/\/doi.org\/10.1212\/WNL.0000000000002889. https:\/\/n.neurology.org\/content\/87\/4\/392.full.pdf","DOI":"10.1212\/WNL.0000000000002889"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-021-00446-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-021-00446-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-021-00446-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T17:05:12Z","timestamp":1622912712000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-021-00446-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,5]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["446"],"URL":"https:\/\/doi.org\/10.1186\/s40537-021-00446-6","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,5]]},"assertion":[{"value":"22 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"82"}}