Results 31 to 40 of about 5,030,093 (326)
Data Series Progressive Similarity Search with Probabilistic Quality Guarantees
Existing systems dealing with the increasing volume of data series cannot guarantee interactive response times, even for fundamental tasks such as similarity search.
Anna Gogolou +4 more
semanticscholar +1 more source
JOSIE: Overlap Set Similarity Search for Finding Joinable Tables in Data Lakes
We present a new solution for finding joinable tables in massive data lakes: given a table and one join column, find tables that can be joined with the given table on the largest number of distinct values.
Erkang Zhu +3 more
semanticscholar +1 more source
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases [PDF]
Many studies have been conducted on seeking the efficient solution for subgraph similarity search over certain (deterministic) graphs due to its wide application in many fields, including bioinformatics, social network analysis, and Resource Description ...
Chen, Lei +3 more
core +3 more sources
Searchable Public Key Encryption Supporting Semantic Multi-Keywords Search
Searchable public key encryption (SPE) that supports multi-keywords search, allows data users to retrieve encrypted files of interest efficiently, and thus it has been intensively studied during recent years. However, most existing SPE solutions focus on
Yu Zhang, Yifan Wang, Yin Li
doaj +1 more source
High quality graph-based similarity search [PDF]
SimRank is an influential link-based similarity measure that has been used in many fields of Web search and sociometry. The best-of-breed method by Kusumoto et.
McCann, J, Yu, W
core +2 more sources
Set similarity search beyond MinHash [PDF]
We consider the problem of approximate set similarity search under Braun-Blanquet similarity $B(\mathbf{x}, \mathbf{y}) = |\mathbf{x} \cap \mathbf{y}| / \max(|\mathbf{x}|, |\mathbf{y}|)$. The $(b_2, b_2)$-approximate Braun-Blanquet similarity search problem is to preprocess a collection of sets $P$ such that, given a query set $\mathbf{q}$, if there ...
Christiani, Tobias Lybecker +1 more
openaire +2 more sources
Multivariate Time Series Similarity Searching [PDF]
Multivariate time series (MTS) datasets are very common in various financial, multimedia, and hydrological fields. In this paper, a dimension-combination method is proposed to search similar sequences for MTS. Firstly, the similarity of single-dimension series is calculated; then the overall similarity of the MTS is obtained by synthesizing each of the
Jimin Wang +4 more
openaire +3 more sources
A Hybrid Sparrow Search Algorithm Based on Constructing Similarity
Sparrow search algorithm (SSA) is easy to fall into local convergence and convergence stagnation. In order to solve these problems, this paper introduced Circle chaos map into the original SSA to improve its global search ability at the beginning of ...
Jianhua Liu, Zhiheng Wang
semanticscholar +1 more source
Memory vectors for similarity search in high-dimensional spaces [PDF]
We study an indexing architecture to store and search in a database of high-dimensional vectors from the perspective of statistical signal processing and decision theory.
Furon, Teddy +4 more
core +5 more sources
Similarity search for scientific workflows [PDF]
With the increasing popularity of scientific workflows, public repositories are gaining importance as a means to share, find, and reuse such workflows. As the sizes of these repositories grow, methods to compare the scientific workflows stored in them become a necessity, for instance, to allow duplicate detection or similarity search.
Starlinger, Johannes +3 more
openaire +3 more sources

