Sciweavers

44651 search results - page 8889 / 8931
» A Generalization of the Least General Generalization
Sort
View
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
13 years 5 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...
WSDM
2012
ACM
207views Data Mining» more  WSDM 2012»
13 years 5 months ago
Sequence clustering and labeling for unsupervised query intent discovery
One popular form of semantic search observed in several modern search engines is to recognize query patterns that trigger instant answers or domain-specific search, producing sem...
Jackie Chi Kit Cheung, Xiao Li
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
13 years 5 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
13 years 5 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
WSDM
2012
ACM
243views Data Mining» more  WSDM 2012»
13 years 5 months ago
No search result left behind: branching behavior with browser tabs
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...
Jeff Huang, Thomas Lin, Ryen W. White
« Prev « First page 8889 / 8931 Last » Next »