Sciweavers

386 search results - page 52 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Analyzing and evaluating query reformulation strategies in web search logs
Users frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research h...
Jeff Huang, Efthimis N. Efthimiadis
CIKM
2005
Springer
14 years 2 months ago
Concept-based interactive query expansion
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
Bruno M. Fonseca, Paulo Braz Golgher, Bruno P&ocir...
EDBT
2006
ACM
129views Database» more  EDBT 2006»
14 years 9 months ago
Efficient Quantile Retrieval on Multi-dimensional Data
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
Man Lung Yiu, Nikos Mamoulis, Yufei Tao
BMCBI
2007
146views more  BMCBI 2007»
13 years 9 months ago
PubMed related articles: a probabilistic topic-based model for content similarity
Background: We present a probabilistic topic-based model for content similarity called pmra that underlies the related article search feature in PubMed. Whether or not a document ...
Jimmy J. Lin, W. John Wilbur
ICDE
2009
IEEE
118views Database» more  ICDE 2009»
14 years 3 months ago
An Incremental Threshold Method for Continuous Text Search Queries
Abstract—A text filtering system monitors a stream of incoming documents, to identify those that match the interest profiles of its users. The user interests are registered at ...
Kyriakos Mouratidis, HweeHwa Pang