Accelerated large scale optimization by concomitant hashing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7572 LNCS, Issue PART 1, 2012, Pages 414-427

  Mu, Yadong ^a   Wright, John ^a   Chang, Shih Fu ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE NEAREST NEIGHBOR; COMMON OPERATIONS; COMPUTATIONAL BOTTLENECKS; COMPUTATIONAL COSTS; HASHING TECHNIQUES; INNER PRODUCT; LARGE-SCALE OPTIMIZATION; LOCALITY SENSITIVE HASHING; NEW APPLICATIONS; OBJECT MATCHING; OPTIMIZATION ALGORITHMS; OPTIMIZATION PROCEDURES; ORDER STATISTICS; RANDOM VECTORS; REGULARIZED LEAST SQUARES; THEORETIC ANALYSIS;

ALGORITHMS; OPTIMIZATION;

COMPUTER VISION;

EID: 84867851112     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33718-5_30     Document Type: Conference Paper

References (23)

1. Wang, G., Hoiem, D., Forsyth, D.: Learning image similarity from flickr groups using stochastic intersection kernel machines. In: ICCV (2009)
2. Mu, Y., Sun, J., Han, T.X., Cheong, L.-F., Yan, S.: Randomized Locality Sensitive Vocabularies for Bag-of-Features Model. In: Daniilidis, K. (ed.) ECCV 2010, Part III. LNCS, vol. 6313, pp. 748-761. Springer, Heidelberg (2010)
3. Talwalkar, A.: Matrix Approximation for Large-scale Learning. PhD thesis, New York University (2010)
4. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117-122 (2008)
5. Basri, R., Hassner, T., Zelnik-Manor, L.: Approximate nearest subspace search. IEEE Trans. Pattern Anal. Mach. Intell. 33(2), 266-278 (2011)
6. Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: ICCV (2009)
7. Mu, Y., Yan, S.: Non-metric locality-sensitive hashing. In: AAAI (2010)
8. Liu, W., Wang, J., Kumar, S., Chang, S.-F.: Hashing with graphs. In: ICML (2011)
9. Jain, P., Vijayanarasimhan, S., Grauman, K.: Hashing hyperplane queries to near points with applications to large-scale active learning. In: NIPS (2010)
10. Tong, S., Koller, D.: Support vector machine active learning with applications to text classification. In: ICML (2000)
11. David, H., O'Connell, M., Yang, S.: Distribution and expected value of the rank of a concomitant of an order statistic. The Annals of Statistics 5(1), 216-223 (1977)
12. Eshghi, K., Rajaram, S.: Locality sensitive hash functions based on concomitant rank order statistics. In: ACM SIGKDD (2008)
13. Zhao, B., Wang, F., Zhang, C.: Efficient maximum margin clustering via cutting plane algorithm. In: SDM (2008)
14. Wright, J., Yang, A.Y., Ganesh, A., Sastry, S.S., Ma, Y.: Robust face recognition via sparse representation. IEEE Trans. Pattern Anal. Mach. Intell. 31, 210-227 (2009)
15. Perkins, S., Lacker, K., Theiler, J.: Grafting: fast, incremental feature selection by gradient descent in function space. J. Mach. Learn. Res. 3, 1333-1356 (2003)
16. Zhu, J., Lao, N., Xing, E.P.: Grafting-light: fast, incremental feature selection and structure learning of markov random fields. In: SIGKDD (2010)
17. Bhattacharya, P.K.: Convergence of sample paths of normalized sums of induced order statistics. The Annals of Statistics 2, 1034-1039 (1974)
18. Sen, P.: A note on invariance principles for induced order statistics. Annuals of Probability 4, 474-479 (1976)
19. David, H., Galambos, J.: The asymptotic theory of concomitants of order statistics. Journal of Applied Probability 11, 762-770 (1974)
20. Charikar, M.: Similarity estimation techniques from rounding algorithms. In: STOC (2002)
21. Vempala, S.: The Random Projection Method. American Mathematical Society (2004)
22. Yang, J., Yu, K., Huang, T.: Efficient Highly Over-Complete Sparse Coding Using a Mixture Model. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part V. LNCS, vol. 6315, pp. 113-126. Springer, Heidelberg (2010)
23. Chen, X., Mu, Y., Yan, S., Chua, T.-S.: Efficient large-scale image annotation by probabilistic collaborative multi-label propagation. In: ACM Multimedia (2010)