Trust Model for High Quality of Recommendations G. Lenzini, N. Sahli, and H. Eertink (Telematica Instituut, NL) G. Lenzini, N. Sahli, and H. Eertink (Telematica.

Slides:



Advertisements
Similar presentations
Recommender System A Brief Survey.
Advertisements

Research Issues in Web Services CS 4244 Lecture Zaki Malik Department of Computer Science Virginia Tech
1 CS 6910: Advanced Computer and Information Security Lecture on 11/2/06 Trust in P2P Systems Ahmet Burak Can and Bharat Bhargava Center for Education.
Elizeu Santos-Neto, Flavio Figueiredo Jussara Almeida, Miranda Mowbray Marcos Gonçalves, Matei Ripeanu The 2 nd IEEE SocialCom/SIN -- August 2010.
Modeling Insider Attacks on Group Key Exchange Protocols Jonathan Katz Ji Sun Shin University of Maryland.
AutonomicTrustManagementforaPervasiveSystemZheng Yan 1 Autonomic Trust Management for a Pervasive System Zheng Yan Nokia Research Center, Helsinki, Finland.
OntoBlog: Informal Knowledge Management by Semantic Blogging Aman Shakya 1, Vilas Wuwongse 2, Hideaki Takeda 1, Ikki Ohmukai 1 1 National Institute of.
Recommender Systems Aalap Kohojkar Yang Liu Zhan Shi March 31, 2008.
A S URVEY OF TRUST MANAGEMENT AND ITS APPLICATIONS S UPERVISED BY : D R. Y AN W ANG Ravendra Singh Student-id:
Participatory Sensing Huang, Ming-Chun.
CSCE 715 Ankur Jain 11/16/2010. Introduction Design Goals Framework SDT Protocol Achievements of Goals Overhead of SDT Conclusion.
Artificial Intelligence and Case-Based Reasoning Computer Science and Engineering Mälardalen University Västerås, Mikael Sollenborn, CSL,
© Siemens AG 2001 Software & Systems Architectures - Mobile Computing Proposed Research Topics Cooperation between Siemens and UCB March 27, 2001 Visit.
March 20, 2001CSci Clark University1 CSci 250 Software Design & Development Lecture #17 Tuesday, March 20, 2001.
Recommender systems Ram Akella February 23, 2011 Lecture 6b, i290 & 280I University of California at Berkeley Silicon Valley Center/SC.
Security Models for Trusting Network Appliances From : IEEE ( 2002 ) Author : Colin English, Paddy Nixon Sotirios Terzis, Andrew McGettrick Helen Lowe.
Social Context Based Recommendation Systems and Trust Inference Student: Andrea Manrique ID: ITEC810, Macquarie University1 Advisor: A/Prof. Yan.
12 -1 Lecture 12 User Modeling Topics –Basics –Example User Model –Construction of User Models –Updating of User Models –Applications.
The Scientific Community Game as A Crowdsourcing Platform to Distinguish Good from Bad Presentation to Clients by Software Development Organization 4/24/20111.
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
Technische Universität München Context-Aware Recommendations in Decentralized, Item-Based Collaborative Filtering on Mobile Devices Wolfgang Woerndl, Henrik.
The 2nd International Conference of e-Learning and Distance Education, 21 to 23 February 2011, Riyadh, Saudi Arabia Prof. Dr. Torky Sultan Faculty of Computers.
Recommender Systems. >1,000,000,000 Finding Trusted Information How many cows in Texas?
C++ Object Oriented 1. Class and Object The main purpose of C++ programming is to add object orientation to the C programming language and classes are.
Managing Social Influences through Argumentation-Based Negotiation Present by Yi Luo.
Link Recommendation In P2P Social Networks Yusuf Aytaş, Hakan Ferhatosmanoğlu, Özgür Ulusoy Bilkent University, Ankara, Turkey.
Distributed Networks & Systems Lab. Introduction Collaborative filtering Characteristics and challenges Memory-based CF Model-based CF Hybrid CF Recent.
Recommender systems Drew Culbert IST /12/02.
Aims and Objectives.
Inter-Context Trust Bootstrapping for Mobile Content Sharing (daniele quercia) (stephen hailes & licia capra) U C LU C L.
Generating Intelligent Links to Web Pages by Mining Access Patterns of Individuals and the Community Benjamin Lambert Omid Fatemieh CS598CXZ Spring 2005.
Lecture#1 on Internet. Internet Addressing IP address: pattern of 32 or 128 bits often represented in dotted decimal notation IP address: pattern of 32.
Implicit An Agent-Based Recommendation System for Web Search Presented by Shaun McQuaker Presentation based on paper Implicit:
RecSys 2011 Review Qi Zhao Outline Overview Sessions – Algorithms – Recommenders and the Social Web – Multi-dimensional Recommendation, Context-
Argumentation and Trust: Issues and New Challenges Jamal Bentahar Concordia University (Montreal, Canada) University of Namur, Belgium, June 26, 2007.
ApplicationsApplications Mills Davis Ana Cristina Garcia Peter Mika Gerti Orthofer Giovanni Sacco Maria A. Wimmer (Moderator)
Metadata Models in Survey Computing Some Results of MetaNet – WG 2 METIS 2004, Geneva W. Grossmann University of Vienna.
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Principles on evaluating FIWARE relevance for Phase 3 proposals.
Developing Trust Networks based on User Tagging Information for Recommendation Making Touhid Bhuiyan et al. WISE May 2012 SNU IDB Lab. Hyunwoo Kim.
ACOMP 2011 A Novel Framework for LBS Privacy Preservation in Dynamic Context Environment.
Combining Theory and Systems Building Experiences and Challenges Sotirios Terzis University of Strathclyde.
RecBench: Benchmarks for Evaluating Performance of Recommender System Architectures Justin Levandoski Michael D. Ekstrand Michael J. Ludwig Ahmed Eldawy.
EIS'2007 (Salamanca, Spain, March 22-24, 2007) 1 Towards an Extended Model of User Interface Adaptation: the ISATINE framework 1 Víctor M. López Jaquero,
Department of Electronic Engineering Challenges & Proposals INFSO Information Day e-Infrastructure Grid Initiatives 26/27 May.
Reputation Network Analysis for Filtering Ravi Emani Ramesh Ravindran.
A Study of Smartphone User Privacy from the Advertiser's Perspective Yan Wang 1, Yingying Chen 1, Fan Ye 2, Jie Yang 3, Hongbo Liu 4 1 Department of Electrical.
Agents that Reduce Work and Information Overload and Beyond Intelligent Interfaces Presented by Maulik Oza Department of Information and Computer Science.
A Content-Based Approach to Collaborative Filtering Brandon Douthit-Wood CS 470 – Final Presentation.
Reputation Management in Grid-based Virtual Organisations Benjamin Aziz (e-Science Centre, STFC Rutherford Appleton Laboratory, UK) Joint work with Alvaro.
A Quantitative Trust Model for Negotiating Agents A Quantitative Trust Model for Negotiating Agents Jamal Bentahar, John Jules Ch. Meyer Concordia University.
Harvesting Social Knowledge from Folksonomies Harris Wu, Mohammad Zubair, Kurt Maly, Harvesting social knowledge from folksonomies, Proceedings of the.
Assessment. Levels of Learning Bloom Argue Anderson and Krathwohl (2001)
Similarity & Recommendation Arjen P. de Vries CWI Scientific Meeting September 27th 2013.
Srinivas Cheekati( ) Instructor: Dr. Dong-Chul Kim
A Security Framework with Trust Management for Sensor Networks Zhiying Yao, Daeyoung Kim, Insun Lee Information and Communication University (ICU) Kiyoung.
Collaborative Filtering and Recommender Systems Brian Lewis INF 385Q Knowledge Management Systems November 10, 2005.
Artificial Intelligence
Prophet/Critic Hybrid Branch Prediction B B B
Fast Transmission to Remote Cooperative Groups: A New Key Management Paradigm.
Collaborative Filtering - Pooja Hegde. The Problem : OVERLOAD Too much stuff!!!! Too many books! Too many journals! Too many movies! Too much content!
Designing a framework For Recommender system Based on Interactive Evolutionary Computation Date : Mar 20 Sat, 2011 Project Number :
Trust-aware Recommender Systems
Recommendation Based Trust Model with an Effective Defense Scheme for ManetS Adeela Huma 02/02/2017.
Trustworthiness Management in the Social Internet of Things
Preface to the special issue on context-aware recommender systems
Ishan Sharma Abhishek Mittal Vivek Raj
FEASIBILITY STUDY Feasibility study is a means to check whether the proposed system is correct or not. The results of this study arte used to make decision.
Knowledge Sharing Mechanism in Social Networking for Learning
Presentation transcript:

Trust Model for High Quality of Recommendations G. Lenzini, N. Sahli, and H. Eertink (Telematica Instituut, NL) G. Lenzini, N. Sahli, and H. Eertink (Telematica Instituut, NL) SECRYPT, special session, Porto, July 2008

Opening

SECRYPT, special session, Porto, July Ratings and Recommender/Review Systems Recommender systems aim to predict the rating that a user would give to an unknown item (as if he had indeed tasted, used, tried it)

SECRYPT, special session, Porto, July Recommender Systems Recommender systems’ three main categories: Content based: the prediction estimated from the ratings that the user has given to “similar” items –items are similar on content-based factors (tags, keywords, ontologies) Collaborative (filtering) based: the prediction estimated from the ratings that “similar” users have given to the item –users are similar on “taste likelihood” calculated upon common rated items Hybrid

SECRYPT, special session, Porto, July To overcome the limitation of current recommender systems (i.e., sparsity and accuracy) very recent proposals suggest to substitute the user similarity with trust. P. Massa, P. Aversani, Trust-aware Recommender Systems RECSYS 2007 N. Lathia, S. Hailes, L. Capra, Trust-based Collaborative Filtering IFIPTM 2008 Dell’Amico, L. Capra, SOFIA: Social Filtering for Robust Recommendations, IFIPTM 2008 D. Quercia, today The experimental results are positive. Rummble.com uses trust-based recommendation with commercial scope. Trust and Collaborative Filtering

SECRYPT, special session, Porto, July Epinions.com

SECRYPT, special session, Porto, July Epinions.com

Our motivation

SECRYPT, special session, Porto, July Virtual Communities We were working on virtual communities in e-commerce applications (i.e., recommender and reviews systems). Virtual communities’ size may increases quite fast. Trust becomes fuzzy quite fast too.

SECRYPT, special session, Porto, July Flixter.com

SECRYPT, special session, Porto, July How to provide specific solutions to maintain trust relationships in those community? (e.g., autonomous) How to increase the trustworthiness of members towards the community and the information they find there? (e.g., increase personalization) What features can be advantageous in the design of a trustworthy virtual community (e.g., agent-based, mobility)? How to improve current recommender system that are based on virtual communities (e.g., by improving the quality of recommendation)? Virtual Communities Networks of Trust: questions

SECRYPT, special session, Porto, July Quality vs Usefulness How to distinguish between a not useful recommendation (but coming from a trusted recommender) from a recommendation of doubt honesty? Recommenders’ experiences might have maturated in different contexts. Recommenders may have tastes that are completely different from ours. That is sufficient/correct to label them as untrustworthy?

SECRYPT, special session, Porto, July  In practice: Peer Review of Justification

Our Proposal

SECRYPT, special session, Porto, July Solution for High Quality of Recommendation We designed a framework for an hybrid recommender/reviews where trust and other mechanisms are used to achieved high quality of recommendations Key concepts Trust Model Architecture (skipped in the talk, look into the paper)

Key Concepts

SECRYPT, special session, Porto, July Virtual Agora, TRat, TRec ItemsRecommenders Virtual Agora Embedded Delegate registrer of (un)trusted items network of (un)trusted recommender TRat TRec

Trust Model

SECRYPT, special session, Porto, July Trust Model Aim: build/use/update TRat(A) and TRec(A) Notation: –In TRat(A), agents-items –In TRec(A), agents-agents (recommenders) –temporary and eventual, e.g.,

SECRYPT, special session, Porto, July Virtual Agora, TRat, TRec ItemsRecommenders Virtual Agora Embedded Delegate register of (un)trusted items network of (un)trusted recommender TRat TRec

SECRYPT, special session, Porto, July Detail of TRat(A), items –A rating that a user gives to an item is calculated, at a certain time, in a certain context, by using a combination of the following strategies content-based (past experience on the “similar” items, in the same or “similar” context): collaborative filtering approaches (ratings from “similar” users, same or similar items, same or “similar” context) trust-based approaches (ratings from trusted users, same of similar items, same or “similar” context) –Recommended ratings are selected/weighted upon their quality –Outputs are merged and recommenders and their recommendations are stored (from temporary to eventual)

SECRYPT, special session, Porto, July On High quality of recommendation quality = trust in the source  analysis of justification

SECRYPT, special session, Porto, July TRat(A), items: Recommendation –A accepts D’s recommendation only if D’s trustworthiness combined with an evaluation of the justification that D has given for his recommendation is above a certain threshold. –D’s justification is a set of arguments supporting the rating gave for each aspects (e.g., food, ambience, service) –D’s arguments are evaluated against A’s way of reasoning by running an argumentation protocol

SECRYPT, special session, Porto, July Argumentation Protocol An argumentation protocol is a composition of dialogue games (primitives: assert, attack, defend, challenge, justify, accept, refuse, or declare undefined) Logic-based, efficient, implementation of argumentation protocols are available in the literature (J. Bentahar and J.J. Meyer, 2007)

SECRYPT, special session, Porto, July Example (informal version) Paul –I love that place (claim) –They serve traditional food, cooked in the traditional way. (grounds for a claim) –why? (asking for ground) –yes, sometimes, it is the price you pay for discovering new tastes (undercutting counter-argument) –Ok, I agree Olga –why? (asking for ground) –I may not like the place (stating a counter- argument) –since traditional cooking may be not clean (ground for the counter-argument) –is not for that that I am willing to pay a price (alternative counter- arguments) –(refuse the argument)

SECRYPT, special session, Porto, July Running an Argumentation Protocol A and D run a protocol to argue on the arguments that D has given for each aspect of its recommendation. Output of the protocol a value of A’s argumentation trust in D’s arguments

SECRYPT, special session, Porto, July Argumentation Trust N au = # argument accepted or undefined N r = # argument refused N = N r + N au

SECRYPT, special session, Porto, July Consequences D’s arguments can be so strong to have D’s recommendation accepted (by A’s) despite D’s trust as a recommender is not so strong –(after a real experience) if D’s recommendation was indeed a good one, A’s trust in D increases. D’s arguments are so weak to have D’s recommendation refused (by A) despite D’s trust as recommender is high. –(after a real experience) if D’s recommendation was not a good one, D’s trust is not affected because that recommendation was not accepted anyhow. Trust is dynamic

SECRYPT, special session, Porto, July Virtual Agora, TRat, TRec ItemsRecommenders Virtual Agora Embedded Delegate register of (un)trusted items network of (un)trusted recommender TRat TRec

SECRYPT, special session, Porto, July TRec(A), recommenders –A’s builds/maintains its trust in D by using a combination of the following strategies: evaluation of D’s reputation (as a recommender) according to A’s past experience direct evaluation of D by content-based strategies (referral trust bootstrap) check between D’s given recommendations and A’s direct experience w.r.t. items recommended by D

Conclusion and Future Directions

SECRYPT, special session, Porto, July Features of our solution Context-awareness Unobtrusiveness Usefulness Quality Privacy and Subjectiveness Mobility Low Traffic

SECRYPT, special session, Porto, July On going work: Duine Toolkit We have already implemented a prototype JADEX (Jadex 2008) as a development environment, which handles BDI concept. In order to commercialise our solution and make it useful for the market, we are currently integrating our approach to a set of well- known techniques. Duine Toolkit (M. Van Setten et al, 2004), developed in our Institute, is a framework for hybrid recommender which makes available a number of prediction techniques and allows them to be combined dynamically

SECRYPT, special session, Porto, July On going, future work Have the solution implemented in a review site Evaluation by “return of business”-based metrics Mobility and automatic context capture with IYOUIT

Not(Questions)  Thanks