Sciweavers

1676 search results - page 303 / 336
» Query Recommendation for Improving Search Engine Results
Sort
View
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
15 years 8 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
SDM
2004
SIAM
174views Data Mining» more  SDM 2004»
15 years 3 months ago
Classifying Documents Without Labels
Automatic classification of documents is an important area of research with many applications in the fields of document searching, forensics and others. Methods to perform classif...
Daniel Barbará, Carlotta Domeniconi, Ning K...
WWW
2011
ACM
14 years 8 months ago
Learning to rank with multiple objective functions
We investigate the problem of learning to rank for document retrieval from the perspective of learning with multiple objective functions. We present solutions to two open problems...
Krysta Marie Svore, Maksims Volkovs, Christopher J...
JCDL
2010
ACM
187views Education» more  JCDL 2010»
15 years 3 months ago
Social network document ranking
In search engines, ranking algorithms measure the importance and relevance of documents mainly based on the contents and relationships between documents. User attributes are usual...
Liang Gou, Xiaolong Zhang, Hung-Hsuan Chen, Jung-H...
CSC
2008
15 years 3 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger