Paper Study – Propagation of Trust in E-commerce Communities, and others YuanDa Cao (曹元大), etc. Beijing Institute of Technology Presented by Vincent Dec/2004.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Different methods and Conclusions Liqin Zhang. Different methods Basic models Reputation models in peer-to-peer networks Reputation models in social networks.
Project Proposal.
Background Reinforcement Learning (RL) agents learn to do tasks by iteratively performing actions in the world and using resulting experiences to decide.
On the Economics of P2P Systems Speaker Coby Fernandess.
Using Game Theoretic Approach to Analyze Security Issues In Ad Hoc Networks Term Presentation Name: Li Xiaoqi, Gigi Supervisor: Michael R. Lyu Department:
Maximizing the Spread of Influence through a Social Network By David Kempe, Jon Kleinberg, Eva Tardos Report by Joe Abrams.
Interpersonal Trust Model Ing. Arnoštka Netrvalová DSS - seminar,
On Data-Centric Trust Establishment in Ephemeral Ad Hoc Networks Maxim Raya, Panos Papadimitratos, Virgil D. Gligor, Jean-Pierre Hubaux INFOCOM 2008.
Experience with an Object Reputation System for Peer-to-Peer File Sharing NSDI’06(3th USENIX Symposium on Networked Systems Design & Implementation) Kevin.
Planning under Uncertainty
A S URVEY OF TRUST MANAGEMENT AND ITS APPLICATIONS S UPERVISED BY : D R. Y AN W ANG Ravendra Singh Student-id:
Co-Training and Expansion: Towards Bridging Theory and Practice Maria-Florina Balcan, Avrim Blum, Ke Yang Carnegie Mellon University, Computer Science.
Models for Information Retrieval Mainly used in science and research, (probably?) less often in real systems But: Research results have significance for.
TAODV: A Trust Model Based Routing Protocol for Secure Ad Hoc Networks Li Xiaoqi, GiGi October 28, 2003.
TAODV: A Trust Model Based Routing Protocol for Secure Ad Hoc Networks Xiaoqi Li, Michael R. Lyu, and Jiangchuan Liu IEEE Aerospace Conference March 2004.
Computing Trust in Social Networks
Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.
Distributed Rational Decision Making Sections By Tibor Moldovan.
Security Models for Trusting Network Appliances From : IEEE ( 2002 ) Author : Colin English, Paddy Nixon Sotirios Terzis, Andrew McGettrick Helen Lowe.
RETSINA: A Distributed Multi-Agent Infrastructure for Information Gathering and Decision Support The Robotics Institute Carnegie Mellon University PI:
Pervasive Computing and Communication Security (PerSec 2006) March 13th, 2006 Florina Almenárez, Andrés Marín, Daniel Díaz, Juan Sánchez
Semantic Web Technologies Lecture # 2 Faculty of Computer Science, IBA.
On the Anonymity of Anonymity Systems Andrei Serjantov (anonymous)
Reputation Prakash Kolan Liqin Zhang Venkatesh Kancherla.
Social Networking and On-Line Communities: Classification and Research Trends Maria Ioannidou, Eugenia Raptotasiou, Ioannis Anagnostopoulos.
Personalization in Local Search Personalization of Content Ranking in the Context of Local Search Philip O’Brien, Xiao Luo, Tony Abou-Assaleh, Weizheng.
Free-riding and incentives in P2P systems name:Michel Meulpolder date:September 8, 2008 event:Tutorial IEEE P2P 2008.
Artificial Intelligence Lecture No. 28 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
Evolutionary Clustering and Analysis of Bibliographic Networks Manish Gupta (UIUC) Charu C. Aggarwal (IBM) Jiawei Han (UIUC) Yizhou Sun (UIUC) ASONAM 2011.
Yitzchak Rosenthal P2P Mechanism Design: Incentives in Peer-to-Peer Systems Paper By: Moshe Babaioff, John Chuang and Michal Feldman.
Deploying Trust Policies on the Semantic Web Brian Matthews and Theo Dimitrakos.
A discussion on trust requirements for a social network of eahoukers Manuel Graña J. David Nuñez-Gonzalez Bruno Apolloni 1HAIS 2013, Salamanca, 11 sept.
MASTER THESIS num. 802 ANALYSIS OF ALGORITHMS FOR DETERMINING TRUST AMONG FRIENDS ON SOCIAL NETWORKS Mirjam Šitum Ao. Univ. Prof. Dr. Dieter Merkl Univ.
Trustworthiness Management in the Social Internet of Things
Literature Web - Full Form
The EigenTrust Algorithm for Reputation Management in P2P Networks
Sunilkumar S. Manvi and P. Venkataram Protocol Engineering and Technology Unit, ECE Dept. Indian Institute of Science Bangalore, , INDIA
Computational Challenges in E-Commerce By Joan Feigenbaum, David C.Parkes, and David M.Pennock Presented by Wu Jingyuan.
南台科技大學 資訊工程系 A web page usage prediction scheme using sequence indexing and clustering techniques Adviser: Yu-Chiang Li Speaker: Gung-Shian Lin Date:2010/10/15.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Developing Trust Networks based on User Tagging Information for Recommendation Making Touhid Bhuiyan et al. WISE May 2012 SNU IDB Lab. Hyunwoo Kim.
MedEdPORTAL Reviewer Tutorial Contact MedEdPORTAL
A Graph Transformation System Model of Reliable Dynamic Communication Networks for Location Transparent Mobile Agents M. Kurihara (Hokkaido Univ., Japan)
CS Prelim Requirements and Results John Kubiatowicz CS Chair of Grad Study/Prelim Committee University of California at Berkeley 8/14/2012.
Estimating Component Availability by Dempster-Shafer Belief Networks Estimating Component Availability by Dempster-Shafer Belief Networks Lan Guo Lane.
Reviewing Papers© Dr. Ayman Abdel-Hamid, CS5014, Fall CS5014 Research Methods in CS Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech.
A Social Network-Based Trust Model for the Semantic Web Yu Zhang, Huajun Chen, and Zhaohui Wu Grid Computing Lab, College of Computer Science, Zhejiang.
A Quantitative Trust Model for Negotiating Agents A Quantitative Trust Model for Negotiating Agents Jamal Bentahar, John Jules Ch. Meyer Concordia University.
Algorithmic, Game-theoretic and Logical Foundations
Assignment Writing. Must be able to communicate well in writing. Communication skills are especially important when employers look for recent graduates.
Thomas HeckeleiPublishing and Writing in Agricultural Economics 1 Observations on assignment 4 - Reviews General observations  Good effort! Some even.
The EigenTrust Algorithm for Reputation Management in P2P Networks
Time-Space Trust in Networks Shunan Ma, Jingsha He and Yuqiang Zhang 1 College of Computer Science and Technology 2 School of Software Engineering.
International Conference on Fuzzy Systems and Knowledge Discovery, p.p ,July 2011.
Software Agents & Agent-Based Systems Sverker Janson Intelligent Systems Laboratory Swedish Institute of Computer Science
Peer-to-Peer Systems: An Overview Hongyu Li. Outline  Introduction  Characteristics of P2P  Algorithms  P2P Applications  Conclusion.
1/8 Project DIANE: How Social Structure Improves Distributed Reputation Systems Three Hypotheses Universität Karlsruhe.
The EigenTrust Algorithm for Reputation Management in P2P Networks Sepandar D.Kamvar Mario T.Schlosser Hector Garcia-Molina.
Decentralized Trust Management for Ad-Hoc Peer-to-Peer Networks Thomas Repantis Vana Kalogeraki Department of Computer Science & Engineering University.
Multiple-goal Search Algorithms and their Application to Web Crawling Dmitry Davidov and Shaul Markovitch Computer Science Department Technion, Haifa 32000,
哈工大信息检索研究室 HITIR ’ s Update Summary at TAC2008 Extractive Content Selection Using Evolutionary Manifold-ranking and Spectral Clustering Reporter: Ph.d.
PhD at CSE: Overview CSE department offers Doctoral degree in the Computer Science (CS) or Computer Engineering areas (CpE) at both MS to PhD and BS to.
Trustworthiness Management in the Social Internet of Things
The Beta Reputation System
Giannis F. Marias, Vassileios Tsetsos,
يك مدل اعتماد توزيع‍شده براي محيطهاي محاسبات فراگير
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Assume Anarchy? Peter J. Boettke Constitutional Economics
Presentation transcript:

