{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T21:15:11Z","timestamp":1779311711979,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642400193","type":"print"},{"value":"9783642400209","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40020-9_25","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T01:32:37Z","timestamp":1376875957000},"page":"241-248","source":"Crossref","is-referenced-by-count":12,"title":["Hypothesis Testing, Information Divergence and Computational Geometry"],"prefix":"10.1007","author":[{"given":"Frank","family":"Nielsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1109\/18.567705","volume":"43","author":"C.C. Leang","year":"1997","unstructured":"Leang, C.C., Johnson, D.H.: On the asymptotics of M-hypothesis Bayesian detection. IEEE Transactions on Information Theory\u00a043(1), 280\u2013282 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/TIT.1970.1054466","volume":"16","author":"M.E. Hellman","year":"1970","unstructured":"Hellman, M.E., Raviv, J.: Probability of error, equivocation and the Chernoff bound. IEEE Transactions on Information Theory\u00a016, 368\u2013372 (1970)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics\u00a023, 493\u2013507 (1952)","journal-title":"Annals of Mathematical Statistics"},{"key":"25_CR4","doi-asserted-by":"crossref","DOI":"10.1214\/lnms\/1215466757","volume-title":"Fundamentals of statistical exponential families: with applications in statistical decision theory","author":"L.D. Brown","year":"1986","unstructured":"Brown, L.D.: Fundamentals of statistical exponential families: with applications in statistical decision theory. Institute of Mathematical Statistics, Hayworth (1986)"},{"key":"25_CR5","unstructured":"Amari, S., Nagaoka, H.: Methods of Information Geometry. Oxford University Press (2000)"},{"key":"25_CR6","first-page":"1705","volume":"6","author":"A. Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J.: Clustering with Bregman divergences. Journal of Machine Learning Research\u00a06, 1705\u20131749 (2005)","journal-title":"Journal of Machine Learning Research"},{"issue":"7","key":"25_CR7","doi-asserted-by":"publisher","first-page":"3327","DOI":"10.1109\/TIT.2008.924656","volume":"54","author":"M. Westover","year":"2008","unstructured":"Westover, M.: Asymptotic geometry of multiple hypothesis testing. IEEE Transactions on Information Theory\u00a054(7), 3327\u20133329 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00454-010-9256-1","volume":"44","author":"J.D. Boissonnat","year":"2010","unstructured":"Boissonnat, J.D., Nielsen, F., Nock, R.: Bregman Voronoi diagrams. Discrete & Computational Geometry\u00a044(2), 281\u2013307 (2010)","journal-title":"Discrete & Computational Geometry"},{"key":"25_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172998","volume-title":"Algorithmic Geometry","author":"J.D. Boissonnat","year":"1998","unstructured":"Boissonnat, J.D., Yvinec, M.: Algorithmic Geometry. Cambridge University Press, New York (1998)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Nielsen, F.: k-MLE: A fast algorithm for learning statistical mixture models. In: IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP). IEEE (2012); preliminary, technical report on arXiv","DOI":"10.1109\/ICASSP.2012.6288022"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Piro, P., Nielsen, F., Barlaud, M.: Tailored Bregman ball trees for effective nearest neighbors. In: European Workshop on Computational Geometry (EuroCG), LORIA, Nancy, France. IEEE (March 2009)","DOI":"10.1109\/ICME.2009.5202635"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Nielsen, F., Piro, P., Barlaud, M.: Bregman vantage point trees for efficient nearest neighbor queries. In: Proceedings of the 2009 IEEE International Conference on Multimedia and Expo (ICME), pp. 878\u2013881 (2009)","DOI":"10.1109\/ICME.2009.5202635"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Garcia, V., Debreuve, E., Nielsen, F., Barlaud, M.: k-nearest neighbor search: Fast GPU-based implementations and application to high-dimensional feature matching. In: IEEE International Conference on Image Processing (ICIP), pp. 3757\u20133760 (2010)","DOI":"10.1109\/ICIP.2010.5654017"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/LSP.2013.2243726","volume":"20","author":"F. Nielsen","year":"2013","unstructured":"Nielsen, F.: An information-geometric characterization of Chernoff information. IEEE Signal Processing Letters (SPL)\u00a020(3), 269\u2013272 (2013)","journal-title":"IEEE Signal Processing Letters (SPL)"},{"issue":"8","key":"25_CR15","doi-asserted-by":"publisher","first-page":"5455","DOI":"10.1109\/TIT.2011.2159046","volume":"57","author":"F. Nielsen","year":"2011","unstructured":"Nielsen, F., Boltz, S.: The Burbea-Rao and Bhattacharyya centroids. IEEE Transactions on Information Theory\u00a057(8), 5455\u20135466 (2011)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Geometric Science of Information"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40020-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T20:09:10Z","timestamp":1715890150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40020-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400193","9783642400209"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40020-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}