Sciweavers

121 search results - page 8 / 25
» Anytime K-Nearest Neighbor Search for Database Applications
Sort
View
SAC
2004
ACM
14 years 2 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo
ISCI
2007
141views more  ISCI 2007»
13 years 8 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
CIKM
2010
Springer
13 years 3 months ago
Modeling betweenness for question answering
The gap between the user's information need and query is expanding due to the pervasiveness of Web search. Multimedia question answering is restricted by disjoint infrastruct...
Brandeis Marshall
MDM
2010
Springer
281views Communications» more  MDM 2010»
13 years 10 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...
SSD
2009
Springer
233views Database» more  SSD 2009»
14 years 3 months ago
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
Chi-Yin Chow, Mohamed F. Mokbel, Joe Naps, Suman N...