Attribution – NonCommercial - ShareAlike

Slides:



Advertisements
Similar presentations
Data Mining Methodology 1. Why have a Methodology  Don’t want to learn things that aren’t true May not represent any underlying reality ○ Spurious correlation.
Advertisements

Leadership Confidence September Leadership Pulse Dr. Theresa M. Welbourne Preliminary Report November 16, 2005 the measure of your success.
Each year that a faculty raise is given, the faculty will first be evaluated for a market adjustment. The relative size of the money set aside for market.
Dr. Alexandra Fedorova August 2007 Introduction to Systems Research at SFU.
A Combinatorial Fusion Method for Feature Mining Ye Tian, Gary Weiss, D. Frank Hsu, Qiang Ma Fordham University Presented by Gary Weiss.
Modern Information Retrieval
Concepts of Database Management Sixth Edition
Computing Trust in Social Networks
1 chapter: >> First Principles Krugman/Wells Economics
Writing an Essay discussing Advantages and Disadvantages of something
Altruistic Economics A presentation by Robin Upton, , Latest version at Attribution – NonCommercial.
Security Comparisons of Open Source and Closed Source Programs Katherine Wright.
Opinion mining in social networks Student: Aleksandar Ponjavić 3244/2014 Mentor: Profesor dr Veljko Milutinović.
A presentation by Robin Upton ( ) ‏ Latest version at Attribution – NonCommercial - ShareAlike FF106:
Concepts of Database Management, Fifth Edition Chapter 1: Introduction to Database Management.
Chapter 7 Business Process Redesign Reference: Tan, A. (2007). Business Process Reengineering in Asia: A Practical Approach, Pearson Education, Singapore.
Structure Altruistic Economics AE 106 : Key Innovations of AE V1.0 A presentation given to Grameen Software by Dr. Robin Upton. Grameen Bank Bhaban, Mirpur.
Web-Enabled Decision Support Systems
1 ISA&D7‏/8‏/ ISA&D7‏/8‏/2013 Systems Development Life Cycle Phases and Activities in the SDLC Variations of the SDLC models.
A presentation by Dr. Robin Upton ( ). Available for download at Attribution – NonCommercial - ShareAlike.
A presentation by Robin Upton ( ) ‏ latest version at Attribution – NonCommercial - ShareAlike FF 404.
A presentation by Dr. Robin Upton ( ). Available for download at Attribution – NonCommercial - ShareAlike
The EigenTrust Algorithm for Reputation Management in P2P Networks
Altruistic Economics A presentation by Dr. Robin Upton. BRAC University, :00 Available for download at Attribution.
A presentation by Robin Upton ( ) ‏ latest version at Attribution – NonCommercial - ShareAlike FF 4 :
Starlogo TNG Online Ricarose Roque, TEP. What will SLTNG Online be? Online space for all users to Share and publish their projects Browse and download.
Software Engineering SM ? 1. Outline of this presentation What is SM The Need for SM Type of SM Size Oriented Metric Function Oriented Metric 218/10/2015.
A Graph-based Friend Recommendation System Using Genetic Algorithm
INTERACTIVE ANALYSIS OF COMPUTER CRIMES PRESENTED FOR CS-689 ON 10/12/2000 BY NAGAKALYANA ESKALA.
Online curriculum centre Faculty member training, April 2009.
A presentation by Dr. Robin Upton ( ). Available for download at Attribution – NonCommercial - ShareAlike
The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)
Making Contribution-Aware P2P Systems Robust to Collusion Attacks Using Bandwidth Puzzles Vyas Sekar, Carnegie Mellon University Joint work with Michael.
Altruistic Economics A presentation by Dr. Robin Upton, , for Dhaka University Computer Science Department. Available for download at
Harvesting Social Knowledge from Folksonomies Harris Wu, Mohammad Zubair, Kurt Maly, Harvesting social knowledge from folksonomies, Proceedings of the.
Concepts of Database Management Seventh Edition Chapter 1 Introduction to Database Management.
The EigenTrust Algorithm for Reputation Management in P2P Networks
Module 4: Managing Access to Resources. Overview Overview of Managing Access to Resources Managing Access to Shared Folders Managing Access to Files and.
Copyright © 2009 – Curt Hill Standard Template Library An Introduction.
Grouper Training End Users Lite UI – Memberships – Part 2 Chris Hyzer Internet2 University of Pennsylvania This work licensed under a Creative Commons.
Social Networks and Peer to Peer As Presented by Jeremy Robinson 3/22/2007.
A presentation by Dr. Robin Upton. Available for download at Attribution – NonCommercial - ShareAlike Altruistic Economics. Personal.
A presentation by Robin Upton ( ) ‏ Latest version at Attribution – NonCommercial - ShareAlike Recommended.
Chantira Chiaranai, RN, PhD Institute of Nursing Suranaree University of Technology Electronic Learning Portfolio: An Innovation Emphasizing Self-directed.
Module 4: Managing Access to Resources. Overview Overview of Managing Access to Resources Managing Access to Shared Folders Managing Access to Files and.
A presentation by Dr. Robin Upton. Available for download at Attribution – NonCommercial - ShareAlike Altruistic Economics. Introduction.
Sybil Attacks VS Identity Clone Attacks in Online Social Networks Lei Jin, Xuelian Long, Hassan Takabi, James B.D. Joshi School of Information Sciences.
Advanced Tricks and Troubleshooting.  Introduction  Uploading File Bundles  DragonDrop Media Players  Embedded Media Player Sample HTML Code  Embedded.
IMS 4212: Course Introduction 1 Dr. Lawrence West, Management Dept., University of Central Florida ISM 4212 Dr. Larry West
Getting Reviews And Other Hard Things in Mike Ramsey NiftyMarketing.com gplus.to/MikeRamsey.
Group collaborative Projects: TECHNOLOGICAL TOOLS TO ASSESS INDIVIDUAL CONTRIBUTION.
– Purposes & Uses 20 – Purposes & Uses 20.
Becoming a PAES expert.
Recommendation in Scholarly Big Data
What is a CAT? What is a CAT?.
The Handbook of Logistics and Distribution Management
Module 4: Managing Access to Resources
Network Topology Name: Dua'a Alfadhli ID: Section: 201
Attribution – NonCommercial - ShareAlike
E-Commerce Theories & Practices
Keeping yourself right with copyright
Dieudo Mulamba November 2017
Location Recommendation — for Out-of-Town Users in Location-Based Social Network Yina Meng.
An Efficient method to recommend research papers and highly influential authors. VIRAJITHA KARNATAPU.
Becoming a PAES expert.
Attribution – NonCommercial - ShareAlike
Principles of Marketing
Security Principles and Policies CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
Retrieval Performance Evaluation - Measures
GhostLink: Latent Network Inference for Influence-aware Recommendation
Presentation transcript:

