Composite hashing with multiple information sources
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Similarity search applications with a large amount of text and image data demands an efficient and effective solution. One useful strategy is to represent the examples in databases as compact binary codes through semantic hashing, which has attracted much attention due to its fast query/search speed and drastically reduced storage requirement. All of the current semantic hashing methods only deal with the case when each example is represented by one type of features. However, examples are often described from several different information sources in many real world applications. For example, the characteristics of a webpage can be derived from both its content part and its associated links.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Object recognition from local scale-invariant features
Lowe, D. G. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790410 · Cited by 16,472
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Salakhutdinov, R., & Hinton, G. (2009) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2008.11.006 · Cited by 1,246 · cited 6×
“As claimed in [33, 47], the LSH method is data-oblivious, and may lead to inefficient codes in practice.”
BackgroundMethodInfluentialNear-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
Andoni, A., & Indyk, P. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.49 · Cited by 1,067
Cited by
Jiang, Q.-Y., & Li, W.-J. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.348 · Cited by 880
Collective Matrix Factorization Hashing for Multimodal Data
Ding, G., Guo, Y., & Zhou, J. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.267 · Cited by 680
Large-Scale Supervised Multimodal Hashing with Semantic Correlation Maximization
Zhang, D., & Li, W.-J. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8995 · Cited by 616
Self-citationSemantics-preserving hashing for cross-view retrieval
Lin, Z., Ding, G., Hu, M., & Wang, J. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299011 · Cited by 542
Learning to Hash for Indexing Big Data—A Survey
Wang, J., Liu, W., Kumar, S., & Chang, S.-F. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2487976 · Cited by 519
Deep Multi-View Enhancement Hashing for Image Retrieval
Yan, C., Gong, B., Wei, Y., & Gao, Y. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.2975798 · Cited by 504
Latent semantic sparse hashing for cross-modal similarity search
Zhou, J., Ding, G., & Guo, Y. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609610 · Cited by 467
An Overview of Cross-Media Retrieval: Concepts, Methodologies, Benchmarks, and Challenges
Peng, Y., Huang, X., & Zhao, Y. (2018) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2017.2705068 · Cited by 341
Pairwise Relationship Guided Deep Hashing for Cross-Modal Retrieval
Yang, E., Deng, C., Liu, W., Liu, X., Tao, D., & Gao, X. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10719 · Cited by 331
Column Sampling Based Discrete Supervised Hashing
Kang, W.-C., Li, W.-J., & Zhou, Z.-H. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10176 · Cited by 295
Linear cross-modal hashing for efficient multimedia search
Zhu, X., Huang, Z., Shen, H. T., & Zhao, X. (2013) · Proceedings of the 21st ACM international conference on Multimedia · doi:10.1145/2502081.2502107 · Cited by 282
Fast Supervised Discrete Hashing
Gui, J., Liu, T., Sun, Z., Tao, D., & Tan, T. (2018) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2017.2678475 · Cited by 272
Supervised hashing with latent factor models
Zhang, P., Zhang, W., Li, W.-J., & Guo, M. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609600 · Cited by 271
Large-Scale Cross-Modality Search via Collective Matrix Factorization Hashing
Ding, G., Guo, Y., Zhou, J., & Gao, Y. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2607421 · Cited by 218
“After real-value relaxation, CHMIS jointly optimizes similarity preserving and consistency as follows: min O = C 1 i j t S t i j v i − v j 2 F + C 2 i v i − t α t x t i W t 2 F + t W t 2 F s.t. i v i = 0, i v i v i = nI, α t ≥ 0 ( 3 ) where C 1 and C 2 are the weight parameters to control the trateoff between differen…”
BackgroundInfluentialData fusion in cyber-physical-social systems: State-of-the-art and perspectives
Wang, P., Yang, L. T., Li, J., Chen, J., & Hu, S. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.11.002 · Cited by 127
Learning to Hash With Optimized Anchor Embedding for Scalable Retrieval
Guo, Y., Ding, G., Liu, L., Han, J., & Shao, L. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2652730 · Cited by 108
Metadata
- Authors
- Zhang, D., Wang, F., & Si, L.
- Venue
- Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
- Publisher
- ACM
- Published
- 2011-07-24
- Pages
- 225-234
- OpenAlex
- W2162670057
- Cited by
- 211
- References
- 4
- FWCI
- 7.89
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.