• Login
    View Item 
    •   SMARTech Home
    • Undergraduate Research Opportunities Program (UROP)
    • Undergraduate Research Option Theses
    • View Item
    •   SMARTech Home
    • Undergraduate Research Opportunities Program (UROP)
    • Undergraduate Research Option Theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Localizing Embeddings for Recommendation Systems using Binary Pairwise Comparisons

    Thumbnail
    View/Open
    OSHAUGHNESSY-UNDERGRADUATERESEARCHOPTIONTHESIS-2016.pdf (3.917Mb)
    Date
    2016-07-18
    Author
    Oshaughnessy, Matthew R.
    Metadata
    Show full item record
    Abstract
    Recommendation systems predict the preferences of users (who may be, for example, customers of an online shopping website or moviegoers), to various items (for example, consumer products or movies). One way this information is modeled is the ideal point model of preference, in which items and users live in an n-dimensional Euclidean space where each dimension represents an attribute and a small distance between an item and user indicates the user has a preference for that item. We seek to determine an embedding of many items and users given only binary pairwise comparisons of the form "user x prefers item q_i to item q_j." First, we present an optimization-based framework for localizing new items and users given an existing embedding. We demonstrate that user localization can be formulated as a simple constrained quadratic program. Further, we show that although item localization produces a quadratically-constrained quadratic program which is difficult to solve, we can make the problem more computationally tractable by strategically combining comparisons to make the quadratic constraints into linear constraints. Finally, we show that by iteratively applying this localization method to every item and user, we can recover an embedding that agrees with almost every comparison, allowing us to iteratively improve the accuracy of a noisy embedding or even create an embedding using no a priori knowledge apart from the list of pairwise comparisons. Throughout, we present implementation details and optimization algorithms which make the recommendation system computationally efficient even with large datasets and dimensionalities.
    URI
    http://hdl.handle.net/1853/55393
    Collections
    • Undergraduate Research Option Theses [631]
    • School of Electrical and Computer Engineering Undergraduate Research Option Theses [22]

    Browse

    All of SMARTechCommunities & CollectionsDatesAuthorsTitlesSubjectsTypesThis CollectionDatesAuthorsTitlesSubjectsTypes

    My SMARTech

    Login

    Statistics

    View Usage StatisticsView Google Analytics Statistics
    • About
    • Terms of Use
    • Contact Us
    • Emergency Information
    • Legal & Privacy Information
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    • Login
    Georgia Tech

    © Georgia Institute of Technology

    • About
    • Terms of Use
    • Contact Us
    • Emergency Information
    • Legal & Privacy Information
    • Accessibility
    • Accountability
    • Accreditation
    • Employment
    • Login
    Georgia Tech

    © Georgia Institute of Technology