How to Analyse Social Network? : Part 2 Power Laws and Rich-Get-Richer Phenomena Thank you for all referred contexts and figures.

Slides:



Advertisements
Similar presentations
Prediction Modeling for Personalization & Recommender Systems Bamshad Mobasher DePaul University Bamshad Mobasher DePaul University.
Advertisements

How to Schedule a Cascade in an Arbitrary Graph F. Chierchetti, J. Kleinberg, A. Panconesi February 2012 Presented by Emrah Cem 7301 – Advances in Social.
Influence and Correlation in Social Networks Xufei wang Nov
Traffic-driven model of the World-Wide-Web Graph A. Barrat, LPT, Orsay, France M. Barthélemy, CEA, France A. Vespignani, LPT, Orsay, France.
Analysis and Modeling of Social Networks Foudalis Ilias.
Online Social Networks and Media Navigation in a small world.
IEEE ICDCS, Toronto, Canada, June 2007 (LA-UR ) 1 Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks Hasan Guclu.
EK Ch 17: Power laws and rich-get-richer phenomena (with an application of Web Spam detection Spam, Damn Spam and Statistics ) Spam, Damn Spam and Statistics.
Power Laws: Rich-Get-Richer Phenomena
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
The influence of search engines on preferential attachment Dan Li CS3150 Spring 2006.
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Trends in Object-Oriented Software Evolution: Investigating Network Properties Alexander Chatzigeorgiou George Melas University of Macedonia Thessaloniki,
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Small Worlds Presented by Geetha Akula For the Faculty of Department of Computer Science, CALSTATE LA. On 8 th June 07.
The Barabási-Albert [BA] model (1999) ER Model Look at the distribution of degrees ER ModelWS Model actorspower grid www The probability of finding a highly.
Recommender Systems Aalap Kohojkar Yang Liu Zhan Shi March 31, 2008.
UNDERSTANDING VISIBLE AND LATENT INTERACTIONS IN ONLINE SOCIAL NETWORK Presented by: Nisha Ranga Under guidance of : Prof. Augustin Chaintreau.
Tagging Systems Austin Wester. Tags A keywords linked to a resource (image, video, web page, blog, etc) by users without using a controlled vocabulary.
Identifying Early Buyers from Purchase Data Paat Rusmevichientong, Shenghuo Zhu & David Selinger Presented by: Vinita Shinde Feb 18 th, 2010.
Tagging Systems Mustafa Kilavuz. Tags A tag is a keyword added to an internet resource (web page, image, video) by users without relying on a controlled.
Web as Graph – Empirical Studies The Structure and Dynamics of Networks.
Recommender Systems. Customization Customization is one of the more attractive features of electronic commerce. –Creating a different product for every.
Agent Technology for e-Commerce
Social Networks: Advertising, Pricing and All That Zvi Topol & Itai Yarom.
Recommender Systems; Social Information Filtering.
Computer Science 1 Web as a graph Anna Karpovsky.
The Social Web: A laboratory for studying s ocial networks, tagging and beyond Kristina Lerman USC Information Sciences Institute.
Personalized Ontologies for Web Search and Caching Susan Gauch Information and Telecommunications Technology Center Electrical Engineering and Computer.
Overview of Web Data Mining and Applications Part I
Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.
Λ14 Διαδικτυακά Κοινωνικά Δίκτυα και Μέσα
Models of Influence in Online Social Networks
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
Mark Levene, An Introduction to Search Engines and Web Navigation © Pearson Education Limited 2005 Slide 9.1 Chapter 9 : Social Networks What is a social.
Dr. Dinesh Kumar Assistant Professor Department of ENT, GMC Amritsar.
Adaptive News Access Daniel Billsus Presented by Chirayu Wongchokprasitti.
Easy Chair Online Conference Submission, Tracking and Distribution Process: Getting Started + Information for Reviewers AMS World Marketing Congress /
1 Applying Collaborative Filtering Techniques to Movie Search for Better Ranking and Browsing Seung-Taek Park and David M. Pennock (ACM SIGKDD 2007)
1 Discovering Authorities in Question Answer Communities by Using Link Analysis Pawel Jurczyk, Eugene Agichtein (CIKM 2007)
Understanding Crowds’ Migration on the Web Yong Wang Komal Pal Aleksandar Kuzmanovic Northwestern University
Feedback Effects between Similarity and Social Influence in Online Communities David Crandall, Dan Cosley, Daniel Huttenlocher, Jon Kleinberg, Siddharth.
Optimal Link Bombs are Uncoordinated Sibel Adali Tina Liu Malik Magdon-Ismail Rensselaer Polytechnic Institute.
Collaborative Filtering  Introduction  Search or Content based Method  User-Based Collaborative Filtering  Item-to-Item Collaborative Filtering  Using.
Autumn Web Information retrieval (Web IR) Handout #1:Web characteristics Ali Mohammad Zareh Bidoki ECE Department, Yazd University
(with an application of Web Spam detection) CS315-Web Search and Mining Power Laws and Rich-Get-Richer Phenomena.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
ASSIST: Adaptive Social Support for Information Space Traversal Jill Freyne and Rosta Farzan.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
1 CS 430: Information Discovery Lecture 5 Ranking.
(with an application of Web Spam detection) CS315-Web Search and Mining Power Laws and Rich-Get-Richer Phenomena.
10/03/59 1 Recommendation Systems Sunantha Sodsee Information Technology King Mongkut’s University of Technology North Bangkok.
Measuring User Influence in Twitter: The Million Follower Fallacy Meeyoung Cha Hamed Haddadi Fabricio Benevenuto Krishna P. Gummadi.
Presented By: Madiha Saleem Sunniya Rizvi.  Collaborative filtering is a technique used by recommender systems to combine different users' opinions and.
Contact Info: Improving Decision Making: The use of simple heuristics Dr. Guillermo Campitelli Cognition Research Group Edith.
GRAPH AND LINK MINING 1. Graphs - Basics 2 Undirected Graphs Undirected Graph: The edges are undirected pairs – they can be traversed in any direction.
Using a model of Social Dynamics to Predict Popularity of News Kristina Lerman, Tad Hogg USC Information Sciences Institute, Institute for Molecular Manufacturing.
Opinion spam and Analysis 소프트웨어공학 연구실 G 최효린 1 / 35.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Network (graph) Models
Random Walk for Similarity Testing in Complex Networks
Data Mining: Concepts and Techniques
Link-Level Internet Structures
Generative Model To Construct Blog and Post Networks In Blogosphere
We want to analyze the general notion of popularity.
The likelihood of linking to a popular website is higher
Diffusion in Networks
Presentation transcript:

