That was fast! Speeding up NN search of high dimensional distributions
暂无分享,去创建一个
Antoni B. Chan | Gert R. G. Lanckriet | Adeel Mumtaz | Emanuele Coviello | G. Lanckriet | E. Coviello | Adeel Mumtaz
[1] Lawrence Cayton,et al. Fast nearest neighbor retrieval for bregman divergences , 2008, ICML '08.
[2] Antoni B. Chan,et al. Growing a bag of systems tree for fast and accurate classification , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[3] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[4] Antoni B. Chan,et al. Modeling Music as a Dynamic Texture , 2010, IEEE Transactions on Audio, Speech, and Language Processing.
[5] Stefano Soatto,et al. Dynamic Textures , 2003, International Journal of Computer Vision.
[6] Andrew W. Moore,et al. The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data , 2000, UAI.
[7] Suresh Venkatasubramanian,et al. Approximate bregman near neighbors in sublinear time: beyond the triangle inequality , 2012, SoCG '12.
[8] Lawrence Cayton. Efficient Bregman Range Search , 2009, NIPS.
[9] Stephen M. Omohundro,et al. Five Balltree Construction Algorithms , 2009 .
[10] John D. Lafferty,et al. A correlated topic model of Science , 2007, 0708.3601.
[11] Jeffrey K. Uhlmann,et al. Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..
[12] Anthony K. H. Tung,et al. Similarity Search on Bregman Divergence: Towards Non-Metric Indexing , 2009, Proc. VLDB Endow..
[13] John R. Hershey,et al. Approximating the Kullback Leibler Divergence Between Gaussian Mixture Models , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.
[14] Michael A. Casey,et al. Locality-Sensitive Hashing for Finding Nearest Neighbors , 2008 .
[15] Nuno Vasconcelos,et al. Probabilistic kernels for the classification of auto-regressive visual processes , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[16] Shuicheng Yan,et al. Non-Metric Locality-Sensitive Hashing , 2010, AAAI.
[17] Frank Nielsen,et al. Bregman vantage point trees for efficient nearest Neighbor Queries , 2009, 2009 IEEE International Conference on Multimedia and Expo.
[18] Joachim M. Buhmann,et al. Empirical evaluation of dissimilarity measures for color and texture , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
[19] Naftali Tishby,et al. Distributional Clustering of English Words , 1993, ACL.
[20] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.
[21] Inderjit S. Dhillon,et al. Clustering with Bregman Divergences , 2005, J. Mach. Learn. Res..
[22] Shun-ichi Amari,et al. Information Geometry and Its Applications: Convex Function and Dually Flat Manifold , 2009, ETVC.
[23] Antoni B. Chan,et al. Time Series Models for Semantic Music Annotation , 2011, IEEE Transactions on Audio, Speech, and Language Processing.
[24] Michael I. Jordan,et al. Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..
[25] Frank Nielsen,et al. Tailored Bregman Ball Trees for Effective Nearest Neighbors , 2009 .
[26] Nuno Vasconcelos,et al. Bridging the Gap: Query by Semantic Example , 2007, IEEE Transactions on Multimedia.
[27] Frank Nielsen,et al. Sided and Symmetrized Bregman Centroids , 2009, IEEE Transactions on Information Theory.