Paper Study – Propagation of Trust in E-commerce Communities, and others YuanDa Cao (曹元大), etc. Beijing Institute of Technology Presented by Vincent Dec/2004

Web of Trust: Trust quantification, inference and propagation e.g. what is trust propagation [Guha 04] --- subjective! : beliefs of your trusted acquaintance/stranger, might from beliefs of his/her trusted acquaintance/stranger Importance to E-commerce 1.Security issues in open, anonymous, pervasive networks / communities 2.Not well established trust system for E-commerce compared with normal commerce (Josang) 3.Some initiative of applying trust to E-commerce has positive feedback Relevance to Computer Science (Lik Mui - thesis) 1.Dynamics of Reciprocity, Trust and Reputation in virtual communities 2.AI borrows from Economics in modeling rationality and intelligence, it is time for both to deal with social quantities like norms, morals, preferences, etc.

Importance to other fields: Distributed Systems [Mui 02] P2P Network e.g. [EigenTrust-03] for Reputation Management Assign each peer a unique global trust value Based on Power iteration To decrease the number of downloads of inauthentic files

Classification of Trust: Formal Trust, Informal Trust (Mui-thesis) Formal: e.g. legislation, contracts, escrow Direct Trust, Recommendation Trust (Beth99, Abdul-Rahman00) Direct: agent-specified values/scales about another agent Recommended trust: they consider as reputation This paper: Trust: a subjective expectation to a target agent’s future behavior reputation trustreciprocity net benefit Note:[Mui-02]Trust: A subjective expectation an agent has about another’s future behavior based on the history of their encounter Other terms involved: credibility, belief, usability, rating, etc.

