skip to main content
10.1145/3132847.3132931acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Minimizing Dependence between Graphs

Published: 06 November 2017 Publication History

Abstract

In recent years, modeling the relation between two graphs has received unprecedented attention from researchers due to its wide applications in many areas, such as social analysis and bioinformatics. The nature of relations between two graphs can be divided into two categories: the vertex relation and the link relation. Many studies focus on modeling the vertex relation between graphs and try to find the vertex correspondence between two graphs. However, the link relation between graphs has not been fully studied. Specifically, we model the cross-graph link relation as cross-graph dependence, which reflects the dependence of a vertex in one graph on a vertex in the other graph. A generic problem, called Graph Dependence Minimization (GDM), is defined as: given two graphs with cross-graph dependence, how to select a subset of vertexes from one graph and copy them to the other, so as to minimize the cross-graph dependence. Many real applications can benefit from the solution to GDM. Examples include reducing the cross-language links in online encyclopedias, optimizing the cross-platform communication cost between different cloud services, and so on. This problem is trivial if we can select as many vertexes as we want to copy. But what if we can only choose a limited number of vertexes to copy so as to make the two graphs as independent as possible? We formulate GDM with a budget constraint into a combinatorial optimization problem, which is proven to be NP-hard. We propose two algorithms to solve GDM. Firstly, we prove the submodularity of the objective function of GDM and adopt the size-constrained submodular minimization (SSM) algorithm to solve it. Since the SSM-based algorithm cannot scale to large graphs, we design a heuristic algorithm with a provable approximation guarantee. We prove that the error achieved by the heuristic algorithm is bounded by an additive factor which is proportional to the square of the given budget. Extensive experiments on both synthetic and real-world graphs show that the proposed algorithms consistently outperform the well-studied graph centrality measure based solutions. Furthermore, we conduct a case study on the Wikipedia graphs with millions of vertexes and links to demonstrate the potential of GDM to solve real-world problems.

References

[1]
H. Almeida, D. Guedes, W. Meira Jr, and M. J. Zaki. Is there a best quality metric for graph clusters? In ECML-PKDD, pages 44--59. Springer, 2011.
[2]
D. Chakrabarty, P. Jain, and P. Kothari. Provable submodular minimization using wolfe's algorithm. In NIPS, pages 802--809, 2014.
[3]
P. Erdös and A. Rényi. On random graphs, i. Publicationes Mathematicae (Debrecen), 6:290--297, 1959.
[4]
S. Fujishige. Lexicographically optimal base of a polymatroid with respect to a weight vector. Mathematics of Operations Research, 5(2):186--196, 1980.
[5]
S. Fujishige and S. Isotani. A submodular function minimization algorithm based on the minimum-norm base. Pacific Journal of Optimization, 7(1):3--17, 2011.
[6]
G. W. Klau. A new graph-based method for pairwise global network alignment. BMC bioinformatics, 10(1):S59, 2009.
[7]
J. M. Kleinberg. Hubs, authorities, and communities. CSUR, 31(4es):5, 1999.
[8]
X. Kong, J. Zhang, and P. S. Yu. Inferring anchor links across multiple heterogeneous social networks. In CIKM, pages 179--188, 2013.
[9]
M. Koyutürk, Y. Kim, U. Topkara, S. Subramaniam, W. Szpankowski, and A. Grama. Pairwise alignment of protein interaction networks. Journal of Computational Biology, 13(2):182--199, 2006.
[10]
J. Leskovec and R. Sosivc. Snap: A general-purpose network analysis and graph-mining library. TIST, 8(1):1, 2016.
[11]
L. Lovász, M. Grötschel, and A. Schrijver. Geometric algorithms and combinatorial optimization. Berlin: Springer-Verlag, 33:34, 1988.
[12]
K. Nagano, Y. Kawahara, and K. Aihara. Size-constrained submodular minimization through minimum norm base. In ICML, pages 977--984, 2011.
[13]
M. E. Newman, S. H. Strogatz, and D. J. Watts. Random graphs with arbitrary degree distributions and their applications. Physical review E, 64(2):026118, 2001.
[14]
J. B. Orlin. A faster strongly polynomial time algorithm for submodular function minimization. In IPCO, pages 240--251. Springer, 2007.
[15]
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999.
[16]
S. M. E. Sahraeian and B.-J. Yoon. Smetana: accurate and scalable algorithm for probabilistic alignment of large-scale biological networks. PloS one, 8(7):e67995, 2013.
[17]
R. Singh, J. Xu, and B. Berger. Pairwise global alignment of protein interaction networks by matching neighborhood topology. In RECOMB, pages 16--31. Springer, 2007.
[18]
J. Tang, T. Lou, J. Kleinberg, and S. Wu. Transfer learning to infer social ties across heterogeneous networks. TOIS, 34(2):7, 2016.
[19]
E. Wulczyn, R. West, L. Zia, and J. Leskovec. Growing wikipedia across languages via recommendation. In WWW, pages 975--985, 2016.
[20]
Q. Zhan, J. Zhang, S. Wang, S. Y. Philip, and J. Xie. Influence maximization across partially aligned heterogenous social networks. In PAKDD, pages 58--69. Springer, 2015.
[21]
J. Zhang and S. Y. Philip. Integrated anchor and social link predictions across social networks. In IJCAI, pages 2125--2132, 2015.
[22]
J. Zhang, W. Shao, S. Wang, X. Kong, and S. Y. Philip. Pna: Partial network alignment with generic stable matching. In IRI, pages 166--173. IEEE, 2015.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CIKM '17: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management
November 2017
2604 pages
ISBN:9781450349185
DOI:10.1145/3132847
Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 November 2017

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. graph analytics
  2. graph dependence minimization
  3. submodular minimization

Qualifiers

  • Research-article

Conference

CIKM '17
Sponsor:

Acceptance Rates

CIKM '17 Paper Acceptance Rate 171 of 855 submissions, 20%;
Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 190
    Total Downloads
  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media