Title:
Localizing Embeddings for Recommendation Systems using Binary Pairwise Comparisons
Localizing Embeddings for Recommendation Systems using Binary Pairwise Comparisons
| dc.contributor.advisor | Davenport, Mark A. | |
| dc.contributor.author | Oshaughnessy, Matthew R. | |
| dc.contributor.committeeMember | Romberg, Justin K. | |
| dc.contributor.department | Electrical and Computer Engineering | |
| dc.date.accessioned | 2016-07-18T17:05:27Z | |
| dc.date.available | 2016-07-18T17:05:27Z | |
| dc.date.created | 2016-05 | |
| dc.date.issued | 2016-07-18 | |
| dc.date.submitted | May 2016 | |
| dc.date.updated | 2016-07-18T17:05:27Z | |
| dc.description.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. | |
| dc.description.degree | Undergraduate | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/55393 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | |
| dc.subject | Localization | |
| dc.subject | Paired comparisons | |
| dc.subject | Recommendation systems | |
| dc.subject | Optimization | |
| dc.title | Localizing Embeddings for Recommendation Systems using Binary Pairwise Comparisons | |
| dc.type | Text | |
| dc.type.genre | Undergraduate Thesis | |
| dspace.entity.type | Publication | |
| local.contributor.advisor | Davenport, Mark A. | |
| local.contributor.corporatename | School of Electrical and Computer Engineering | |
| local.contributor.corporatename | College of Engineering | |
| local.contributor.corporatename | Undergraduate Research Opportunities Program | |
| local.relation.ispartofseries | Undergraduate Research Option Theses | |
| relation.isAdvisorOfPublication | 1162b098-768c-4269-839c-db771101c01b | |
| relation.isOrgUnitOfPublication | 5b7adef2-447c-4270-b9fc-846bd76f80f2 | |
| relation.isOrgUnitOfPublication | 7c022d60-21d5-497c-b552-95e489a06569 | |
| relation.isOrgUnitOfPublication | 0db885f5-939b-4de1-807b-f2ec73714200 | |
| relation.isSeriesOfPublication | e1a827bd-cf25-4b83-ba24-70848b7036ac | |
| thesis.degree.level | Undergraduate |