Sciweavers

411 search results - page 46 / 83
» Temporal Ranking of Search Engine Results
Sort
View
COLT
2008
Springer
15 years 1 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
WWW
2007
ACM
16 years 15 days ago
Answering relationship queries on the web
Finding relationships between entities on the Web, e.g., the connections between different places or the commonalities of people, is a novel and challenging problem. Existing Web ...
Gang Luo, Chunqiang Tang, Ying-li Tian
VLDB
2004
ACM
95views Database» more  VLDB 2004»
15 years 5 months ago
Combating Web Spam with TrustRank
Web spam pages use various techniques to achieve higher-than-deserved rankings in a search engine’s results. While human experts can identify spam, it is too expensive to manual...
Zoltán Gyöngyi, Hector Garcia-Molina, ...
WWW
2002
ACM
16 years 15 days ago
Expert agreement and content based reranking in a meta search environment using Mearf
Recent increase in the number of search engines on the Web and the availability of meta search engines that can query multiple search engines makes it important to find effective ...
B. Uygar Oztekin, George Karypis, Vipin Kumar
WSDM
2010
ACM
236views Data Mining» more  WSDM 2010»
15 years 9 months ago
Personalized Click Prediction in Sponsored Search
Sponsored search is a multi-billion dollar business that generates most of the revenue for search engines. Predicting the probability that users click on ads is crucial to sponsor...
Erick Cantú-Paz, Haibin Cheng