Binary Vectors for Fast Distance and Similarity Estimation

被引:14
|
作者
Rachkovskij D.A. [1 ]
机构
[1] International Scientific-Educational Center of Information Technologies and Systems, NAS and MES of Ukraine, Kyiv
来源
Rachkovskij, D.A. (dar@infrm.kiev.ua) | 1600年 / Springer Science and Business Media, LLC卷 / 53期
关键词
binarization; distance; embedding; Johnson–Lindenstrauss lemma; kernel similarity; locality-sensitive hashing; quantization; random projection; sampling; similarity; similarity search; sketch;
D O I
10.1007/s10559-017-9914-x
中图分类号
学科分类号
摘要
This review considers methods and algorithms for fast estimation of distance/similarity measures between initial data from vector representations with binary or integer-valued components obtained from initial data that are mainly high-dimensional vectors with different distance measures (angular, Euclidean, and others) and similarity measures (cosine, inner product, and others). Methods without learning that mainly use random projections with the subsequent quantization and also sampling methods are discussed. The obtained vectors can be applied in similarity search, machine learning, and other algorithms. © 2017, Springer Science+Business Media New York.
引用
收藏
页码:138 / 156
页数:18
相关论文
共 50 条
  • [1] Estimation of Vectors Similarity by Their Randomized Binary Projections
    Rachkovskij D.A.
    Cybernetics and Systems Analysis, 2015, 51 (05) : 808 - 818
  • [2] Index Structures for Fast Similarity Search for Binary Vectors
    Rachkovskij D.A.
    Rachkovskij, D.A. (dar@infrm.kiev.ua), 1600, Springer Science and Business Media, LLC (53): : 799 - 820
  • [3] Real-Valued Embeddings and Sketches for Fast Distance and Similarity Estimation
    Rachkovskij, D. A.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2016, 52 (06) : 967 - 988
  • [4] Distance learning for similarity estimation
    Yu, Jie
    Amores, Jaume
    Sebe, Nicu
    Radeva, Petia
    Tian, Qi
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2008, 30 (03) : 451 - 462
  • [5] Formation of similarity-reflecting binary vectors with random binary projections
    Rachkovskij D.A.
    Cybernetics and Systems Analysis, 2015, 51 (02) : 313 - 323
  • [6] Probabilistic binary similarity distance for quick binary image matching
    Mustafa, Adnan A. Y.
    IET IMAGE PROCESSING, 2018, 12 (10) : 1844 - 1856
  • [7] Fast algorithms for the estimation of motion vectors
    Wang, HS
    Mersereau, RM
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 1999, 8 (03) : 435 - 438
  • [8] Distance-Increasing Mappings from Binary Vectors to Constant Composition Vectors
    Chang, Jen-Chun
    Wu, Hsin-Lung
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 2542 - 2546
  • [9] Distance preserving mappings from binary vectors to permutations
    Chang, JC
    Chen, RJ
    Tsai, SC
    Klove, T
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 14 - 14
  • [10] Classification of binary vectors by using ASC-distance
    Fränti, P
    Xu, MT
    16TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL II, PROCEEDINGS, 2002, : 52 - 55