Quantification & Inference of Trust: 1.Beth99: using previous positive and negative experiences 2.Josang: using subjective logic and D-S theory 3.Mui – theisis: reputation and history T= (p+c 1 )/(n+ c 1 + c 2 ) [p: cooperation, n: encounter] 4.This paper: T=(g+1)/(g+b+2) [g: successful experience, b: fail] and (trust strength S): the credibility of T But sections 3.1, 3.2, 3.3 are not clearly stated, some comments are: 3.1: direct interaction? The sentence “Trust discounting in ….” why S kj =1, S ik not? T ijk seems to relate to (T kj, S ik S kj ) why neglect T ik 3.2: S ijA is not defined clearly 3.3: 0.4 in the example is T, not S, so how to use formula (4)

Paralleling the trust network to get multiple paths Graph transforming algorithm [Mui-thesis] This paper has a modification to the transforming algorithm, to avoid recalculating the contribution of nodes immediately preceding the target node (e.g 10, 9, 11, 7) [direct experiment?] Propagation & Combination of Trust: - Parallelizing the trust network

1.Along each path, there is trust discount due to propagation 2.Paths have different weights when combined Guha04 and this paper: weighted average method This paper: \sum( ST) / sum(S) [Mui-02] not clear the discounting weighted combination: T(path i) * mean( prod(weights along path i)) Bin02, Josang: Dempster-shafer theory Propagation & Combination of Trust: - Combining the trust from multiple paths

Dempster-shafer theory [Binyu 02 Example] Trust Distrust Uncertain A to jm A ({T})=0.8, m A ({~T})=0, m A ({T,~T})=0.2 B to jm B ({T})=0.9, m B ({~T})=0, m B ({T,~T})=0.1 j A B Cumulative belief regarding j: ґ j ({T}) = 0.8* * *0.1 = 0.98 ґ j ({~T}) = 0 ґ j ({T,~T}) = 0.02 The reputation of j is defined as: ґ j ({T}) - ґ j ({~T}) = 0.98 Controversial to get reputation 0.98 > either 0.9 or 0.8 Combination of Trust: - Combining the trust from multiple paths Not sure about the propagation discount

Conclusion and comments 1.A good try to study trust in E-commerce, but the context of E-commerce is weakly situated. And some introduction words copied/modified from [Guha04] 2.Concise analysis on related work, the division of quantification, propagation, and combination of trust 3.The core part is not clearly stated though the structure can be somehow understood, especially for some notation, and the underlying reasons of introducing some new notations/approaches.