Name
Abstract | ||
|---|---|---|
Hashing techniques have been widely used in many machine learning applications because of their efficiency in both computation and storage. Although a variety of hashing methods have been proposed, most of them make some implicit assumptions about the statistical or geometrical structure of data. In fact, few hashing algorithms can adequately handle all kinds of data with different structures. When considering hybrid structure datasets, different hashing algorithms might produce different and possibly inconsistent binary codes. Inspired by the successes of classifier combination and clustering ensembles, in this paper, we present a novel combination strategy for multiple hashing results, named consensus hashing. By defining the measure of consensus of two hashing results, we put forward a simple yet effective model to learn consensus hash functions which generate binary codes consistent with the existing ones. Extensive experiments on several large scale benchmarks demonstrate the overall superiority of the proposed method compared with state-of-the-art hashing algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10994-015-5496-x | Machine Learning |
Keywords | DocType | Volume |
Hash Function,Mean Average Precision,Ensemble Learning,Connectivity Matrix,Large Scale Dataset | Journal | 100 |
Issue | Citations | PageRank |
2-3 | 0 | 0.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cong Leng | 1 | 241 | 13.20 |
| Jian Cheng | 2 | 1327 | 115.72 |