Metrics defined by Bregman Divergences
暂无分享,去创建一个
[1] G. M.,et al. Partial Differential Equations I , 2023, Applied Mathematical Sciences.
[2] L. Bregman. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .
[3] R. Gray,et al. Speech coding based upon vector quantization , 1980, ICASSP.
[4] Jeffrey K. Uhlmann,et al. Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..
[5] Peter N. Yianilos,et al. Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.
[6] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[7] Manfred K. Warmuth,et al. Relative Expected Instantaneous Loss Bounds , 2000, J. Comput. Syst. Sci..
[8] Sanjoy Dasgupta,et al. A Generalization of Principal Components Analysis to the Exponential Family , 2001, NIPS.
[9] Dominik Endres,et al. A new metric for probability distributions , 2003, IEEE Transactions on Information Theory.
[10] Inderjit S. Dhillon,et al. A Divisive Information-Theoretic Feature Clustering Algorithm for Text Classification , 2003, J. Mach. Learn. Res..
[11] Manfred K. Warmuth,et al. Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions , 1999, Machine Learning.
[12] Inderjit S. Dhillon,et al. Clustering with Bregman Divergences , 2005, J. Mach. Learn. Res..