Xiaowei Ying, Xintao Wu Univ. of North Carolina at Charlotte PAKDD-09 April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks.

Slides:

Advertisements

Similar presentations

Suleyman Cetintas 1, Monica Rogati 2, Luo Si 1, Yi Fang 1 Identifying Similar People in Professional Social Networks with Discriminative Probabilistic.

Advertisements

Multi-label Relational Neighbor Classification using Social Context Features Xi Wang and Gita Sukthankar Department of EECS University of Central Florida.

Leting Wu Xiaowei Ying, Xintao Wu Aidong Lu and Zhi-Hua Zhou PAKDD 2011 Spectral Analysis of k-balanced Signed Graphs 1.

Community Detection Laks V.S. Lakshmanan (based on Girvan & Newman. Finding and evaluating community structure in networks. Physical Review E 69,

1 2.5K-Graphs: from Sampling to Generation Minas Gjoka, Maciej Kurant ‡, Athina Markopoulou UC Irvine, ETZH ‡

Xiaowei Ying, Xintao Wu, Daniel Barbara Spectrum based Fraud Detection in Social Networks 1.

Trust and Profit Sensitive Ranking for Web Databases and On-line Advertisements Raju Balakrishnan (Arizona State University)

Spectrum Based RLA Detection Spectral property : the eigenvector entries for the attacking nodes,, has the normal distribution with mean and variance bounded.

Frequent Subgraph Pattern Mining on Uncertain Graph Data

Xiaowei Ying Xintao Wu Univ. of North Carolina at Charlotte 2009 SIAM Conference on Data Mining, May 1, Sparks, Nevada Graph Generation with Prescribed.

1 Walking on a Graph with a Magnifying Glass Stratified Sampling via Weighted Random Walks Maciej Kurant Minas Gjoka, Carter T. Butts, Athina Markopoulou.

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.

Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.

Leting Wu Xiaowei Ying, Xintao Wu Dept. Software and Information Systems Univ. of N.C. – Charlotte Reconstruction from Randomized Graph via Low Rank Approximation.

Lecture 21: Spectral Clustering

Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.

Privacy Preserving Market Basket Data Analysis Ling Guo, Songtao Guo, Xintao Wu University of North Carolina at Charlotte.

Sampling from Large Graphs. Motivation Our purpose is to analyze and model social networks –An online social network graph is composed of millions of.

SAC’06 April 23-27, 2006, Dijon, France Towards Value Disclosure Analysis in Modeling General Databases Xintao Wu UNC Charlotte Songtao Guo UNC Charlotte.

Purnamrita Sarkar (UC Berkeley) Deepayan Chakrabarti (Yahoo! Research) Andrew W. Moore (Google, Inc.) 1.

Suppose I learn that Garth has 3 friends. Then I know he must be one of {v 1,v 2,v 3 } in Figure 1 above. If I also learn the degrees of his neighbors,

1 Fast Incremental Proximity Search in Large Graphs Purnamrita Sarkar Andrew W. Moore Amit Prakash.

CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.

Minas Gjoka, UC IrvineWalking in Facebook 1 Walking in Facebook: A Case Study of Unbiased Sampling of OSNs Minas Gjoka, Maciej Kurant ‡, Carter Butts,

The Union-Split Algorithm and Cluster-Based Anonymization of Social Networks Brian Thompson Danfeng Yao Rutgers University Dept. of Computer Science Piscataway,

The Very Small World of the Well-connected. (19 june 2008 ) Lada Adamic School of Information University of Michigan Ann Arbor, MI

Structure based Data De-anonymization of Social Networks and Mobility Traces Shouling Ji, Weiqing Li, and Raheem Beyah Georgia Institute of Technology.

Systematic Analysis of Interactome: A New Trend in Bioinformatics KOCSEA Technical Symposium 2010 Young-Rae Cho, Ph.D. Assistant Professor Department of.

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.

© Y. Zhu and Y. University of North Carolina at Charlotte, USA 1 Chapter 1: Social-based Routing Protocols in Opportunistic Networks Ying Zhu and.

Spectral coordinate of node u is its location in the k -dimensional spectral space: Spectral coordinates: The i ’th component of the spectral coordinate.

Purnamrita Sarkar (Carnegie Mellon) Deepayan Chakrabarti (Yahoo! Research) Andrew W. Moore (Google, Inc.)

Using Transactional Information to Predict Link Strength in Online Social Networks Indika Kahanda and Jennifer Neville Purdue University.

Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.

Undirected Models: Markov Networks David Page, Fall 2009 CS 731: Advanced Methods in Artificial Intelligence, with Biomedical Applications.

Glasgow 02/02/04 NN k networks for content-based image retrieval Daniel Heesch.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

Part 1: Biological Networks 1.Protein-protein interaction networks 2.Regulatory networks 3.Expression networks 4.Metabolic networks 5.… more biological.

Personalized Social Recommendations – Accurate or Private? A. Machanavajjhala (Yahoo!), with A. Korolova (Stanford), A. Das Sarma (Google) 1.

Spectral Analysis based on the Adjacency Matrix of Network Data Leting Wu Fall 2009.

Xiaowei Ying, Leting Wu, Xintao Wu University of North Carolina at Charlotte Privacy and Spectral Analysis on Social Network Randomization.

Xiaowei Ying, Xintao Wu Dept. Software and Information Systems Univ. of N.C. – Charlotte 2008 SIAM Conference on Data Mining, April 25 th Atlanta, Georgia.

1 Panther: Fast Top-K Similarity Search on Large Networks Jing Zhang 1, Jie Tang 1, Cong Ma 1, Hanghang Tong 2, Yu Jing 1, and Juanzi Li 1 1 Department.

Xintao Wu Jan 18, 2013 Retweeting Behavior and Spectral Graph Analysis in Social Media.

Privacy vs. Utility Xintao Wu University of North Carolina at Charlotte Nov 10, 2008.

Link Prediction Topics in Data Mining Fall 2015 Bruno Ribeiro

MCMC in structure space MCMC in order space.

When Affinity Meets Resistance On the Topological Centrality of Edges in Complex Networks Gyan Ranjan University of Minnesota, MN [Collaborators: Zhi-Li.

Privacy Protection in Social Networks Instructor: Assoc. Prof. Dr. DANG Tran Khanh Present : Bui Tien Duc Lam Van Dai Nguyen Viet Dang.

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.

Mix networks with restricted routes PET 2003 Mix Networks with Restricted Routes George Danezis University of Cambridge Computer Laboratory Privacy Enhancing.

Graph Data Management Lab, School of Computer Science Personalized Privacy Protection in Social Networks (VLDB2011)

Differential Privacy Xintao Wu Oct 31, Sanitization approaches Input perturbation –Add noise to data –Generalize data Summary statistics –Means,

Constructing and Analyzing a Gene Regulatory Network Siobhan Brady UC Davis.

MAIN RESULT: We assume utility exhibits strategic complementarities. We show: Membership in larger k-core implies higher actions in equilibrium Higher.

Markov Networks: Theory and Applications Ying Wu Electrical Engineering and Computer Science Northwestern University Evanston, IL 60208

Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.

Xiaowei Ying, Kai Pan, Xintao Wu, Ling Guo Univ. of North Carolina at Charlotte SNA-KDD June 28, 2009, Paris, France Comparisons of Randomization and K-degree.

Link Prediction Class Data Mining Technology for Business and Society

Random Walk for Similarity Testing in Complex Networks

Lecture 11 Graph Algorithms

Sofus A. Macskassy Fetch Technologies

Link Prediction Seminar Social Media Mining University UC3M

Graph Analysis by Persistent Homology

Plum Pudding Models for Growing Small-World Networks

Asymmetric Transitivity Preserving Graph Embedding

CS639: Data Management for Data Science

Lecture 10 Graph Algorithms

PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs.

Presentation transcript:

Xiaowei Ying, Xintao Wu Univ. of North Carolina at Charlotte PAKDD-09 April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Motivation Privacy Preserving Social Network Publishing node-anonymization cannot guarantee identity/link privacy due to subgraph queries. Backstrom et al. WWW07, Hay et al. UMass TR07 edge randomization Random Add/Del Random Switch K-anonymity Hay et al. VLDB08, Liu&Terzi SIGMOD08, Zhou&Pei ICDE08 Utility preserving randomization Spectral feature preserving Ying&Wu SDM08 Real space feature preserving Ying&Wu SDM09 2

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Problem Formalization 3 Prior beliefvs. Posterior belief Ying&Wu SDM08 similarity measure value between node i and j This paper Add k then del k edges

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Network of US political books (105 nodes, 441 edges, r=8%) Books about US politics sold by Amazon.com. Edges represent frequent co-purchasing of books by the same buyers. Nodes have been given colors of blue, white, or red to indicate whether they are "liberal", "neutral", or "conservative". 4 Polbooks network

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Proportion of true edges vs. similarity 5 After randomly add/delete 200 edges (totally 441 edges)

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Similarity measures vs. Link prediction Similarity measures The number of common neighbors Adamic/Adar, the weighted number of common neighbors Katz, a weighted sum of the number of paths connecting two nodes Commute time, the expected steps of random walks from node i to j and back to i. Similarity measures have been exploited in the classic link prediction problem. Liben-Nowell&Kleinberg CIKM03 6

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Proportion of true edges vs. similarity 7 After randomly add/delete 200 edges (totally 441 edges)

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Calculating Posterior belief 8 The attacker does not know this value, what he can do? Applying Bayes theorem

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks MLE estimation Estimate based on randomized graph 9 Posterior belief can be calculated by attackers

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Comparison 10

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Comparison 11

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Empirical Evaluation Attacker’s Prediction Strategy Calculate posterior probability of all node pairs Choose top t node pairs (with highest post. Prob.) as predicted candidate links 12 For each t, the precision of predictions (k=0.5m)

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Empirical Evaluation 13 The posteriori beliefs with similarity measures achieve higher precision than that without exploiting similarity measures. One measure that is best for one data is not necessarily best for another data.

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Determining k to guarantee privacy 14 Data Owner

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Conclusion & Future Work We have shown that node proximity measures can be exploited by attackers to breach link privacy in edge add/del randomized networks 15 How about other topological properties? How about other randomization strategies? Privacy vs. utility tradeoff

Questions? Acknowledgments This work was supported in part by U.S. National Science Foundation IIS and CNS Thank You! 16

PAKDD-09, April 28, Bangkok, Thailand On Link Privacy in Randomizing Social Networks Graph space : {G: with the given degree seq. & } Examining proportion of sample graphs with existence a link between node i and j Ying&Wu,SDM09 17 Utility preserving randomization Attacker’s confidence on link (i,j)