skip to main content
10.1145/342009.335423acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
Article
Free Access

A framework for expressing and combining preferences

Published:16 May 2000Publication History

ABSTRACT

The advent of the World Wide Web has created an explosion in the available on-line information. As the range of potential choices expand, the time and effort required to sort through them also expands. We propose a formal framework for expressing and combining user preferences to address this problem. Preferences can be used to focus search queries and to order the search results. A preference is expressed by the user for an entity which is described by a set of named fields; each field can take on values from a certain type. The * symbol may be used to match any element of that type. A set of preferences can be combined using a generic combine operator which is instantiated with a value function, thus providing a great deal of flexibility. Same preferences can be combined in more than one way and a combination of preferences yields another preference thus providing the closure property. We demonstrate the power of our framework by illustrating how a currently popular personalization system and a real-life application can be realized as special cases of our framework. We also discuss implementation of the framework in a relational setting.

References

  1. Arr50.K.J. Arrow. A difficulty in the concept of socisl welfare. J. of Political Economy, 58:328-346, 1950.Google ScholarGoogle ScholarCross RefCross Ref
  2. BP96.John M. Berrie and David E. Presti. The word wide web as an instructional tool. Science, 274:371-372, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  3. EHJ+96.O. Etzioni, S. Hanks, T. Jisng, R.M. Karp, O. Madani, and O. Waarts. Efficient information gathering on the internet. In 37th Annual Syrup. Foundations of Computer Science, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Fag98.Ronald Fagin. Fuzzy queries in multimedia d#t#b#se systems. In 17th A CM Syrup. Principles of Database Systems, June 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. FISS98.Yoav Freund, Raj Iyer, Robert E. Schapire, and Yoram Singer. An efficient boosting algorithm for combining preferences. In Machine Learning: 15th Int. Con/, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. HS99.John Hegel and Marc Singer. Net Worth. Harvard Business School Press, 1999.Google ScholarGoogle Scholar
  7. LG99.Steve Lawrence and C. Lee Giles. Accessibility of information on the web. Nature, 400:107-109, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  8. RV97.P. Resnick and H. Varian. Recommender systems. Communications of the A CM, 40(3), 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. SM83.G. Salton and M. McGill. Introduction to Modern information Retrieval. McGraw- Hill, New York, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A framework for expressing and combining preferences

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data
            May 2000
            604 pages
            ISBN:1581132174
            DOI:10.1145/342009

            Copyright © 2000 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 16 May 2000

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            SIGMOD '00 Paper Acceptance Rate42of248submissions,17%Overall Acceptance Rate785of4,003submissions,20%

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader