An Efficient Boosting Algorithm for Combining Preferences
The problem of combining preferences arises in several applications, such as combining the results of di_x000B_erent search engines. This work describes an effcient algorithm for combining multiple preferences. We _x000C_rst give a formal framework for the problem. We then describe and analyze a new...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149914 |