{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/97794"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/97794","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Collaborative ranking from ordinal data","abstract":"Personalized recommendation systems have to predict preferences of a user for items that have not seen by the user. For cardinal (ratings) data, personalized preference prediction has been efficiently solved over the past few years using matrix factorization related techniques. Recent studies have shown that ordinal (comparison) data can outperform cardinal data in learning preferences, but there has not been much study on learning personalized preferences from ordinal data. This thesis presents a matrix factorization inspired, convex relaxation algorithm to collaboratively learn hidden preferences of users through the multinomial logit (MNL) model, a discrete choice model. It also shows that the algorithm is efficient in terms of the number of observations needed.","abstract_html":"Personalized recommendation systems have to predict preferences of a user for items that have not seen by the user. For cardinal (ratings) data, personalized preference prediction has been efficiently solved over the past few years using matrix factorization related techniques. Recent studies have shown that ordinal (comparison) data can outperform cardinal data in learning preferences, but there has not been much study on learning personalized preferences from ordinal data. This thesis presents a matrix factorization inspired, convex relaxation algorithm to collaboratively learn hidden preferences of users through the multinomial logit (MNL) model, a discrete choice model. It also shows that the algorithm is efficient in terms of the number of observations needed.","abstract_has_math":false,"creators":["Thekumparampil, Kiran Koshy"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Oh, Sewoong"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017-08-10T20:33:28Z","date_published":"2017-08-10T20:33:28Z","updated_at":"2026-07-22T22:24:34Z","subjects":["Collaborative ranking","Recommendation system","Revenue management","Ordinal (comparison) data","Multinomial logit (MNL) model","Convex relaxation","Nuclear norm minimization"],"languages":["en"],"rights":["Copyright 2017 Kiran Koshy Thekumparampil"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/97794","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Oh, Sewoong"]},{"key":"dc:creator","label":"Author","values":["Thekumparampil, Kiran Koshy"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017-08-10T20:33:28Z","2019-08-11T09:15:35Z","2017-04-27","2017-05"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Collaborative ranking","Recommendation system","Revenue management","Ordinal (comparison) data","Multinomial logit (MNL) model","Convex relaxation","Nuclear norm minimization"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2017 Kiran Koshy Thekumparampil"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/97794"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Personalized recommendation systems have to predict preferences of a user for items that have not seen by the user. For cardinal (ratings) data, personalized preference prediction has been efficiently solved over the past few years using matrix factorization related techniques. Recent studies have shown that ordinal (comparison) data can outperform cardinal data in learning preferences, but there has not been much study on learning personalized preferences from ordinal data. This thesis presents a matrix factorization inspired, convex relaxation algorithm to collaboratively learn hidden preferences of users through the multinomial logit (MNL) model, a discrete choice model. It also shows that the algorithm is efficient in terms of the number of observations needed.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2019-05-01","The student, Kiran Thekumparampil, accepted the attached license on 2017-04-26 at 15:00.","The student, Kiran Thekumparampil, submitted this Thesis for approval on 2017-04-26 at 15:01.","This Thesis was approved for publication on 2017-04-27 at 16:33.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11092 on 2017-08-10 at 15:07:11","Made available in DSpace on 2017-08-10T20:33:28Z (GMT). No. of bitstreams: 2 THEKUMPARAMPIL-THESIS-2017.pdf: 795009 bytes, checksum: 601388ce7d30942f5f8da9bcd86da6c0 (MD5) LICENSE.txt: 4217 bytes, checksum: c0a13a9a686f185c3ebdc7c3307af95e (MD5) Previous issue date: 2017-04-27","Embargo set by: Colleen Fallaw for item 102847 Lift date: 2019-08-10T21:27:21Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 102847 on 2019-08-11T09:15:35Z."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Collaborative ranking from ordinal data"]}]}],"canonical_facts":{"dc:contributor":["Oh, Sewoong"],"dc:creator":["Thekumparampil, Kiran Koshy"],"dc:date":["2017-08-10T20:33:28Z","2019-08-11T09:15:35Z","2017-04-27","2017-05"],"dc:description":["Personalized recommendation systems have to predict preferences of a user for items that have not seen by the user. For cardinal (ratings) data, personalized preference prediction has been efficiently solved over the past few years using matrix factorization related techniques. Recent studies have shown that ordinal (comparison) data can outperform cardinal data in learning preferences, but there has not been much study on learning personalized preferences from ordinal data. This thesis presents a matrix factorization inspired, convex relaxation algorithm to collaboratively learn hidden preferences of users through the multinomial logit (MNL) model, a discrete choice model. It also shows that the algorithm is efficient in terms of the number of observations needed.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2019-05-01","The student, Kiran Thekumparampil, accepted the attached license on 2017-04-26 at 15:00.","The student, Kiran Thekumparampil, submitted this Thesis for approval on 2017-04-26 at 15:01.","This Thesis was approved for publication on 2017-04-27 at 16:33.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11092 on 2017-08-10 at 15:07:11","Made available in DSpace on 2017-08-10T20:33:28Z (GMT). No. of bitstreams: 2 THEKUMPARAMPIL-THESIS-2017.pdf: 795009 bytes, checksum: 601388ce7d30942f5f8da9bcd86da6c0 (MD5) LICENSE.txt: 4217 bytes, checksum: c0a13a9a686f185c3ebdc7c3307af95e (MD5) Previous issue date: 2017-04-27","Embargo set by: Colleen Fallaw for item 102847 Lift date: 2019-08-10T21:27:21Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 102847 on 2019-08-11T09:15:35Z."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/97794"],"dc:language":["en"],"dc:rights":["Copyright 2017 Kiran Koshy Thekumparampil"],"dc:subject":["Collaborative ranking","Recommendation system","Revenue management","Ordinal (comparison) data","Multinomial logit (MNL) model","Convex relaxation","Nuclear norm minimization"],"dc:title":["Collaborative ranking from ordinal data"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:34Z"}