Sciweavers

228 search results - page 19 / 46
» Probabilistic models for personalizing web search
Sort
View
PKDD
2009
Springer
149views Data Mining» more  PKDD 2009»
14 years 2 months ago
Learning to Disambiguate Search Queries from Short Sessions
Web searches tend to be short and ambiguous. It is therefore not surprising that Web query disambiguation is an actively researched topic. To provide a personalized experience for ...
Lilyana Mihalkova, Raymond J. Mooney
WWW
2003
ACM
14 years 27 days ago
The Web of People: A dual view on the WWW
In this paper, we describe an alternative web paradigm, called the Web of People. Rather than a web of pages, it is a web of persons. The paradigm is motivated by a number of obvi...
Michel Plu, Pascal Bellec, Layda Agosto, Walter Va...
WWW
2002
ACM
14 years 8 months ago
Probabilistic query expansion using query logs
Query expansion has long been suggested as an effective way to resolve the short query and word mismatching problems. A number of query expansion methods have been proposed in tra...
Hang Cui, Ji-Rong Wen, Jian-Yun Nie, Wei-Ying Ma
SIGIR
2010
ACM
13 years 11 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...
WSDM
2010
ACM
322views Data Mining» more  WSDM 2010»
14 years 5 months ago
Inferring Search Behaviors Using Partially Observable Markov (POM) Model
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
Kuansan Wang, Nikolas Gloy, Xiaolong Li