A context-based personalized ratings management system

In an online community of any size, every user garners reputations for different contexts through interactions with other users. When any user in the online community is interested in a certain context, the user would value the opinions of those users of high repute with respect to that context. However, if the online community is of any significant size, a user might not know every other user in the community. Therefore, a reputation brokering mechanism needs to be incorporated so that an interested user would be able to trace paths through other users to the reputable users. From social network theories, there exist centrality measures that can be used to determine the reputation of users in a network based on the number of in-degrees and out-degrees. However, different users in the network can have varying tastes and opinions with respect to a given context. Since centrality measures determine the reputation of users based on aggregate opinion, a user who has different tastes from the majority of the other users might not agree with the reputable users selected by the centrality measures. This justifies the need for developing personalized rating systems that are able to personalize for any user a selection of other users that he would regard as highly reputable. In this thesis, two such rating systems are developed and compared against the existing centrality measures. When tested over various dimensions such as network size and network connectivity, there is evidence that the personalized rating systems perform better than the traditional measures of reputation in the selection of reputable individuals.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2001

Author dc:creator

• Ang, Cheewee, 1978-

Advisor dc:contributor.advisor

• Peter Szolovits.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/8939

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/8939