Re-ranking Google search returned web documents using document classification scores

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Re-ranking Documents Based on Query-Independent Document Specificity

The use of query-independent knowledge to improve the ranking of documents in information retrieval has proven very effective in the context of web search. This query-independent knowledge is derived from an analysis of the graph structure of hypertext links between documents. However, there are many cases where explicit hypertext links are absent or sparse, e.g. corporate Intranets. Previous w...

متن کامل

Improving Web Image Search Re-Ranking Using Hybrid Approach

The explosive growth and widespread accessibility of community contributed media content on the Internet have led to a surge of research activity in image search. Approaches that apply text search techniques for image search have achieved limited success as they entirely ignore visual content as a ranking signal. We propose an adaptive visual similarity to re-rank the text based search results....

متن کامل

Document ranking using web evidence

Evidence based on web graph structure is reportedly used by the current generation of World-Wide Web (WWW) search engines to identify “high-quality”, “important” pages and to reject “spam” content. However, despite the apparent wide use of this evidence its application in web-based document retrieval is controversial. Confusion exists as to how to incorporate web evidence in document ranking, a...

متن کامل

Latent Document Re-Ranking

The problem of re-ranking initial retrieval results exploring the intrinsic structure of documents is widely researched in information retrieval (IR) and has attracted a considerable amount of time and study. However, one of the drawbacks is that those algorithms treat queries and documents separately. Furthermore, most of the approaches are predominantly built upon graph-based methods, which m...

متن کامل

Context based Re-ranking of Web Documents (CReWD)

In this paper, we introduce CReWD, a machine learning system for Context Based Re-ranking of Web Documents. CReWD tackles personalization by considering both the short-term and long-term history of a user when personalizing URLs to them. CReWD proposes metrics that could be used as features for re-ranking search results by future IR systems as well as systems that do rule-based re-ranking. CReW...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence Research

سال: 2016

ISSN: 1927-6982,1927-6974

DOI: 10.5430/air.v6n1p59