Sciweavers

144 search results - page 10 / 29
» Query dependent ranking using K-nearest neighbor
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Spam filtering with several novel bayesian classifiers
In this paper, we report our work on spam filtering with three novel bayesian classification methods: Aggregating One-Dependence Estimators (AODE), Hidden Naïve Bayes (HNB), Loca...
Chuanliang Chen, Yingjie Tian, Chunhua Zhang
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 9 months ago
SpaceTwist: Managing the Trade-Offs Among Location Privacy, Query Performance, and Query Accuracy in Mobile Services
In a mobile service scenario, users query a server for nearby points of interest but they may not want to disclose their locations to the service. Intuitively, location privacy may...
Man Lung Yiu, Christian S. Jensen, Xuegang Huang, ...
EDBT
2008
ACM
99views Database» more  EDBT 2008»
14 years 7 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 7 months ago
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
Nir Ailon
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...