A generic ranking function discovery framework by genetic programming for information retrieval

نویسندگان

  • Weiguo Fan
  • Michael D. Gordon
  • Praveen Pathak
چکیده

Ranking functions play a substantial role in the performance of information retrieval (IR) systems and search engines. Although there are many ranking functions available in the IR literature, various empirical evaluation studies show that ranking functions do not perform consistently well across different contexts (queries, collections, users). Moreover, it is often difficult and very expensive for human beings to design optimal ranking functions that work well in all these contexts. In this paper, we propose a novel ranking function discovery framework based on Genetic Programming and show through various experiments how this new framework helps automate the ranking function design/discovery process. 2003 Published by Elsevier Ltd.

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

ثبت نام

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

منابع مشابه

Ranking Function Discovery by Genetic Programming for Robust Retrieval

Ranking functions are instrumental for the success of an information retrieval (search engine) system. However nearly all existing ranking functions are manually designed based on experience, observations and probabilistic theories. This paper tested a novel ranking function discovery technique proposed in [Fan 2003a, Fan2003b] – ARRANGER (Automatic geneRation of RANking functions by GEnetic pR...

متن کامل

Discovering Ranking Functions for Information Retrieval

The field of information retrieval deals with finding relevant documents from a large document collection or the World Wide Web in response to a user’s query seeking relevant information. Ranking functions play a very important role in the retrieval performance of such retrieval systems and search engines. A single ranking function does not perform well across different user queries, and docume...

متن کامل

Nonlinear ranking function representations in genetic programming-based ranking discovery for personalized search

Ranking function is instrumental in affecting the performance of a search engine. Designing and optimizing a search engine’s ranking function remains a daunting task for computer and information scientists. Recently, genetic programming (GP), a machine learning technique based on evolutionary theory, has shown promise in tackling this very difficult problem. Ranking functions discovered by GP h...

متن کامل

The effects of fitness functions on genetic programming-based ranking discovery forWeb search

Genetic-based evolutionary learning algorithms, such as genetic algorithms (GAs) and genetic programming (GP), have been applied to information retrieval (IR) since the 1980s. Recently, GP has been applied to a new IR task — discovery of ranking functions for web search — and has achieved very promising ∗Corresponding author. Email: [email protected]. Tel: (540) 231-6588. Fax: (540) 231-2511. Mailing...

متن کامل

An immune programming-based ranking function discovery approach for effective information retrieval

In this paper, we propose RankIP, the first immune programming (IP) based ranking function discovery approach. IP is a novel evolution based machine learning algorithm with the principles of immune systems, which is verified to be superior to Genetic Programming (GP) on the convergence of algorithm according to their experimental results in Musilek et al. (2006). However, such superiority of IP...

متن کامل

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


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

عنوان ژورنال:
  • Inf. Process. Manage.

دوره 40  شماره 

صفحات  -

تاریخ انتشار 2004