Sciweavers

648 search results - page 53 / 130
» A general dimension for query learning
Sort
View
WWW
2008
ACM
14 years 9 months ago
Unsupervised query segmentation using generative language models and wikipedia
In this paper, we propose a novel unsupervised approach to query segmentation, an important task in Web search. We use a generative query model to recover a query's underlyin...
Bin Tan, Fuchun Peng
SIGIR
2011
ACM
12 years 11 months ago
Parameterized concept weighting in verbose queries
The majority of the current information retrieval models weight the query concepts (e.g., terms or phrases) in an unsupervised manner, based solely on the collection statistics. I...
Michael Bendersky, Donald Metzler, W. Bruce Croft
SIGMOD
1999
ACM
181views Database» more  SIGMOD 1999»
14 years 1 months ago
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
Jeffrey Scott Vitter, Min Wang
ICASSP
2010
IEEE
13 years 9 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
PRL
2006
180views more  PRL 2006»
13 years 8 months ago
MutualBoost learning for selecting Gabor features for face recognition
This paper describes an improved boosting algorithm, the MutualBoost algorithm, and its application in developing a fast and robust Gabor feature based face recognition system. Th...
LinLin Shen, Li Bai