Sciweavers

43 search results - page 7 / 9
» Affinity rank: a new scheme for efficient web search
Sort
View
CIKM
2007
Springer
13 years 12 months ago
Effective top-k computation in retrieving structured documents with term-proximity support
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen
IRI
2007
IEEE
14 years 2 days ago
BESearch: A Supervised Learning Approach to Search for Molecular Event Participants
Biomedical researchers rely on keyword-based search engines to retrieve superficially relevant documents, from which they must filter out irrelevant information manually. Hence, t...
Richard Tzong-Han Tsai, Hong-Jie Dai, Hsi-Chuan Hu...
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 15 days ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
SIGIR
2012
ACM
11 years 8 months ago
Fighting against web spam: a novel propagation method based on click-through data
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...
Chao Wei, Yiqun Liu, Min Zhang, Shaoping Ma, Liyun...
SIGIR
2008
ACM
13 years 5 months ago
A new probabilistic retrieval model based on the dirichlet compound multinomial distribution
The classical probabilistic models attempt to capture the Ad hoc information retrieval problem within a rigorous probabilistic framework. It has long been recognized that the prim...
Zuobing Xu, Ram Akella