research-article

Open access

Efficient Algorithms for Public-Private Social Networks

Authors:

Flavio Chierichetti,

Alessandro Epasto,

Silvio Lattanzi,

Vahab MirrokniAuthors Info & Claims

KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Pages 139 - 148

https://doi.org/10.1145/2783258.2783354

Published: 10 August 2015 Publication History

Abstract

We introduce the public-private model of graphs. In this model, we have a public graph and each node in the public graph has an associated private graph. The motivation for studying this model stems from social networks, where the nodes are the users, the public graph is visible to everyone, and the private graph at each node is visible only to the user at the node. From each node's viewpoint, the graph is just a union of its private graph and the public graph.

We consider the problem of efficiently computing various properties of the graphs from each node's point of view, with minimal amount of recomputation on the public graph. To illustrate the richness of our model, we explore two powerful computational paradigms for studying large graphs, namely, sketching and sampling, and focus on some key problems in social networks and show efficient algorithms in the public-private graph model. In the sketching model, we show how to efficiently approximate the neighborhood function, which in turn can be used to approximate various notions of centrality. In the sampling model, we focus on all-pair shortest path distances, node similarities, and correlation clustering.

Supplementary Material

MP4 File (p139.mp4)

Download
126.43 MB

References

[1]

K. J. Ahn, S. Guha, and A. McGregor. Analyzing graph structure via linear measurements. In SODA, pages 459--467, 2012.

Digital Library

[2]

K. J. Ahn, S. Guha, and A. McGregor. Graph sketches: sparsification, spanners, and subgraphs. In PODS, pages 5--14, 2012.

Digital Library

[3]

N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: Ranking and clustering. JACM, 55(5), 2008.

Digital Library

[4]

R. Andersen, F. Chung, and K. Lang. Local partitioning for directed graphs using pagerank. Internet Mathematics, 5(1--2):3--22, 2008.

[5]

N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, 56(1--3):89--113, 2004.

Digital Library

[6]

T. Y. Berger-Wolf and J. Saia. A framework for analysis of dynamic social networks. In KDD, pages 523--528, 2006.

Digital Library

[7]

P. Boldi, M. Rosa, and S. Vigna. HyperANF: approximating the neighbourhood function of very large graphs on a budget. In WWW, pages 625--634, 2011.

Digital Library

[8]

P. Boldi and S. Vigna. In-core computation of geometric centralities with hyperball: A hundred billion nodes and beyond. In ICDM Workshops, pages 621--628, 2013.

Digital Library

[9]

M. Charikar. Greedy approximation algorithms for finding dense components in a graph. In APPROX, pages 84--95, 2000.

Digital Library

[10]

E. Cohen. Size-estimation framework with applications to transitive closure and reachability. JCSS, 55:441--453, 1997.

Digital Library

[11]

E. Cohen. All-distances sketches, revisited: HIP estimators for massive graphs analysis. In PODS, pages 88--99, 2014.

Digital Library

[12]

E. Cohen and H. Kaplan. Summarizing data using bottom-k sketches. In PODC, pages 225--234, 2007.

Digital Library

[13]

A. Dasgupta, R. Kumar, and T. Sarlós. On estimating the average degree. In WWW, pages 795--806, 2014.

Digital Library

[14]

C. Demetrescu, D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In M. J. Atallah and M. Blanton, editors, Algorithms and Theory of Computation Handbook, pages 9--9. Chapman & Hall/CRC, 2010.

Digital Library

[15]

C. Demetrescu and G. F. Italiano. A new approach to dynamic all pairs shortest paths. JACM, 51(6):968--992, 2004.

Digital Library

[16]

R. Dey, Z. Jelveh, and K. W. Ross. Facebook users have become much more private: A large-scale study. In PerCom Workshops, 2012.

[17]

S. J. Hardiman and L. Katzir. Estimating clustering coefficients and size of social networks via random walk. In WWW, pages 539--550, 2013.

Digital Library

[18]

T. H. Haveliwala. Topic-sensitive pagerank. In WWW, pages 517--526, 2002.