Attribution – NonCommercial - ShareAlike Altruistic Economics AE18: The Imaginary Friends Test v1.0 www.altruists.org Recommended Pre-requisite: AE10: Keeping Score A presentation by Dr. Robin Upton (2006-01-28) Available for download at www.altruists.org/ae14 Attribution – NonCommercial - ShareAlike Introduction to Imaginary Friends

Introduction to Imaginary Friends Altruistic Economics is a decentralised system, so users have a lot of autonomy... .  Artificial Construct  Real Individual User , such as the chance to create Imaginary Friends: Rewarding such Imaginary Friends would encourage deception. . F2F Network Growth

Each new member creates an online server and is linked in by friends. F2F Network Growth The Friend2Friend network grows organically, over real social relationships.   Each new member creates an online server and is linked in by friends.      The idea is, everyone has one online server. However,like WWW, there is no centre, noone in charge, no list of members. Sybil Attacks

The ‘Imaginary Friends’ Test Sybil Attacks ‘Sybil’ was the first person diagnosed with so-called ‘Multiple Personality Disorder’.       A Sybil Attack is an attempt to defraud an online system by using fake identities. The ‘Imaginary Friends’ Test

The ‘Imaginary Friends’ Test “Does it help to create ‘imaginary friends’?” 1. Imaginary Friends make no difference:  PASS:  No Incentive to Cheat 2. Imaginary Friends are a disadvantage:   3. Imaginary Friends are an advantage:   FAIL:  Incentive to Cheat . Media Sharing

