Prototype-Based Sample Selection for Active Hashing
Cheong Hee Park1 Show affiliations
- Chungnam National University, Korea
Journal of Computer Science, Volume 11, Issue 7, pp. 839–844 · doi.org/10.3844/jcssp.2015.839.844
Abstract
Several hashing-based methods for Approximate Nearest Neighbors (ANN) search in a large data set have been proposed recently. In particular, semi-supervised hashing utilizes semantic similarity given for a small fraction of pairwise data samples and active hashing aims to improve the performance for ANN search by relying on an expert for the labeling of the most informative points. In this study, we present an active hashing method by prototype-based sample selection. Knowing semantic similarities between cluster prototypes can help extracting relations among the points in the corresponding clusters. For expert labeling, we select prototypes from clusters which do not contain any data points with labeled information so that all areas can be covered effectively. Experimental results demonstrate that the proposed active hashing method improves the performance for ANN search.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Park, C. H. (2015). Prototype-Based Sample Selection for Active Hashing. Journal of Computer Science, 11(7), 839–844. https://doi.org/10.3844/jcssp.2015.839.844
- Licence
- CC BY 3.0
- Issue
- Volume 11, Issue 7
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
