• No results found

similarity search

Efficient Similarity Search with Cache-Conscious Data Traversal

Efficient Similarity Search with Cache-Conscious Data Traversal

... parallel time (79, 845 hours as extrapolated from Table 3.6) is 16, 138x speedup over 300 cores, which means incorporating LSH method is at least 71x faster over parallel time with Partition-based method, assuming 75.6% ...

164

Adaptive and Dynamic Pivot Selection for Similarity Search

Adaptive and Dynamic Pivot Selection for Similarity Search

... a similarity search than an exact search. The similarity search problem can be formalized through the concept of metric space: given a set of objects and a distance function between ...

8

State of the art in string similarity search and join

State of the art in string similarity search and join

... String similarity search and its variants are fundamental problems with many applications in areas such as data integration, data quality, computational linguistics, or ...-approximate search and k ...

14

Boosting the Efficiency in Similarity Search on Signature Collections

Boosting the Efficiency in Similarity Search on Signature Collections

... performing similarity search on the signatures to identify a set of candidate pairs that are likely to be near-duplicates and (c) eliminating false ...performing similarity search on the ...

6

Fast matching for all pairs similarity search

Fast matching for all pairs similarity search

... pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified ...like search en- gines, online social networks, and digital libraries ...

8

Similarity Search in Multidimensional Time Series using the Coulomb’s Law

Similarity Search in Multidimensional Time Series using the Coulomb’s Law

... In this article, we propose a new descriptor for time series analysis. This descriptor works with one- dimensional and multidimensional time series. By comparing the Coulomb method to traditional ones, it is possible to ...

10

Learning compact hashing codes for large-scale similarity search

Learning compact hashing codes for large-scale similarity search

... Retrieval of similar objects is a key component in many applications. As databases grow larger, learning compact representations for efficient storage and fast search becomes increasingly important. Moreover, ...

114

Evaluation of a Similarity Search Method for Human Behavior (Extended LDSD)

Evaluation of a Similarity Search Method for Human Behavior (Extended LDSD)

... the similarity of human processes exist, they cannot express the above two important features defined in our ...appropriate similarity search method is needed and we proposed in the previous ...

6

Multi-keyword  Similarity  Search  Over  Encrypted  Cloud  Data

Multi-keyword Similarity Search Over Encrypted Cloud Data

... word search or multi-keyword search and the types of techniques they use to build the trapdoor ...of similarity search. The similarity search problem consists of a collection of ...

14

Distributed Efficient Similarity Search Mechanism in Wireless Sensor Networks

Distributed Efficient Similarity Search Mechanism in Wireless Sensor Networks

... Network similarity search problem has received considerable research attention due to sensor hardware imprecision and environmental parameter ...for similarity queries of ...based similarity ...

30

Fast, Incremental, and Scalable All Pairs Similarity Search

Fast, Incremental, and Scalable All Pairs Similarity Search

... like search engines, digital libraries, and systems biology often deal with massive datasets in a high dimensional ...incremental similarity search over large high dimensional datasets through ...

100

Semi Supervised SimHash for Efficient Document Similarity Search

Semi Supervised SimHash for Efficient Document Similarity Search

... This paper proposes a novel (semi-)supervised hashing method, Semi-Supervised SimHash (S 3 H), for high-dimensional data similarity search. Un- like SSH that tries to find a sequence of hash func- tions, S ...

9

Semantic Vector Encoding and Similarity Search Using Fulltext Search Engines

Semantic Vector Encoding and Similarity Search Using Fulltext Search Engines

... ‘vector similarity search- ing’ over dense semantic representations of words and documents that can be deployed on top of traditional inverted-index-based fulltext engines, taking advantage of their ...

10

Q-GRAM BASED JOIN FOR STRING SIMILARITY SEARCH

Q-GRAM BASED JOIN FOR STRING SIMILARITY SEARCH

... based Similarity join and FP-Growth algorithm are ...based similarity join matches both the substrings and the whole ...string similarity search Modern search engines often apply ...

6

A Novel Approach for Improving Similarity Search Using SVM Classification Algorithm

A Novel Approach for Improving Similarity Search Using SVM Classification Algorithm

... So the document topics are classified based on the similar topics and if new topics arrived it can be compute based on the label data. Hence it can achieve the high similarity and semantic concept for dynamic ...

6

Tense and Mood Decision with Similarity Search in Japanese to Spanish Machine Translation

Tense and Mood Decision with Similarity Search in Japanese to Spanish Machine Translation

... uses similarity search with tree dis- tance functions to find the distance between a sentence and all the sentences included in a knowledge ...Systran. Similarity search provides a powerful, ...

6

SSS-V2:  Secure  Similarity  Search

SSS-V2: Secure Similarity Search

... index search has been conducted over encrypted documents with various scenarios; however, in the field of the keyword index search over encrypted documents, there remains four problems in DBMS (DataBase ...

14

Online hashing for fast similarity search

Online hashing for fast similarity search

... fast similarity search is studied. Similarity search is a central problem in many computer vision applica- ...performing similarity search, requiring search strategies ...

152

Robust Quantization for General Similarity Search

Robust Quantization for General Similarity Search

... Abstract—The recent years have witnessed the emerging of vec- tor quantization (VQ) techniques for efficient similarity search. VQ partitions the feature space into a set of codewords and encodes data ...

15

An Adaptive Multi-level Hashing Structure for Fast Approximate Similarity Search

An Adaptive Multi-level Hashing Structure for Fast Approximate Similarity Search

... approximate similarity search algorithm known as Locality Sensitive Hashing (LSH) was recently proposed to query high-dimensional datasets with efficient computational ...the similarity search ...

16

Show all 8976 documents...

Related subjects