Hao Ma, Haixuan Yang, Michael R. Lyu and Irwin King CIKM, 2008.

Slides:



Advertisements
Similar presentations
Complex Networks for Representation and Characterization of Images For CS790g Project Bingdong Li 9/23/2009.
Advertisements

Correlation Search in Graph Databases Yiping Ke James Cheng Wilfred Ng Presented By Phani Yarlagadda.
Minimizing Seed Set for Viral Marketing Cheng Long & Raymond Chi-Wing Wong Presented by: Cheng Long 20-August-2011.
Contextual Advertising by Combining Relevance with Click Feedback D. Chakrabarti D. Agarwal V. Josifovski.
Learning to Recommend Hao Ma Supervisors: Prof. Irwin King and Prof. Michael R. Lyu Dept. of Computer Science & Engineering The Chinese University of Hong.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
CIKM’2008 Presentation Oct. 27, 2008 Napa, California
Graph Data Management Lab School of Computer Science , Bristol, UK.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 SCAN: A Structural Clustering Algorithm for Networks Xiaowei.
Intelligent Database Systems Lab N.Y.U.S.T. I. M. Discovering Leaders from Community Actions Presenter : Wu, Jia-Hao Authors : Amit Goyal, Francesco Bonchi,
1 DiffusionRank: A Possible Penicillin for Web Spamming Haixuan Yang Group Meeting Jan. 16, 2006.
Integrating Bayesian Networks and Simpson’s Paradox in Data Mining Alex Freitas University of Kent Ken McGarry University of Sunderland.
Augustin Chaintreau Pierre FraigniaudEmmanuelle Lebhar ThomsonCNRSCNRS ParisUniversite Paris DiderotUniversite Paris Diderot Paper Discussed by: Ranjeet.
Chen Cheng1, Haiqin Yang1, Irwin King1,2 and Michael R. Lyu1
Re-examining the cascade problem: “... most of the time the system is completely stable, even in the face of external shocks. But once in a while, for.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Social Network Analysis via Factor Graph Model
Using Friendship Ties and Family Circles for Link Prediction Elena Zheleva, Lise Getoor, Jennifer Golbeck, Ugur Kuter (SNAKDD 2008)
Kansas State University Department of Computing and Information Sciences CIS 830: Advanced Topics in Artificial Intelligence From Data Mining To Knowledge.
Research Methods Key Points What is empirical research? What is the scientific method? How do psychologists conduct research? What are some important.
Focused Matrix Factorization for Audience Selection in Display Advertising BHARGAV KANAGAL, AMR AHMED, SANDEEP PANDEY, VANJA JOSIFOVSKI, LLUIS GARCIA-PUEYO,
Intelligent Database Systems Lab Presenter: MIN-CHIEH HSIU Authors: NHAT-QUANG DOAN ∗, HANANE AZZAG, MUSTAPHA LEBBAH 2013 NN Growing self-organizing trees.
11 World-Leading Research with Real-World Impact! Towards Provenance and Risk-Awareness in Social Computing Yuan Cheng, Dang Nguyen, Khalid Bijon, Ram.
Online Learning for Collaborative Filtering
Predicting Positive and Negative Links in Online Social Networks
Data Mining Algorithms for Large-Scale Distributed Systems Presenter: Ran Wolff Joint work with Assaf Schuster 2003.
Jing (Selena) He and Hisham M. Haddad Department of Computer Science, Kennesaw State University Shouling Ji, Xiaojing Liao, and Raheem Beyah School of.
Zibin Zheng DR 2 : Dynamic Request Routing for Tolerating Latency Variability in Cloud Applications CLOUD 2013 Jieming Zhu, Zibin.
National Taiwan University PEAKASO: Peak-Temperature Aware Scan- Vector Optimization Minsik Cho and David Z. Pan Dept. of ECE The University of Texas at.
A Local Seed Selection Algorithm for Overlapping Community Detection 1 A Local Seed Selection Algorithm for Overlapping Community Detection Farnaz Moradi,
Consumer Markets and Consumer Buying Behavior
MT 219 Marketing Unit Three Consumer and Business Buyer Behavior Note: This seminar will be recorded by the instructor.
1 Heat Diffusion Classifier on a Graph Haixuan Yang, Irwin King, Michael R. Lyu The Chinese University of Hong Kong Group Meeting 2006.
LOGO Identifying Opinion Leaders in the Blogosphere Xiaodan Song, Yun Chi, Koji Hino, Belle L. Tseng CIKM 2007 Advisor : Dr. Koh Jia-Ling Speaker : Tu.
Panther: Fast Top-k Similarity Search in Large Networks JING ZHANG, JIE TANG, CONG MA, HANGHANG TONG, YU JING, AND JUANZI LI Presented by Moumita Chanda.
Recommender Systems with Social Regularization Hao Ma, Dengyong Zhou, Chao Liu Microsoft Research Michael R. Lyu The Chinese University of Hong Kong Irwin.
1 Friends and Neighbors on the Web Presentation for Web Information Retrieval Bruno Lepri.
Intelligent Database Systems Lab Presenter: NENG-KAI, HONG Authors: HUAN LONG A, ZIJUN ZHANG A, ⇑, YAN SU 2014, APPLIED ENERGY Analysis of daily solar.
Divided Pretreatment to Targets and Intentions for Query Recommendation Reporter: Yangyang Kang /23.
NTU & MSRA Ming-Feng Tsai
Speaker : Yu-Hui Chen Authors : Dinuka A. Soysa, Denis Guangyin Chen, Oscar C. Au, and Amine Bermak From : 2013 IEEE Symposium on Computational Intelligence.
Analyzing and Predicting Question Quality in Community Question Answering Services Baichuan Li, Tan Jin, Michael R. Lyu, Irwin King, and Barley Mak CQA2012,
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Mining Advisor-Advisee Relationships from Research Publication.
MMM2005The Chinese University of Hong Kong MMM2005 The Chinese University of Hong Kong 1 Video Summarization Using Mutual Reinforcement Principle and Shot.
Scalable Learning of Collective Behavior Based on Sparse Social Dimensions Lei Tang, Huan Liu CIKM ’ 09 Speaker: Hsin-Lan, Wang Date: 2010/02/01.
What is Research?. Intro.  Research- “Any honest attempt to study a problem systematically or to add to man’s knowledge of a problem may be regarded.
Chapter Five Consumer Markets and Consumer Buyer Behavior.
Collaborative Filtering - Pooja Hegde. The Problem : OVERLOAD Too much stuff!!!! Too many books! Too many journals! Too many movies! Too much content!
Hao Ma, Dengyong Zhou, Chao Liu Microsoft Research Michael R. Lyu
1 Zi Yang Tsinghua University Joint work with Prof. Jie Tang, Prof. Juanzi Li, Dr. Keke Cai, Jingyi Guo, Chi Wang, etc. July 21, 2011, CASIN 2011, Tsinghua.
1 Zi Yang Tsinghua University Joint work with Prof. Jie Tang, Prof. Juanzi Li, Dr. Keke Cai, Jingyi Guo, Chi Wang, etc. July 21, 2011, CASIN 2011, Tsinghua.
Profiling: What is it? Notes and reflections on profiling and how it could be used in process mining.
Bridging Domains Using World Wide Knowledge for Transfer Learning
Consumer Markets and Consumer Buying Behavior
Syntax-based Deep Matching of Short Texts
WSRec: A Collaborative Filtering Based Web Service Recommender System
Course: Autonomous Machine Learning
Using Friendship Ties and Family Circles for Link Prediction
Location Recommendation — for Out-of-Town Users in Location-Based Social Network Yina Meng.
Consumer markets and consumer buyer behavior
RECOMMENDER SYSTEMS WITH SOCIAL REGULARIZATION
iSRD Spam Review Detection with Imbalanced Data Distributions
Presented by: Jacky Ma Date: 11 Dec 2001
Binghui Wang, Le Zhang, Neil Zhenqiang Gong
Example: Academic Search
Graph-based Security and Privacy Analytics via Collective Classification with Joint Weight Learning and Propagation Binghui Wang, Jinyuan Jia, and Neil.
GANG: Detecting Fraudulent Users in OSNs
Three steps are separately conducted
Binhai Zhu Computer Science Department, Montana State University
Modeling Topic Diffusion in Scientific Collaboration Networks
Presentation transcript:

