Carnegie Mellon School of Computer Science Modeling Website Popularity Competition in the Attention-Activity Marketplace Bruno Ribeiro Christos Faloutsos.

Slides:



Advertisements
Similar presentations
1 Dynamics of Real-world Networks Jure Leskovec Machine Learning Department Carnegie Mellon University
Advertisements

LEARNING INFLUENCE PROBABILITIES IN SOCIAL NETWORKS Amit Goyal Francesco Bonchi Laks V. S. Lakshmanan University of British Columbia Yahoo! Research University.
Influence and Passivity in Social Media Daniel M. Romero, Wojciech Galuba, Sitaram Asur, and Bernardo A. Huberman Social Computing Lab, HP Labs.
Interacting Viruses: Can Both Survive? Alex Beutel, B. Aditya Prakash, Roni Rosenfeld, Christos Faloutsos Carnegie Mellon University, USA KDD 2012, Beijing.
Cost-effective Outbreak Detection in Networks Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, Natalie Glance.
The transition challenge for hydrogen vehicles; analysis of adoption dynamics Jeroen Struben*) MIT Sloan School of Management April *) Many thanks.
Consumer Behavior Prediction using Parametric and Nonparametric Methods Elena Eneva CALD Masters Presentation 19 August 2002 Advisors: Alan Montgomery,
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
CIKM’2008 Presentation Oct. 27, 2008 Napa, California
Cascading Behavior in Large Blog Graphs Patterns and a Model Leskovec et al. (SDM 2007)
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation Edith C.H. Ngai and Michael R.
Web as Graph – Empirical Studies The Structure and Dynamics of Networks.
Detecting Fraudulent Personalities in Networks of Online Auctioneers Duen Horng (“Polo”) Chau Shashank Pandit Christos Faloutsos School of Computer Science.
| Alper Ortac | Computer Science Department | Ubiquitous Knowledge Processing Lab | © Prof. Dr. Iryna Gurevych | 1 Knowledge Management in Web.
Computing Trust in Social Networks
Social Networking.
Carnegie Mellon School of Computer Science Understanding SMT without the “S” (Statistics) Robert Frederking.
Impact of Problem Centralization on Distributed Constraint Optimization Algorithms John P. Davin and Pragnesh Jay Modi Carnegie Mellon University School.
Research Priorities in Open Source Software Development James D. Herbsleb Institute for Software Research, International School of Computer Science Carnegie.
The Socio-monetary Incentives of Online Social Network Malware Campaigns Ting-Kai Huang (Google) Bruno Ribeiro (Carnegie Mellon University) Harsha M. Madhyastha.
A Social Help Engine for Online Social Network Mobile Users Tam Vu, Akash Baid WINLAB, Rutgers University May 21,
A Distributed and Privacy Preserving Algorithm for Identifying Information Hubs in Social Networks M.U. Ilyas, Z Shafiq, Alex Liu, H Radha Michigan State.
Multigraph Sampling of Online Social Networks Minas Gjoka, Carter Butts, Maciej Kurant, Athina Markopoulou 1Multigraph sampling.
Web 2.0 for Businesses How You Can Use Social Media to Bring in Money & Promote Your Brand Kimberly L. Sanberg Director of Online Strategy, Ignitus presentation.
University of California at Santa Barbara Christo Wilson, Bryce Boe, Alessandra Sala, Krishna P. N. Puttaswamy, and Ben Zhao.
Prof. A. Taleb-Bendiab, Talk: SOAS’07, Contact: Date: 12/09/2015, Slide: 1 Software Engineering Concerns in Observing Autonomic.
OSN Research As If Sociology Mattered Krishna P. Gummadi Networked Systems Research Group MPI-SWS.
Influence and Correlation in Social Networks Priyanka Garg.
Using Transactional Information to Predict Link Strength in Online Social Networks Indika Kahanda and Jennifer Neville Purdue University.
A Media-based Social Interactions Analysis Procedure Alan Keller Gomes and Maria da Graça Campos Pimentel SAC’12 17 March 2015 Hyewon Lim.
Network Characterization via Random Walks B. Ribeiro, D. Towsley UMass-Amherst.
Jure Leskovec PhD: Machine Learning Department, CMU Now: Computer Science Department, Stanford University.
Wei-Li Liu. + Goal: a. Do research on the history of social networking b. Compare the features of some of the past popular social networking sites c.
Marketing To Grow Your Business - Public Relations.
Influence Maximization in Dynamic Social Networks Honglei Zhuang, Yihan Sun, Jie Tang, Jialin Zhang, Xiaoming Sun.
Viral Video Style: A Closer Look at Viral Videos on YouTube Lu Jiang, Yajie Miao, Yi Yang, Zhenzhong Lan, Alexander G. Hauptmann School of Computer Science,
To Blog or Not to Blog: Characterizing and Predicting Retention in Community Blogs Imrul Kayes 1, Xiang Zuo 1, Da Wang 2, Jacob Chakareski 3 1 University.
Chengjie Sun,Lei Lin, Yuan Chen, Bingquan Liu Harbin Institute of Technology School of Computer Science and Technology 1 19/11/ :09 PM.
Thang N. Dinh, Dung T. Nguyen, My T. Thai Dept. of Computer & Information Science & Engineering University of Florida, Gainesville, FL Hypertext-2012,
Interacting Viruses in Networks: Can Both Survive? Authors: Alex Beutel, B. Aditya Prakash, Roni Rosenfeld, and Christos Faloutsos Presented by: Zachary.
Social Networking Online Shopping Entertainm ent Digital Imagery School Work.
1 Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Winner-takes-all: Competing Viruses or Ideas on fair-play Networks B. Aditya Prakash, Alex Beutel, Roni Rosenfeld, Christos Faloutsos Carnegie Mellon University,
How Data Science Helps Prevent Churn at Avira, a 100-million User Company Calin-Andrei Burloiu Big Data Engineer Iulia Paov Machine Learning Engineer Strata.
Bruno Ribeiro Don Towsley University of Massachusetts Amherst IMC 2010 Melbourne, Australia.
Exploit of Online Social Networks with Community-Based Graph Semi-Supervised Learning Mingzhen Mo and Irwin King Department of Computer Science and Engineering.
Measuring Behavioral Trust in Social Networks
Du, Faloutsos, Wang, Akoglu Large Human Communication Networks Patterns and a Utility-Driven Generator Nan Du 1,2, Christos Faloutsos 2, Bai Wang 1, Leman.
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs Leman Akoglu, Mary McGlohon, Christos Faloutsos Carnegie Mellon University School.
Streaming Pattern Discovery in Multiple Time-Series Jimeng Sun Spiros Papadimitrou Christos Faloutsos PARALLEL DATA LABORATORY Carnegie Mellon University.
The Distributive Property Chapter 1.6. Review multiplication.
@ Carnegie Mellon Databases 1 Finding Frequent Items in Distributed Data Streams Amit Manjhi V. Shkapenyuk, K. Dhamdhere, C. Olston Carnegie Mellon University.
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
A Connectivity-Based Popularity Prediction Approach for Social Networks Huangmao Quan, Ana Milicic, Slobodan Vucetic, and Jie Wu Department of Computer.
B101 Coursework Assignment Pushkar Patel
Sofus A. Macskassy Fetch Technologies
Distributed voting application for handheld devices
What Stops Social Epidemics?
Non-linear Mining of Competing Local Activities
Power Law Structure Weili Wu Ding-Zhu Du Univ of Texas at Dallas
E-Commerce Theories & Practices
Center for Complexity in Business, R. Smith School of Business
Recovering Temporally Rewiring Networks: A Model-based Approach
Cost-effective Outbreak Detection in Networks
Consumer Markets and Consumer Buyer Behavior
Paper ID: XX Track: Track Name
C. Faloutsos Transactions
Presentation transcript:

Carnegie Mellon School of Computer Science Modeling Website Popularity Competition in the Attention-Activity Marketplace Bruno Ribeiro Christos Faloutsos Carnegie Mellon University WSDM 2015 February 5, 2015

Bruno Ribeiro Carnegie Mellon School of Computer Science 2 Motivation  Bought for $580 million in 2005  Sold for $35 million in 2011 *source: TechCrunch MySpace’s demise Sold Hi5 Friendster Summer 2008

Bruno Ribeiro Carnegie Mellon School of Computer Science 3 Predicting Network Popularity w/ Competition Goal: Why: ? ? ? Summer 2008 Fraction of Active Users (t) -$545 million dollars

Bruno Ribeiro Carnegie Mellon School of Computer Science new adopters/semester 4 MySpace.com until late 2008 No Structural Telltale Signs of MySpace’s Demise Matches known theoretical behavior Mansfield’61, Rogers’03, Bass’69 Total Adopters And no abrupt topological changes in 2008 MySpace graph until recently: 35 million users ★

Bruno Ribeiro Carnegie Mellon School of Computer Science Economics: ◦ (Mansfield ’63) ◦ (Katz&Shapiro’85) ◦ (Farrell&Saloner ’86) ◦ (Choi ’94) ◦ (Arthur ’94) Marketing: ◦ (Bass ’69) ◦ (Fisher&Pry ’71) Fraction of Active Users (t) Summer 2008 Background: Vast Adoption Literature 5 Computer Science:  (Kempe et al ’03)  (Zhao et al., IMC’12)  (Leskovec et al., SIGKDD’08)  (Ugander et al., PNAS’12)  (Aral&Walker, Science’12) Sociology: o (Ryan&Gross’49) o (Everett ’62, ’03) o (Rogers ’03) o (Centola ’12) Adopt ≠ Active We know how to model adoption But how to model attention?

Bruno Ribeiro Carnegie Mellon School of Computer Science  H. A. Simon on information overload:  Information consumes attention (time) ◦ Information-rich world  Attention-poor world  Systems that “talk” more than “think” exacerbate information overload 6 Attention & Information Overload

Bruno Ribeiro Carnegie Mellon School of Computer Science  Facebook attention & activity 7 How Facebook Talks (a lot)

Bruno Ribeiro Carnegie Mellon School of Computer Science My Attention My Content Friends’ Attention Friends’ Content 8 Positive & Negative Attention Loops Positive Growth Negative Growth Website Survives Website Dies

Bruno Ribeiro Carnegie Mellon School of Computer Science 9 Proposed Competition Model

Bruno Ribeiro Carnegie Mellon School of Computer Science 10 Proposed State Space states ∅y∅y UyUy AyAy IyIy ∅x∅x UxUx AxAx IxIx Both x & y Only y for nowOnly x for now Neither for nowNot interested in x/y User Subscribes to: Website Killers Never!UnawareActiveInactive

Bruno Ribeiro Carnegie Mellon School of Computer Science 11 Model Transitions User Competition

Bruno Ribeiro Carnegie Mellon School of Computer Science 12 Isolated Network Transitions states ∅y∅y UyUy AyAy IyIy SUM ∅x∅x UxUx S (U, ∅ ) (t) AxAx S (A, ∅ ) (t)S (A,*) (t) IxIx S (I, ∅ ) (t) Media/Marketing gets new subscribers Word of mouth gets subscribers Network x activity attracts user back Other activity takes user away from x Details

Bruno Ribeiro Carnegie Mellon School of Computer Science Model Predictions with Constant Distraction Factor 13  Predicting Online Social Network Popularity ◦ How websites do on their own ◦ Evolution with competition Outline

Bruno Ribeiro Carnegie Mellon School of Computer Science Signatures of Self-Sustainability  Long-term User Activity [Ribeiro’14] 14 Relative attractiveness of activity Fraction of Active Users (t) t t ≅1≅1

Bruno Ribeiro Carnegie Mellon School of Computer Science Signatures of Popularity Growth  Model prediction: Signatures of activity growth [Ribeiro’14] 15 t t Fraction of Active Users (t) Word of mouth Media & Marketing

Bruno Ribeiro Carnegie Mellon School of Computer Science Predictions with Changing Distractions 16 t  Predicting Online Social Network Popularity ◦ How websites do on their own ◦ Evolution with competition Outline

Bruno Ribeiro Carnegie Mellon School of Computer Science  Two observable states: S (A,*) (t) and S (*,A) (t)  Remaining states latent & treated as parameters  Data from Alexa.com  Fitted with Levenberg–Marquardt algorithm using squared error 17 Model Fitting S (A,*) (t) S (I,*) (t)? S (U,*) (t)? S (A,I) (t)? S (A,A) (t)? S (A,U) (t)? S (A, ∅ ) (t)? S (I, ∅ ) (t)? S (U, ∅ ) (t)? friendster.com Fraction of Active Users (t) Details

Bruno Ribeiro Carnegie Mellon School of Computer Science MySpace Friendster Multiply Hi5 18 Facebook Introduces Wall Distraction of Concurrent Users Increases as Facebook Introduces Wall Distraction of Concurrent Users Increases as Facebook Introduces Wall

Bruno Ribeiro Carnegie Mellon School of Computer Science 19 Results (Facebook x MySpace) t value

Bruno Ribeiro Carnegie Mellon School of Computer Science 20 Results (Facebook x Multiply) t value Multiply

Bruno Ribeiro Carnegie Mellon School of Computer Science 21 Results (Facebook x Hi5) t value Hi5

Bruno Ribeiro Carnegie Mellon School of Computer Science 22 Results (Facebook x Hi5) Model Captures Coexistence and Then Death of Facebook Competitors Too Many Concurrent Users = Fragility Model Captures Coexistence and Then Death of Facebook Competitors Too Many Concurrent Users = Fragility

Bruno Ribeiro Carnegie Mellon School of Computer Science  Attention feedback helps predict / understand network survival  No marketing can save from negative attention loop  Insights from model ◦ E.g.: Metrics of node centrality should take attention feedback into account 23 Conclusions

Bruno Ribeiro Carnegie Mellon School of Computer Science Thank you! Questions? 24

Bruno Ribeiro Carnegie Mellon School of Computer Science 25 Attention Competition Transitions states ∅y∅y UyUy AyAy IyIy SUM: ∅x∅x UxUx S (U,A) (t) AxAx S (A,U) (t)S (A,A) (t)S (A,I) (t ) S (A,*) (t) IxIx S (I,A) (t) SUM:S (*,A) (t) Both x & y Only y for now Only x for now Neither for now Media/Marketing new subscribers Word of mouth subscribers Not interested in x/y Only parameter affected by attention competition “Geek factor” User Subscribes to: Details