Search using social networks

In this thesis, we present an approach to the problem of personalized web search which makes use of the searcher's social network, in addition to the hyper-link based score used in most search engines. This combination of social and absolute search scores aims to improve the visibility of information that is relevant to the searcher, while maintaining any absolute measures of document importance . In our approach we adopt a flexible framework for combining information from different sources using Rank Aggregation techniques. Our search system, implemented using Java and Python, covers all the events and web pages present on MIT owned websites. We discuss the theory, design,and implementation of this system in details.

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

2010

Author dc:creator

• Ammar, Ammar (Ammar T.)

Advisor dc:contributor.advisor

• Devavrat Shah.

• 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/62635

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/62635