Digital Library

[19]

J. Holm, K. de Lichtenberg, and M. Thorup. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. JACM, 48(4):723--760, 2001.

Digital Library

[20]

G. Jeh and J. Widom. Scaling personalized web search. In WWW, pages 271--279. ACM, 2003.

Digital Library

[21]

L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1):39--43, 1953.

[22]

L. Katzir, E. Liberty, and O. Somekh. Estimating sizes of social networks via biased sampling. In WWW, pages 597--606, 2011.

Digital Library

[23]

V. King. Fully dynamic connectivity. In Encyclopedia of Algorithms. Springer, 2008.

[24]

V. King. Fully dynamic transitive closure. In Encyclopedia of Algorithms. Springer, 2008.

[25]

J. Leskovec, D. P. Huttenlocher, and J. M. Kleinberg. Predicting positive and negative links in online social networks. In WWW, pages 641--650, 2010.

Digital Library

[26]

J. Leskovec, D. P. Huttenlocher, and J. M. Kleinberg. Signed networks in social media. In CHI, pages 1361--1370, 2010.

Digital Library

[27]

J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. TKDD, 1(1), 2007.

Digital Library

[28]

A. McGregor. Graph stream algorithms: a survey. SIGMOD Record, 43(1):9--20, 2014.

Digital Library

[29]

C. R. Palmer, P. B. Gibbons, and C. Faloutsos. ANF: a fast and scalable tool for data mining in massive graphs. In KDD, pages 81--90, 2002.

Digital Library

[30]

R. Panigrahy, M. Najork, and Y. Xie. How user behavior is related to social affinity. In WSDM, pages 713--722, 2012.

Digital Library

[31]

M. Ripeanu, A. Iamnitchi, and I. T. Foster. Mapping the Gnutella network. IEEE Internet Computing, 6(1):50--57, 2002.

Digital Library

[32]

A. D. Sarma, S. Gollapudi, M. Najork, and R. Panigrahy. A sketch-based distance oracle for web-scale graphs. In WSDM, pages 401--410, 2010.

Digital Library

[33]

C. Tantipathananandh, T. Y. Berger-Wolf, and D. Kempe. A framework for community identification in dynamic social networks. In KDD, pages 717--726, 2007.

Digital Library

[34]

J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-truth. In ICDM, pages 745--754, 2012.

Digital Library

Cited By

Azad AFang YBaeza-Yates RBonchi F(2024)A Learned Generalized Geodesic Distance Function-Based Approach for Node Feature Augmentation on GraphsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671858(49-58)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671858
Esfandiari HKacham PMirrokni VWoodruff DZhong PMohar BShinkar IO'Donnell R(2024)Optimal Communication Bounds for Classic Functions in the Coordinator Model and BeyondProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649742(1911-1922)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649742
Amati GCruciani APasquini DVocca PAngelini S(2023)propagate: A Seed Propagation Framework to Compute Distance-Based Metrics on Very Large GraphsMachine Learning and Knowledge Discovery in Databases: Research Track10.1007/978-3-031-43418-1_40(671-688)Online publication date: 17-Sep-2023
https://doi.org/10.1007/978-3-031-43418-1_40
Show More Cited By

Index Terms

Efficient Algorithms for Public-Private Social Networks
1. Information systems
  1. Information systems applications
    1. Data mining
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms

Recommendations

Optimal Distributed Submodular Optimization via Sketching
KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

We present distributed algorithms for several classes of submodular optimization problems such as k-cover, set cover, facility location, and probabilistic coverage. The new algorithms enjoy almost optimal space complexity, optimal approximation ...
Composable core-sets for diversity and coverage maximization
PODS '14: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

In this paper we consider efficient construction of "composable core-sets" for basic diversity and coverage maximization problems. A core-set for a point-set in a metric space is a subset of the point-set with the property that an approximate solution ...
Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs
WWW '14: Proceedings of the 23rd international conference on World wide web

