Tailored Bregman Ball Trees for Effective Nearest Neighbors
暂无分享,去创建一个
[1] Richard Nock,et al. On Bregman Voronoi diagrams , 2007, SODA '07.
[2] Richard Nock,et al. Mixed Bregman Clustering with Approximation Guarantees , 2008, ECML/PKDD.
[3] G LoweDavid,et al. Distinctive Image Features from Scale-Invariant Keypoints , 2004 .
[4] Bodo Manthey,et al. Improved smoothed analysis of the k-means method , 2009, SODA.
[5] Shree K. Nayar,et al. What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images? , 2008, ECCV.
[6] Sergei Vassilvitskii,et al. k-means++: the advantages of careful seeding , 2007, SODA '07.
[7] Frank Nielsen,et al. Bregman sided and symmetrized centroids , 2008, 2008 19th International Conference on Pattern Recognition.
[8] Inderjit S. Dhillon,et al. Clustering with Bregman Divergences , 2005, J. Mach. Learn. Res..
[9] Bernard Chazelle. Technical perspective: finding a good neighbor, near and fast , 2008, CACM.
[10] Greg Hamerly,et al. Learning the k in k-means , 2003, NIPS.
[11] Lawrence Cayton,et al. Fast nearest neighbor retrieval for bregman divergences , 2008, ICML '08.
[12] Panagiotis Papapetrou,et al. Nearest Neighbor Retrieval Using Distance-Based Hashing , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[13] Shun-ichi Amari,et al. Methods of information geometry , 2000 .