Sciweavers

288 search results - page 30 / 58
» Document generality: its computation for ranking
Sort
View
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
16 years 26 days 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...
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
14 years 1 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
DEXA
2006
Springer
193views Database» more  DEXA 2006»
15 years 9 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 6 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
FCT
2005
Springer
15 years 11 months ago
Deterministic Automata on Unranked Trees
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
Julien Cristau, Christof Löding, Wolfgang Tho...