Sciweavers

550 search results - page 12 / 110
» A general magnitude-preserving boosting algorithm for search...
Sort
View
148
Voted
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
15 years 1 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
SIGIR
2010
ACM
15 years 4 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...
123
Voted
AIRWEB
2007
Springer
15 years 6 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
AH
2004
Springer
15 years 5 months ago
Using SiteRank for Decentralized Computation of Web Document Ranking
Abstract. The PageRank algorithm demonstrates the significance of the computation of document ranking of general importance or authority in Web information retrieval. However, doi...
Jie Wu, Karl Aberer
96
Voted
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
16 years 23 days ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims