Author:
Eguchi Shinto,Komori Osamu
Reference27 articles.
1. Barndorff-Nielsen, O. (2014). Information and exponential families: In statistical theory. Chichester: Wiley.
2. Berger, A. L., Pietra, V. J. D., & Pietra, S. A. D. (1996). A maximum entropy approach to natural language processing. Computational linguistics, 22, 39–71.
3. Cayton, L. (2008). Fast nearest neighbor retrieval for bregman divergences. In ICML ’08 (pp. 112–119).
4. Dudík, M., Phillips, S. J., & Schapire, R. E. (2004). Performance guarantees for regularized maximum entropy density estimation. In J. Shawe-Taylor & Y. Singer (Eds.), Learning theory (pp. 472–486). Berlin, Heidelberg: Springer.
5. Eguchi, S. (2006). Information geometry and statistical pattern recognition. Sugaku Expositions, 19, 197–216.