Mining Social Networks Using Heat Diffusion Processes for marketing candidates selection Hao Ma, Haixuan Yang, Michael R. Lyu and Irwin King CIKM, 2008. Reported by Wen-Chung Liao, 2009/10/6

Outlines Motivation Objectives Diffusion models Marketing candidates selection algorithms and their complexity Empirical analysis Conclusions Comments

Motivation Due to the complexity of social networks, few models exist to interpret social network marketing realistically. Studies of innovation diffusions, they were descriptive, rather than predictive they are built at a very coarse level, typically with only a few global parameters and are not useful for making actual predictions of the future behavior of the network.

Objectives Model social network marketing using Heat Diffusion Processes. Presents three diffusion models, along with three algorithms for selecting the best individuals to receive marketing samples.

HEAT DIFFUSION MODELS The process of people influencing others is very similar to the heat diffusion phenomenon. In a social network, the innovators and early adopters of a product or innovation act as heat sources.

Diffusion on Undirected Social Networks G = (V,E) V is the vertex set, and V = {v1, v2, . . . , vn}. E is the set of all edges (vi, vj ). fi(t) describes the heat at node vi at time t fi(0) initial value. f(t) denotes the vector consisting of fi(t). M(i, j, Δt): amount of heat from node j to node i during a period Δt

Diffusion on Directed Social Networks Diffusion on Directed Social Networks with Prior Knowledge

Marketing candidates selection O(N(PM+N +N logN)) O(kN(PM +N +d)) O(N(PM +N +kd))

EMPIRICAL ANALYSIS Epinions maintains a “trust” list which presents a network of trust relationships between users, product categories, “Kids & Family” 75,888 users, and 508,960 edges the initial heat vector f(0), choose N/k the thermal conductivity value α, set α= 1 the adoption threshold θ, set θ = 0.6 t = 0.10, t = 0.15 and t = 0.20, unit??? Scenario: 1 to 20 product samples (k =20) the marketing candidates? performance (measured by the value of coverage) ?

EMPIRICAL ANALYSIS

Conclusion Propose a social network marketing framework which includes three diffusion models and three marketing candidates selection algorithms. Model social network marketing as realistically as possible Can defend against diffusion of negative information, This framework is scalable.

Comments Advantage Realistic & scalable. Defend against diffusion of negative information Shortage Static social network. My opinion: