• No results found

nearest-neighbor based search

Fast Nearest Neighbor Search with Keywords Using IR2-Tree

Fast Nearest Neighbor Search with Keywords Using IR2-Tree

... of search engines has made it realistic to write spatial queries in a brand new ...objects based on both of their geometric coordinates and their associated ...a search engine can be used to find the ...

10

OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain

OPRCP: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain

... system based on blockchain and IPFS (InterPlanetary File System) is of great ...to search WMSN data efficiently over blockchain ...approximate nearest neighbor binary query for querying binary ...

14

Analysis on Fast Nearest Neighbor Search with Keywords

Analysis on Fast Nearest Neighbor Search with Keywords

... Spatial queries with keywords have not been extensively explored. In the past years, the community has sparked enthusiasm in studying keyword search in relational databases. It is until recently that attention was ...

5

Nearest Neighbor Search with Keywords Using Spatial Inverted Index

Nearest Neighbor Search with Keywords Using Spatial Inverted Index

... Location based information stored in GIS database. These information entities of such databases have both spatial and textual descriptions. This paper proposes a framework for GIR system and focus on indexing ...

7

Keyword Search for Quick Finding of Nearest Neighbor

Keyword Search for Quick Finding of Nearest Neighbor

... result based on user location ...keywords. Nearest neighbor search algorithm use an access method called the spatial inverted index (SI ...keyword-improved nearest neighbor ...

7

Nearest Neighbor Search with Anytime  Clustering Method

Nearest Neighbor Search with Anytime Clustering Method

... answers based on their distances to an ...k nearest neighbors is ...K nearest neighbors on large-scale ...the nearest data point of a given query point with increasing ...are based on ...

6

Nearest Neighbor Queries with Counting Aggregate-based Conditions

Nearest Neighbor Queries with Counting Aggregate-based Conditions

... the count is greater than or equal to the given value. The first seven lines of this algorithm are exactly equal to the respective ones in the previous algorithm. In line 8, the algorithm scans the result looking for a ...

16

Presentation of a Parallel Algorithm for Nearest Neighbor Search on GPU Using CUDA
                 

Presentation of a Parallel Algorithm for Nearest Neighbor Search on GPU Using CUDA  

... – Nearest Neighbor Search Algorithm has many applications in various sciences, for example KNN classification techniques are used often in industry and in many scientific ...content based ...

5

Title: A Practical Approach to Faster Spatial Queries with Keywords

Title: A Practical Approach to Faster Spatial Queries with Keywords

... is based on the precipitation of the solution freedom of any chance „nearest neighbor ...is based on a precomputation of the clarification spaces, it is active, ...

8

RECURSIVE ANTIHUB2 OUTLIER DETECTION IN HIGH DIMENSIONAL DATA

RECURSIVE ANTIHUB2 OUTLIER DETECTION IN HIGH DIMENSIONAL DATA

... k nearest neighbours[2]. A quick and efficient way to identify k nearest neighbors of each point by linearizing the search space through the Hilbert space filling curve is ...Partition based ...

6

Keyword Search For Nearest Neighbor Using IR 2 - TREE

Keyword Search For Nearest Neighbor Using IR 2 - TREE

... of spatial keyword query. A spatial database manages multidimensional objects (such as points, rectangles, etc.) and provides fast access to those objects based on different selection criteria. The importance of ...

7

Fast Concept Mention Grouping for Concept Map based Multi Document Summarization

Fast Concept Mention Grouping for Concept Map based Multi Document Summarization

... Concept map–based multi-document summa- rization has recently been proposed as a vari- ant of the traditional summarization task with graph-structured summaries. As shown by previous work, the grouping of ...

6

An Initialization Method for the K means Algorithm using RNN and Coupling Degree

An Initialization Method for the K means Algorithm using RNN and Coupling Degree

... clustering based on reverse nearest neighbor (RNN) and reverse farthest neighbor (RFN) ...RNN search retrieves all points in a given data set whose nearest neighbor is a ...

6

Secure K-Nearest Neighbor Search By Keywords

Secure K-Nearest Neighbor Search By Keywords

... This paper initially performed client study to investigate the wellbeing seeker needs. This gives the bits of knowledge of group based wellbeing administrations. It then displayed a scantily associated profound ...

6

FAST NEAREST NEIGHBOR SEARCH WITH KEYWORDS

FAST NEAREST NEIGHBOR SEARCH WITH KEYWORDS

... is based on a combination of R-Trees and signature files ...a search engine that is able to efficiently support novel forms of spatial queries that are integrated with keyword ...keyword-augmented ...

11

Survey of Efficient and Fast Nearest Neighbor Search  For Spatial Query on Multidimensional Data

Survey of Efficient and Fast Nearest Neighbor Search For Spatial Query on Multidimensional Data

... the nearest neighbor for minimizing both travel cost and ...researchers, based on such criteria as similarity, closeness of relationship, distance, etc, have introduced a technique called ...

10

Fast Nearest Neighbor Search With Keywords

Fast Nearest Neighbor Search With Keywords

... keyword-augmented nearest neighbor search in time that is at the order of dozens of ...is based on the conventional technology of inverted index, it is readily incorporable in a commercial ...

7

Quick Search of the Nearest Neighbor with Words

Quick Search of the Nearest Neighbor with Words

... range search and nearest neighbor retrieval, involve only conditions on objects’ geometric ...a nearest neighbor query would instead ask for the restaurant that is the closest among ...

5

k-Expected Nearest Neighbor Search over Gaussian Objects

k-Expected Nearest Neighbor Search over Gaussian Objects

... Based on the above analyses, we conclude that PLUB achieves the best performance in efficiency because it uses both lower bound and upper bound for filtering. AVG is a better choice than PLB when k is larger than ...

11

Retrieving Datasets with Nearest Neighbor Search using Spatial Queries

Retrieving Datasets with Nearest Neighbor Search using Spatial Queries

... The above result takes the heavy toll on the efficiency of all the IR2-tree. For ease, let we first guess that the query keyword set Wq had only the single keyword w (i.e., |Wq| = 1). Without loss of generality, let p be ...

6

Show all 10000 documents...

Related subjects