Media Sharing Aysha Birbal Chris MEDIA SHARING is a project to network people who review files and then benefit from one another’s opinions. Aysha wants an opinion about the film ‘Chinese Whispers’… Aysha Birbal I value your opinion… I value your opinion… “Chinese Whispers” I know this film Chris How to quantify this process... ? Basic Framework

Basic Framework Aysha Birbal Chris Assume: Individuals make 2 sorts of evaluations: 1) ‘I value your opinion’ is quantified as V: 0<=V<=1 2) ‘I rate this File’ is quantified as R: 0<=R<=1 Individuals who don’t rate a file defer to their friends Friends of friends’ opinions are valued multiplicatively “Chinese Whispers” Birbal Aysha I value your opinion… 0.3 Chris opinion… 0.4 I rate this file… 0.8 So Aysha has one recommendation: Value=0.12 Rating=0.8 Combining Recommendations

Combining Recommendations Ratings are averaged according to value, to give a single figure. So, if Aysha has 4 recommendations: Value=0.15 Rating=0.6 Value=0.8 Rating=0.5 Value=0.08 Rating=0.6 Value=0.12 Rating=0.8 Note the high value of the 2nd rating, which means it dominates the others. 0.15×0.6+ 0.8×0.5+ 0.08×0.6+ 0.12×0.8 0.15+0.8+0.08+0.12 Weighted average = ≈ 0.55 Applying The Test

What if Chris made Imaginary Friends to rate the file for him? Applying The Test What if Chris made Imaginary Friends to rate the file for him? “Chinese Whispers” MBogoN Chris MBogo2 Rating = R I value your opinion… 1.0 MBogo1 Value=VB I value your opinion… 1.0 … Value=VB Rating=R … { N separate ratings have Overall value = NVB A Problem

Chris could use his Imaginary Friends to dominate the other ratings. A Problem So, if Aysha has 4 recommendations: Value=0.15 Rating=0.6 Value=0.8 Rating=0.5 Value=0.08 Rating=0.6 Value=NVB Rating=R If N is big enough, no one else’s ratings count! Chris could use his Imaginary Friends to dominate the other ratings. Imaginary friends can increase an individuals’ impact, so the algorithm fails the imaginary friends test. A Modification

A Modification To control the imaginary friends, we add a constraint to the model. “Chinese Whispers” MBogoN Chris MBogo2 Rating = R V1 MBogo1 Value=VB vN … v2 N friends give Chris N ratings, with a value of ∑Vf. f Let’s require ∑Vf=1 f Summary of The ‘Imaginary Friends’ Test

Modified Algorithm Examined With N>0 imaginary friends: As an individual: …} N such friends MBogof Rating = Rf “Chinese Whispers” Chris Vf VB VB Chris “Chinese Whispers” Rating = R Overall rating: Value= VB∑Vf Rating=∑VfRf f Single rating: Value=VB Rating=R Since ∑Vf=1, 1≥R,Rf≥0… f imaginary friends confer no advantage. So the modified algorithm passes the imaginary friends test. Modified Algorithm Examined

Summary of The Imaginary Friends Test Sybil Attacks are a feature of decentralised systems.  Creating Imaginary Friends should not confer any advantage: Applying the Imaginary Friends Test helps deduce algorithms suitable for decentralised systems. Recommended Further Reading: AE19: Preventing Abuse http://www.altruists.org/ae19