A database framework for probabilistic preferences

Batya Kenig, Benny Kimelfeld, Haoyue Ping, Julia Stoyanovich

    Research output: Contribution to journalConference article

    Abstract

    Preferences are statements about the relative quality or desirability of items. Ever larger amounts of preference information are being collected and analyzed in a variety of domains, including recommendation systems [2, 16, 18], polling and election analysis [3, 6, 7, 15], and bioinformatics [1, 11, 19]. Preferences are often inferred from indirect input (e.g., a ranked list may be inferred from individual choices), and are therefore uncertain in nature. This motivates a rich body of work on uncertain preference models in the statistics literature [14]. More recently, the machine learning community has been developing methods for effective modeling and efficient inference over preferences, with the Mallows model [13] receiving particular attention [4, 5, 12, 17]. In this paper, we take the position that preference modeling and analysis should be accommodated within a general-purpose probabilistic database frame- work. Our framework is based on a deterministic concept that we proposed in a past vision paper [8]. In the present work we focus on handing uncertain preferences, and develop a representation of preferences within a probabilistic preference database, or PPD for short. This paper is an abbreviated version of our PODS 2017 paper, where an interested reader can find additional details about the formalism and proposed algorithmic solutions.

    Original languageEnglish (US)
    JournalCEUR Workshop Proceedings
    Volume1912
    StatePublished - Jan 1 2017
    Event11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, AMW 2017 - Montevideo, Uruguay
    Duration: Jun 7 2017Jun 9 2017

    Fingerprint

    Recommender systems
    Bioinformatics
    Learning systems
    Statistics

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Kenig, B., Kimelfeld, B., Ping, H., & Stoyanovich, J. (2017). A database framework for probabilistic preferences. CEUR Workshop Proceedings, 1912.

    A database framework for probabilistic preferences. / Kenig, Batya; Kimelfeld, Benny; Ping, Haoyue; Stoyanovich, Julia.

    In: CEUR Workshop Proceedings, Vol. 1912, 01.01.2017.

    Research output: Contribution to journalConference article

    Kenig, B, Kimelfeld, B, Ping, H & Stoyanovich, J 2017, 'A database framework for probabilistic preferences', CEUR Workshop Proceedings, vol. 1912.
    Kenig B, Kimelfeld B, Ping H, Stoyanovich J. A database framework for probabilistic preferences. CEUR Workshop Proceedings. 2017 Jan 1;1912.
    Kenig, Batya ; Kimelfeld, Benny ; Ping, Haoyue ; Stoyanovich, Julia. / A database framework for probabilistic preferences. In: CEUR Workshop Proceedings. 2017 ; Vol. 1912.
    @article{626dd148e6bf40d2a021aa0b29d3af10,
    title = "A database framework for probabilistic preferences",
    abstract = "Preferences are statements about the relative quality or desirability of items. Ever larger amounts of preference information are being collected and analyzed in a variety of domains, including recommendation systems [2, 16, 18], polling and election analysis [3, 6, 7, 15], and bioinformatics [1, 11, 19]. Preferences are often inferred from indirect input (e.g., a ranked list may be inferred from individual choices), and are therefore uncertain in nature. This motivates a rich body of work on uncertain preference models in the statistics literature [14]. More recently, the machine learning community has been developing methods for effective modeling and efficient inference over preferences, with the Mallows model [13] receiving particular attention [4, 5, 12, 17]. In this paper, we take the position that preference modeling and analysis should be accommodated within a general-purpose probabilistic database frame- work. Our framework is based on a deterministic concept that we proposed in a past vision paper [8]. In the present work we focus on handing uncertain preferences, and develop a representation of preferences within a probabilistic preference database, or PPD for short. This paper is an abbreviated version of our PODS 2017 paper, where an interested reader can find additional details about the formalism and proposed algorithmic solutions.",
    author = "Batya Kenig and Benny Kimelfeld and Haoyue Ping and Julia Stoyanovich",
    year = "2017",
    month = "1",
    day = "1",
    language = "English (US)",
    volume = "1912",
    journal = "CEUR Workshop Proceedings",
    issn = "1613-0073",
    publisher = "CEUR-WS",

    }

    TY - JOUR

    T1 - A database framework for probabilistic preferences

    AU - Kenig, Batya

    AU - Kimelfeld, Benny

    AU - Ping, Haoyue

    AU - Stoyanovich, Julia

    PY - 2017/1/1

    Y1 - 2017/1/1

    N2 - Preferences are statements about the relative quality or desirability of items. Ever larger amounts of preference information are being collected and analyzed in a variety of domains, including recommendation systems [2, 16, 18], polling and election analysis [3, 6, 7, 15], and bioinformatics [1, 11, 19]. Preferences are often inferred from indirect input (e.g., a ranked list may be inferred from individual choices), and are therefore uncertain in nature. This motivates a rich body of work on uncertain preference models in the statistics literature [14]. More recently, the machine learning community has been developing methods for effective modeling and efficient inference over preferences, with the Mallows model [13] receiving particular attention [4, 5, 12, 17]. In this paper, we take the position that preference modeling and analysis should be accommodated within a general-purpose probabilistic database frame- work. Our framework is based on a deterministic concept that we proposed in a past vision paper [8]. In the present work we focus on handing uncertain preferences, and develop a representation of preferences within a probabilistic preference database, or PPD for short. This paper is an abbreviated version of our PODS 2017 paper, where an interested reader can find additional details about the formalism and proposed algorithmic solutions.

    AB - Preferences are statements about the relative quality or desirability of items. Ever larger amounts of preference information are being collected and analyzed in a variety of domains, including recommendation systems [2, 16, 18], polling and election analysis [3, 6, 7, 15], and bioinformatics [1, 11, 19]. Preferences are often inferred from indirect input (e.g., a ranked list may be inferred from individual choices), and are therefore uncertain in nature. This motivates a rich body of work on uncertain preference models in the statistics literature [14]. More recently, the machine learning community has been developing methods for effective modeling and efficient inference over preferences, with the Mallows model [13] receiving particular attention [4, 5, 12, 17]. In this paper, we take the position that preference modeling and analysis should be accommodated within a general-purpose probabilistic database frame- work. Our framework is based on a deterministic concept that we proposed in a past vision paper [8]. In the present work we focus on handing uncertain preferences, and develop a representation of preferences within a probabilistic preference database, or PPD for short. This paper is an abbreviated version of our PODS 2017 paper, where an interested reader can find additional details about the formalism and proposed algorithmic solutions.

    UR - http://www.scopus.com/inward/record.url?scp=85029209305&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85029209305&partnerID=8YFLogxK

    M3 - Conference article

    AN - SCOPUS:85029209305

    VL - 1912

    JO - CEUR Workshop Proceedings

    JF - CEUR Workshop Proceedings

    SN - 1613-0073

    ER -