• No results found

neighbor search

Nearest Neighbor Search with Anytime  Clustering Method

Nearest Neighbor Search with Anytime Clustering Method

... nearest neighbor or distance is obtained over these ...nearest neighbor search and cannot give the exact value of ...k-nearest neighbor (kNN), ...

6

A Deterministic K means Algorithm based on Nearest Neighbor Search

A Deterministic K means Algorithm based on Nearest Neighbor Search

... In data mining, the k-means algorithm is among the most commonly and widely used method for solving clustering problems because of its simplicity and performance. However, one of the main drawback of this algorithm is ...

5

Nearest Neighbor Search with Keywords in Spatial
Databases

Nearest Neighbor Search with Keywords in Spatial Databases

... R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles and polygons. R-tree might be to store spatial objects such ...

6

Retrieving Datasets with Nearest Neighbor Search using Spatial Queries

Retrieving Datasets with Nearest Neighbor Search using Spatial Queries

... Web Search Mechanism (AWSM) is established in order to improve the quality of various search services on the ...web search. We study privacy protection in web search applications that mainly ...

6

Nearest Neighbor Search with Keywords Using Spatial Inverted Index

Nearest Neighbor Search with Keywords Using Spatial Inverted Index

... Nearest neighbor queries that aims to find objects both a spatial predicate and predicate on their associated ...nearest neighbor query search restaurant that is the closest among many restaurants ...

7

k-Expected Nearest Neighbor Search over Gaussian Objects

k-Expected Nearest Neighbor Search over Gaussian Objects

... nearest neighbor search, which finds closest objects to a given query point, has extensive applications in various ...nearest neighbor search over traditional location information to ...

11

Analysis on Fast Nearest Neighbor Search with Keywords

Analysis on Fast Nearest Neighbor Search with Keywords

... nearest neighbor search. Nearest neighbor search (NNS), also identified as closeness search, parallel search is an optimization problem for finding closest points in metric ...

5

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 The aim is reducing runtime for nearest neighbor search algorithm using the technology of ...nearest neighbor Until the end of the ...nearest ...

5

Fast Nearest Neighbor Search With Keywords

Fast Nearest Neighbor Search With Keywords

... nearest neighbor lies quite faraway from the query point, while all the closer neighbors are missing at least one of the query ...keyword search in relational ...nearest neighbor search with ...

7

FAST NEAREST NEIGHBOR SEARCH WITH KEYWORDS

FAST NEAREST NEIGHBOR SEARCH WITH KEYWORDS

... a search engine that is able to efficiently support novel forms of spatial queries that are integrated with keyword ...nearest neighbor search in time that is at the order of dozens of ...commercial ...

11

Fast Nearest Neighbor Search with Keywords Using IR2-Tree

Fast Nearest Neighbor Search with Keywords Using IR2-Tree

... usual search engine indexing algorithms. A goal of a search engine presentation is optimize the speed of the ...Nearest neighbor search (NNS) ...

10

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

... nearest neighbor search approach with respect to a query point plays a key role in arriving at the final decision ...nearest neighbor search has been found several applications in searching ...

10

Fast neighbor search with keywords

Fast neighbor search with keywords

... Keyword-based search in text-rich multi-dimensional datasets facilitates many novel applications and tools. In this paper, we consider objects that are tagged with keywords and are embedded in a vector space. For ...

5

Hubless Nearest Neighbor Search for Bilingual Lexicon Induction

Hubless Nearest Neighbor Search for Bilingual Lexicon Induction

... This paper presents a new method for Bilingual Lexicon Induction (BLI), which we call Hub- less Nearest Neighbor (HNN). BLI is the task of creating a lexicon of translation equivalents such as, bank:banc or ...

9

Secure K-Nearest Neighbor Search By Keywords

Secure K-Nearest Neighbor Search By Keywords

... We concentrate on taking care of the characterization issue over encoded information. Specifically, we propose a safe k-NN classifier over scrambled information in the cloud. The proposed convention ensures the ...

6

Keyword Search for Quick Finding of Nearest Neighbor

Keyword Search for Quick Finding of Nearest Neighbor

... Nearest neighbor search is an optimization problem for obtaining most similar ...Nearest neighbor is an important and broadly studied problem in various fields, and it has broad range of ...

7

Sign-Full Random Projections

Sign-Full Random Projections

... near neighbor search, duplicate detec- tion, knn-classification, etc, the training data are first trans- formed via random projections and then only the signs of the projected data points are stored ...

8

Embedding the Ulam metric into ℓ1

Embedding the Ulam metric into ℓ1

... All our embeddings (e. g. the one specified above) are efficiently computable, and are thus readily applicable to computational problems. For instance, they immediately yield sketching algorithms and Nearest ...

18

Title: A Practical Approach to Faster Spatial Queries with Keywords

Title: A Practical Approach to Faster Spatial Queries with Keywords

... database search the similar data with multimedia databases requires support of near-neighbor to access high dimensional data for accessing of individual ...the neighbor node for the similar ...

8

Kunath, Peter
  

(2006):


	Efficient Analysis in Multimedia Databases.


Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik

Kunath, Peter (2006): Efficient Analysis in Multimedia Databases. Dissertation, LMU München: Fakultät für Mathematik, Informatik und Statistik

... nearest neighbor search can be categorized into two classes, the hypersphere- approaches and the ...nearest neighbor distance and, thus, actually store hyperspheres rather than ...the search ...

266

Show all 10000 documents...

Related subjects