Collaborative Hashing Xianglong Liuy Junfeng Hez Cheng Deng\ Bo Langy yState Key Lab of Software Development Environment, Beihang University, Beijing, China zFacebook, 1601 Willow Rd, Menlo Park, CA, USA \Xidian University, Xi’an, China fxlliu,
[email protected] [email protected] [email protected] Abstract binary codes by exploiting the data correlations among the data entities (e.g., the cosine similarities between Hashing technique has become a promising approach for feature vectors). In practice, there are many scenarios fast similarity search. Most of existing hashing research involving nearest neighbor search on the data matrix with pursue the binary codes for the same type of entities by two dimensions corresponding to two different coupled preserving their similarities. In practice, there are many views or entities. For instance, the classic textual retrieval scenarios involving nearest neighbor search on the data usually works based on the term-document matrix with given in matrix form, where two different types of, yet each element representing the correlations between two naturally associated entities respectively correspond to its views: words and documents. Recently, such bag-of- two dimensions or views. To fully explore the duality words (BoW) model has also been widely used in computer between the two views, we propose a collaborative hashing vision and multimedia retrieval, which mainly captures the scheme for the data in matrix form to enable fast search correlations between local features (even the dictionaries in various applications such as image search using bag of using sparse coding) and visual objects [16, 17]. Besides words and recommendation using user-item ratings.