How to Analyse Social Network? : Part 2 Power Laws and Rich-Get-Richer Phenomena Thank you for all referred contexts and figures

Introduction A person's behavior or decisions always depend on the choices made by other people  The choices of other people convey information that is useful in the decision-making process. Conclusion: behavior is correlated across a population 2 Source: The fire caused a panic in the city…!!

Introduction Popularity is a phenomenon characterized by extreme imbalances: A few people achieve wider visibility A very, very few attain global name recognition 3 …compared to normal people

Introduction Power laws seem to dominate in cases where the quantity being measured can be viewed as a type of popularity. 4 Remark: Scale-Free Networks Some nodes are more highly connected than others are, which are called popular nodes. Popularity: High in-Degree value

Rich-Get-Richer Models Decision-making: People have a tendency to copy the decisions of people who act before them. 5 Ice Bucket Challenge

Rich-Get-Richer Models Example: Creation of links among Web pages  Pages are created in order, and named 1, 2, 3, …..,N.  When page j is created, it produces a link to an earlier Web page according to the following probabilistic rule With probability p, page j chooses a page i uniformly at random from among all earlier pages, and creates a link to this page i. With probability 1-p, page j instead chooses a page i uniformly at random from among all earlier pages, and creates a link to the page that i points to. 6

Rich-Get-Richer Models Example: Creation of links among Web pages After finding a random earlier page i in the population, the author of page j does not link to i, but instead copies the decision made by the author of page i -- linking to the same page that i did. This describes the creation of a single link from page j; one can repeat this process to create multiple, independently generated links from page j. With probability 1 - p, page j chooses a page i with probability proportional to i's current number of in-links, and creates a link to i. 7

Rich-Get-Richer Models Why do we call this a “rich-get-richer” rule?  Because: the probability that page i experiences an increase in popularity is directly proportional to i's current popularity. This phenomenon is also known as preferential attachment  Links are formed “preferentially” to pages that already have high popularity.  The copying model provides an operational story for why popularity should exhibit such rich-get-richer dynamics. The more well-known someone is, the more likely you are to hear their name 8

Applying “Preferential Attachment Concept” in Social Network Application” 9

10 Example: What are recommender systems? Recommender systems are systems which provide recommendations to a user  Too much information (information overload)  Users have too many choices Recommend different products for users, suited to their tastes.  Assist users in finding information  Reduce search and navigation time

11 Case Study: Amazon

12

13

14

15 Personalized Product Recommendation?

16

17

19 Which Sources of Information? Sources of information for recommendations: Browsing and searching data Purchase data Feedback provided by the users Textual comments Expert recommendations Rating

20 Type of Recommendations User-based  “Users who bought X like Y.”  Each user is represented by a vector indicating his ratings for each product.  Users with a small distance between each other are similar.  Find a similar user and recommend things they like that you haven’t rated.

21 Type of Recommendations Item-to-item  Content-based  One item is recommended based on the user’s indication that they like another item. If you like Lord of the Rings, you’ll like Legend.

22 Type of Recommendations Population-based => TREND!!  The most popular news articles, or searches, or downloads  Frequently add content  No user tracking needed.

Population-based Recommender System Preferential attachment is like some trendiness force:  a item that is well known in the market would have a greater probability to be chosen by a user. Movie Song Etc. 23

Population-based Recommender System REVIEW: Preferential Attachment  Nodes with higher degrees (i.e., with more links) acquire new links at higher rates than low-degree nodes  The probability that a link will connect a new node j with another existing node i is linearly proportional to the actual degree of i: 24

Population-based Recommender System A rating network is a bipartite network between persons and items they have rated.  The nodes are persons and items, and each edge connects a person with an item, and is annotated with a rating. 25 Source: U: Nodes V: Items

Population-based Recommender System A higher probability of selecting a popular item than an unknown one goods being sold depend on trendiness  Items that are well-known will have a higher probability of being bought 26 iPhone 6 Nokia 225

Population-based Recommender System REVIEW: Preferential Attachment 27 Small number of well-known items compared to regular ones

Rich-Get-Richer Models How to recommend items?  User Similarity Measure Distance Similarity: Euclidean Distance, City Block Distance..etc  Distance between a target user and any other users.  A vector is created for each user, accounting for his/her selected items. the closeness of users related with that item 28

Rich-Get-Richer Models How to recommend items?  Items in the top of the list are the best for the target user, and should be submitted to his/her attention Population-based Recommended Items 29 Problem: New Items?

Reference David Easley and Jon Kleinberg, Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press, Zanin, M., Cano P., Celma Ò., & Buldú J. M.,Preferential attachment, aging and weights in recommendation systems, International Journal of Bifurcation and Chaos, vol. 19, iss.2, pp ,