An Efficient Boosting Algorithm for Combining Preferences

DMCA

An Efficient Boosting Algorithm for Combining Preferences (1999)

Cached

Download Links

by Raj Dharmarajan Iyer , Jr.

Citations:

702 - 18 self

BibTeX

@MISC{Iyer99anefficient,
    author = {Raj Dharmarajan Iyer and Jr.},
    title = {An Efficient Boosting Algorithm for Combining Preferences},
    year = {1999}
}

OpenURL

Abstract

The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting algorithm for combining preferences called RankBoost. We also describe an efficient implementation of the algorithm for certain natural cases. We discuss two experiments we carried out to assess the performance of RankBoost. In the first experiment, we used the algorithm to combine different WWW search strategies, each of which is a query expansion for a given domain. For this task, we compare the performance of RankBoost to the individual search strategies. The second experiment is a collaborative-filtering task for making movie recommendations. Here, we present results comparing RankBoost to nearest-neighbor and regression algorithms.

Keyphrases

combining preference efficient boosting algorithm multiple preference different search engine second experiment several application efficient implementation efficient algorithm collaborative-filtering task first experiment regression algorithm certain natural case different www search strategy movie recommendation new boosting algorithm individual search strategy query expansion formal framework present result

DMCA