A High Performance Text Vector Similarity Search Method Based on Overlapping Degree

Author(s):  
Peng Zhao ◽  
Fan Yang ◽  
Zhibin Zhang ◽  
Jiafeng Guo ◽  
Xueqi Cheng
2014 ◽  
Vol 54 (4) ◽  
pp. 1036-1049 ◽  
Author(s):  
Adrián Kalászi ◽  
Dániel Szisz ◽  
Gábor Imre ◽  
Tímea Polgár

2011 ◽  
Author(s):  
Liuzhang Zhu ◽  
Zimian Li ◽  
Zheng Cao

Author(s):  
Hans Vandierendonck ◽  
Karen Murphy ◽  
Mahwish Arif ◽  
Dimitrios S. Nikolopoulos

2019 ◽  
Author(s):  
Andrew Dalke

<div>This paper describes the 10 years of work and research results of the chemfp project, available from http://chemfp.com/ . The project started as a way to promote the FPS format for cheminformatics fingerprint exchange. This is a line-oriented text format meant to be easy to read and write. It supports metadata such as the fingerprint type and data provenance.The chemfp package for Python was developed to provide the basic command-line tools and Python API for working with fingerprint data, because a format without useful tools will not be used. The similarity search performance improved by an order of magnitude over the decade, due to careful implementation and effective use of CPU hardware, including AVX2 support for faster popcount calculations than the built-in POPCNT instruction. The implementation details for high-performance search have rarely been discussed in the literature. As a result, many tools and published papers use implementations which are not close to the machine's capabilities. This paper describes those details to help with future optimization efforts. The most advanced version of chemfp evaluates about 130 million 1024-bit fingerprint Tanimotos per second on a single core of a standard x86-64 server machine. When combined with the BitBound algorithm, a k=1000 nearest-neighbor search of the 1.8 million 2048-bit Morgan fingerprints of ChEMBL 24 averages 27 ms/query and the same search of the 970 million PubChem fingerprints averages 220 ms/query, making chemfp one of the fastest similarity search tools available for CPUs. This appears to be several times faster than previously published work in the field, including in papers which use much more sophisticated data structures. A close analysis shows that nearly all earlier work assumes that the intersection popcount was the limiting performance factor, while on modern hardware uncompressed search is effectively memory bandwidth limited. For example, AVX2 search is 10% faster when memory prefetching, and the popcount evaluation time is far faster than fetching a random location in main memory. It proved difficult to evaluate existing tool performance because in the few cases where the tools were available, each used its own format, data sets, and search tasks. This paper introduces the chemfp benchmark data set to help make head-to-head comparisons easier in the future, and to help promote the FPS format. The FPS format is slow for tasks like web server reloads and command-line scripting. This paper also describes the FPB format, which is a binary application format for fast loads. </div>


PLoS ONE ◽  
2021 ◽  
Vol 16 (11) ◽  
pp. e0259028
Author(s):  
Mingxi Zhang ◽  
Liuqian Yang ◽  
Yipeng Dong ◽  
Jinhua Wang ◽  
Qinghan Zhang

Searching similar pictures for a given picture is an important task in numerous applications, including image recommendation system, image classification and image retrieval. Previous studies mainly focused on the similarities of content, which measures similarities based on visual features, such as color and shape, and few of them pay enough attention to semantics. In this paper, we propose a link-based semantic similarity search method, namely PictureSim, for effectively searching similar pictures by building a picture-tag network. The picture-tag network is built by “description” relationships between pictures and tags, in which tags and pictures are treated as nodes, and relationships between pictures and tags are regarded as edges. Then we design a TF-IDF-based model to removes the noisy links, so the traverses of these links can be reduced. We observe that “similar pictures contain similar tags, and similar tags describe similar pictures”, which is consistent with the intuition of the SimRank. Consequently, we utilize the SimRank algorithm to compute the similarity scores between pictures. Compared with content-based methods, PictureSim could effectively search similar pictures semantically. Extensive experiments on real datasets to demonstrate the effectiveness and efficiency of the PictureSim.


2021 ◽  
Vol 20 ◽  
pp. 508-519
Author(s):  
Anatoly Beletsky

The known algorithms for synthesizing irreducible polynomials have a significant drawback: their computational complexity, as a rule, exceeds the quadratic one. Moreover, consequently, as a consequence, the construction of large-degree polynomials can be implemented only on computing systems with very high performance. The proposed algorithm is base on the use of so-called fiducial grids (ladders). At each rung of the ladder, simple recurrent modular computations are performers. The purpose of the calculations is to test the irreducibility of polynomials over Galois fields of arbitrary characteristics. The number of testing steps coincides with the degree of the synthesized polynomials. Upon completion of testing, the polynomial is classifieds as either irreducible or composite. If the degree of the synthesized polynomials is small (no more than two dozen), the formation of a set of tested polynomials is carried out using the exhaustive search method. For large values of the degree, the test polynomials are generating by statistical modeling. The developed algorithm allows one to synthesize binary irreducible polynomials up to 2Kbit on personal computers of average performance


Sign in / Sign up

Export Citation Format

Share Document