Institutional Repository

Serendipity-aware noise detection for recommender systems

Show simple item record

dc.contributor.author El Khoury Badran, Miriam
dc.date.accessioned 2019-07-18T10:09:05Z
dc.date.available 2019-07-18T10:09:05Z
dc.date.issued 2019-05
dc.identifier.citation El Khoury Badran, M. (2019). Serendipity-aware noise detection for recommender systems (Master's thesis, Notre Dame University-Louaize, Zouk Mosbeh, Lebanon). Retrieved from http://ir.ndu.edu.lb/123456789/1020
dc.identifier.uri http://ir.ndu.edu.lb/123456789/1020
dc.description "A thesis submitted in partial fulfillment of the requirements for the Master of Science in Computer Science"; M.S. -- Faculty of Natural and Applied Sciences, Department of Computer Science, Notre Dame University, Louaize, 2019; Includes bibliographical references (leaves 56-59).
dc.description.abstract With the rise of the Internet, recommender systems are becoming a used solution to solve the information overload problem. These systems are like any other system, subject to noise: malicious noise that is caused by attacks and natural noise that is due to the human error. Many detection algorithms solve the noise problem. However, since natural noise and serendipity overlap in their definition, removing noise results in removing serendipity. Serendipity that is the happy surprise of finding something relevant unexpectedly is important for the issue of over personalization caused by the recommender system. Looking at it, this seems a cycle. The aim of this study is to solve the over personalization problem without damaging the user’s trust to the system. Multiple objectives are targeted to attain this aim. This work shows that existing datasets mirroring the user ratings and interactions contain noise and serendipity. Since the desired result is to protect user’s trust without leaving him/her in an echo room or filter bubble, the system needs to eliminate noise without affecting serendipity. A serendipity-aware noise detection algorithm is designed to differentiate between noise and serendipity. To measure the success of the proposed algorithm, a new metric is used: Top-N modified. en_US
dc.format.extent viii, 59 leaves ; color illustrations
dc.language.iso en en_US
dc.publisher Notre Dame University-Louaize en_US
dc.rights Attribution-NonCommercial-NoDerivs 3.0 United States *
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/us/ *
dc.subject Noise control
dc.subject Intelligent sensors
dc.subject Serendipity
dc.title Serendipity-aware noise detection for recommender systems en_US
dc.type Thesis en_US
dc.rights.license This work is licensed under a Creative Commons Attribution-NonCommercial 3.0 United States License. (CC BY-NC 3.0 US)
dc.contributor.supervisor Maalouf, Hoda, Ph.D. en_US
dc.contributor.department Notre Dame University-Louaize. Department of Computer Science en_US


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States

Search DSpace


Advanced Search

Browse

My Account