Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Design and Analysis of a Gossip-based Decentralized Trust Recommender System
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.ORCID iD: 0000-0003-2988-8464
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.ORCID iD: 0000-0002-4722-0823
2012 (English)In: 4th ACM Recommender Systems (RecSys) Workshop on Recommender Systems & the Social Web, 2012Conference paper, Oral presentation only (Refereed)
Abstract [en]

Information overload has become an increasingly common problem in today’s large scale internet applications. Collaborative filtering(CF) recommendation systems have emerged   as a popular solution to this problem by taking advantage of underlying social networks. Traditional CF recommenders suffer from lack of scalability[18] while decentralized recommendation systems (DHT-based, Gossip-based etc.) have promised to alleviate this problem. Thus, in this paper we propose a decentralized approach to CF recommender sys  tems that takes advantage of the popular P2P T-Man algorithm to create and maintain an overlay network capable of generating predictions based on only local information. We       analyze our approaches performance in terms of prediction accuracy and item-coverage function of neighborhood size as well as number of T-Man rounds. We show our system       achieves better accuracy than previous approaches while implementing a highly scalable, decentralized paradigm. We also show our system is able to generate predictions for a       large fraction of users, which is comparable with the centralized approaches.

Place, publisher, year, edition, pages
2012.
Keyword [en]
Trust, Decentralized, Gossip, Recommender Systems
National Category
Information Systems
Identifiers
URN: urn:nbn:se:kth:diva-118489OAI: oai:DiVA.org:kth-118489DiVA: diva2:606541
Conference
Recommender Systems and the Social Web (RSWEB'2012)
Note

QC 20130220

Available from: 2013-02-19 Created: 2013-02-19 Last updated: 2014-01-24Bibliographically approved
In thesis
1. Trust-Based User Profiling
Open this publication in new window or tab >>Trust-Based User Profiling
2013 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

We have introduced the notion of user profiling with trust, as a solution to theproblem of uncertainty and unmanageable exposure of personal data duringaccess, retrieval and consumption by web applications. Our solution sug-gests explicit modeling of trust and embedding trust metrics and mechanismswithin very fabric of user profiles. This has in turn allowed information sys-tems to consume and understand this extra knowledge in order to improveinteraction and collaboration among individuals and system. When formaliz-ing such profiles, another challenge is to realize increasingly important notionof privacy preferences of users. Thus, the profiles are designed in a way toincorporate preferences of users allowing target systems to understand pri-vacy concerns of users during their interaction. A majority of contributionsof this work had impact on profiling and recommendation in digital librariescontext, and was implemented in the framework of EU FP7 Smartmuseumproject. Highlighted results start from modeling of adaptive user profilesincorporating users taste, trust and privacy preferences. This in turn led toproposal of several ontologies for user and content characteristics modeling forimproving indexing and retrieval of user content and profiles across the plat-form. Sparsity and uncertainty of profiles were studied through frameworksof data mining and machine learning of profile data taken from on-line so-cial networks. Results of mining and population of data from social networksalong with profile data increased the accuracy of intelligent suggestions madeby system to improving navigation of users in on-line and off-line museum in-terfaces. We also introduced several trust-based recommendation techniquesand frameworks capable of mining implicit and explicit trust across ratingsnetworks taken from social and opinion web. Resulting recommendation al-gorithms have shown to increase accuracy of profiles, through incorporationof knowledge of items and users and diffusing them along the trust networks.At the same time focusing on automated distributed management of profiles,we showed that coverage of system can be increased effectively, surpassingcomparable state of art techniques. We have clearly shown that trust clearlyelevates accuracy of suggestions predicted by system. To assure overall pri-vacy of such value-laden systems, privacy was given a direct focus when archi-tectures and metrics were proposed and shown that a joint optimal setting foraccuracy and perturbation techniques can maintain accurate output. Finally,focusing on hybrid models of web data and recommendations motivated usto study impact of trust in the context of topic-driven recommendation insocial and opinion media, which in turn helped us to show that leveragingcontent-driven and tie-strength networks can improve systems accuracy forseveral important web computing tasks.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2013. xi, 48 p.
Series
TRITA-ICT-ECS AVH, ISSN 1653-6363 ; 13:10
Keyword
trust, userprofiling, userprofiles, privacy, interest, socialnetwork, recommendersystems
National Category
Information Systems
Identifiers
urn:nbn:se:kth:diva-118488 (URN)978-91-7501-651-1 (ISBN)
Public defence
2013-03-08, C1 Sal, Electrum, ICT/KTH, Isafjordsgatan 20, Kista, 13:00 (English)
Opponent
Supervisors
Note

QC 20130219

Available from: 2013-02-19 Created: 2013-02-19 Last updated: 2014-01-24Bibliographically approved

Open Access in DiVA

No full text

Other links

http://ls13-www.cs.uni-dortmund.de/homepage/rsweb2012/papers/RSWeb-Magureanu.pdf

Authority records BETA

Magureanu, StefanMatskin, Mihhail

Search in DiVA

By author/editor
Magureanu, StefanDokoohaki, NimaMokarizadeh, ShahabMatskin, Mihhail
By organisation
Software and Computer systems, SCS
Information Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 129 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf