Pharos puts some confidential results at our disposal: the two following reports "TECHNIQUES AND ALGORITHMS FOR SOCIAL MEDIA" and "SOCIAL MEDIA BETA" are now online.
Pharos was a Research project partly funded by the European Commission that started early 2007 and ended by the end of 2009.
The PHAROS mission was to advance audiovisual search from a point-solution search engine paradigm to an integrated search platform paradigm. This platform to be built on an innovative, open, and distributed architecture that enables consumers, businesses and organisations to unlock the values found in audiovisual content.
The two following reports can be downloaded here:
Pharos - Techniques and Algorithms for Social Media: Published end of 207, the report focuses on some Social Media: Blogs, Collaborative Tagging systems and Recommender Systems. In addition, techniques for trust in Metadata are also briefly described . Specifically, Chapter 1 describes some important background information about the role of Social Media in the PHAROS platform. Chapter 2 reports current state-of-the-art algorithms for Social Media. Chapter 3 discusses the details of new algorithms and techniques developed by the PHAROS consortium for building user profiles. Recommendation and Personalization algorithms are discussed in Chapter 4. Finally, conclusions and future work are discussed in Chapter 5.
Pharos - Social Media Beta: This report focuses on the engineering aspect and describes the development of Social Media Beta. Particularly, Chapter 1 briefly reminds some background knowledge about social media and introduces the general architecture of Social Media Beta release. Four specific modules: User & Social Information Storage (USIS), User & Community Profiler (UCP), Social Networks & Blogspace Analysis (SNBA), and Personalization Module (PM) are described in depth with both architectural aspects, as well as algorithms in Chapter 2. For the purpose of further demonstrating the functionalities of these modules, in Chapter 3, a series of use cases corresponding to each module are described.
Print