We study the problem of computing similarity rankings in large-scale multi-categorical bipartite graphs, where the two sides of the graph represent actors and items, and the items are partitioned into an arbitrary set of categories. The problem has ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

August 2015

2378 pages

ISBN:9781450336642

DOI:10.1145/2783258

General Chairs:
Longbing Cao
University of Technology, Sydney
,
Chengqi Zhang
University of Technology, Sydney
,
Program Chairs:
Thorsten Joachims
Cornell University
,
Geoff Webb
Monash University
,
Dragos D. Margineantu
Boeing Research
,
Graham Williams
Australian Taxation Office

Copyright © 2015 Owner/Author.

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 2015

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

KDD '15

Sponsor:

KDD '15: The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

August 10 - 13, 2015

NSW, Sydney, Australia

Acceptance Rates

KDD '15 Paper Acceptance Rate 160 of 819 submissions, 20%;

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
5,298
Total Downloads

Downloads (Last 12 months)168
Downloads (Last 6 weeks)20

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Azad AFang YBaeza-Yates RBonchi F(2024)A Learned Generalized Geodesic Distance Function-Based Approach for Node Feature Augmentation on GraphsProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671858(49-58)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671858
Esfandiari HKacham PMirrokni VWoodruff DZhong PMohar BShinkar IO'Donnell R(2024)Optimal Communication Bounds for Classic Functions in the Coordinator Model and BeyondProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649742(1911-1922)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649742
Amati GCruciani APasquini DVocca PAngelini S(2023)propagate: A Seed Propagation Framework to Compute Distance-Based Metrics on Very Large GraphsMachine Learning and Knowledge Discovery in Databases: Research Track10.1007/978-3-031-43418-1_40(671-688)Online publication date: 17-Sep-2023
https://doi.org/10.1007/978-3-031-43418-1_40
Huang ZYuan LSui HChen ZYang SYang J(2023)Edge Coloring on Dynamic GraphsDatabase Systems for Advanced Applications10.1007/978-3-031-30675-4_10(137-153)Online publication date: 15-Apr-2023
https://doi.org/10.1007/978-3-031-30675-4_10
Yu DZhang XLuo QZhang LXie ZCai Z(2021)Public-Private-Core Maintenance in Public-Private-GraphsIntelligent and Converged Networks10.23919/ICN.2021.00222:4(306-319)Online publication date: Dec-2021
https://doi.org/10.23919/ICN.2021.0022
Guan WSong XGan TLin JChang XNie L(2021)Cooperation Learning From Multiple Social Networks: Consistent and Complementary PerspectivesIEEE Transactions on Cybernetics10.1109/TCYB.2019.295120751:9(4501-4514)Online publication date: Sep-2021
https://doi.org/10.1109/TCYB.2019.2951207
Jiang JHuang XChoi BXu JBhowmick SXu L(2020)PPKWS: An Efficient Framework for Keyword Search on Public-Private Networks2020 IEEE 36th International Conference on Data Engineering (ICDE)10.1109/ICDE48307.2020.00046(457-468)Online publication date: Apr-2020
https://doi.org/10.1109/ICDE48307.2020.00046
Ohara KFushimi TSaito KKimura MMotoda H(2020)Maximizing Network Coverage Under the Presence of Time Constraint by Injecting Most Effective k-LinksDiscovery Science10.1007/978-3-030-61527-7_28(421-436)Online publication date: 15-Oct-2020
https://doi.org/10.1007/978-3-030-61527-7_28
Ebadian SHuang X(2019)Fast algorithm for K-truss discovery on public-private graphsProceedings of the 28th International Joint Conference on Artificial Intelligence10.5555/3367243.3367353(2258-2264)Online publication date: 10-Aug-2019
https://dl.acm.org/doi/10.5555/3367243.3367353
Huang XLakshmanan LXu J(2019)Community Search over Big GraphsSynthesis Lectures on Data Management10.2200/S00928ED1V01Y201906DTM06114:6(1-206)Online publication date: 6-Aug-2019
https://doi.org/10.2200/S00928ED1V01Y201906DTM061
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents