skip to main content
10.1145/2872427.2883038acmotherconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

PCT: Partial Co-Alignment of Social Networks

Published: 11 April 2016 Publication History

Abstract

People nowadays usually participate in multiple online social networks simultaneously to enjoy more social network services. Besides the common users, social networks providing similar services can also share many other kinds of information entities, e.g., locations, videos and products. However, these shared information entities in different networks are mostly isolated without any known corresponding connections. In this paper, we aim at inferring such potential corresponding connections linking multiple kinds of shared entities across networks simultaneously. Formally, the problem is referred to as the network "Partial Co-alignmenT" (PCT) problem. PCT is an important problem and can be the prerequisite for many concrete cross-network applications, like social network fusion, mutual information exchange and transfer. Meanwhile, the PCT problem is also very challenging to address due to various reasons, like (1) the heterogeneity of social networks, (2) lack of training instances to build models, and (3) one-to-one constraint on the correspondence connections. To resolve these challenges, a novel unsupervised network alignment framework, UNICOAT (UNsupervIsed COncurrent AlignmenT)), is introduced in this paper. Based on the heterogeneous information, UNICOAT transforms the PCT problem into a joint optimization problem. To solve the objective function, the one-to-one constraint on the corresponding relationships is relaxed, and the redundant non-existing corresponding connections introduced by such a relaxation will be pruned with a novel network co-matching algorithm proposed in this paper. Extensive experiments conducted on real-world co-aligned social network datasets demonstrate the effectiveness of UNICOAT in addressing the PCT problem.

References

[1]
Y. Aflaloa, A. Bronsteinb, and R. Kimmel. On convex relaxation of graph isomorphism. In PNAS, 2015.
[2]
M. Bayati, M. Gerritsen, D. Gleich, A. Saberi, and Y. Wang. Algorithms for large, sparse network alignment problems. In ICDM, 2009.
[3]
I. Bhattacharya and L. Getoor. Collective entity resolution in relational data. TKDD, 2007.
[4]
D. Chandler. The norm of the schur product operation. Numerische Mathematik, 1962.
[5]
M. Charikar. Similarity estimation techniques from rounding algorithms. In STOC, 2002.
[6]
D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. IJPRAI, 2004.
[7]
A. Doan, J. Madhavan, P. Domingos, and A. Halevy. Ontology matching: A machine learning approach. In Handbook on Ontologies. 2004.
[8]
S. Jin, J. Zhang, P. Yu, S. Yang, and A. Li. Synergistic partitioning in multiple large scale social networks. In IEEE BigData, 2014.
[9]
T. Joachims. A probabilistic analysis of the rocchio algorithm with tfidf for text categorization. In ICML, 1997.
[10]
M. Kalaev, V. Bafna, and R. Sharan. Fast and accurate alignment of multiple protein networks. In RECOMB. 2008.
[11]
X. Kong, J. Zhang, and P. Yu. Inferring anchor links across multiple heterogeneous social networks. In CIKM, 2013.
[12]
D. Koutra, H. Tong, and D. Lubensky. Big-align: Fast bipartite graph alignment. In ICDM, 2013.
[13]
C. Liao, K. Lu, M. Baym, R. Singh, and B. Berger. Isorankn: spectral methods for global alignment of multiple protein networks. Bioinformatics, 2009.
[14]
D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM, 2003.
[15]
F. Manne and M. Halappanavar. New effective multithreaded matching algorithms. In IPDPS, 2014.
[16]
S. Melnik, H. Garcia-Molina, and E. Rahm. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In ICDE, 2002.
[17]
M. Newman. Analysis of weighted networks. Physical Review E, 2004.
[18]
K. Petersen and M. Pedersen. The matrix cookbook. Technical report, 2012.
[19]
C. Shi, Y. Li, J. Zhang, Y. Sun, and P. Yu. A survey of heterogeneous information network analysis. CoRR, 2015.
[20]
R. Singh, J. Xu, and B. Berger. Pairwise global alignment of protein interaction networks by matching neighborhood topology. In RECOMB, 2007.
[21]
R. Singh, J. Xu, and B. Berger. Global alignment of multiple protein interaction networks with application to functional orthology detection. Proceedings of the National Academy of Sciences, 2008.
[22]
A. Smalter, J. Huan, and G. Lushington. Gpm: A graph pattern matching kernel with diffusion for chemical compound classification. In IEEE BIBE, 2008.
[23]
M. Tsikerdekis and S. Zeadally. Multiple account identity deception detection in social media using nonverbal behavior. IEEE TIFS, 2014.
[24]
S. Umeyama. An eigendecomposition approach to weighted graph matching problems. IEEE TPAMI, 1988.
[25]
R. Zafarani and H. Liu. Connecting users across social media sites: A behavioral-modeling approach. In KDD, 2013.
[26]
Q. Zhan, S. Wang J. Zhang, P. Yu, and J. Xie. Influence maximization across partially aligned heterogenous social networks. In PAKDD, 2015.
[27]
J. Zhang, X. Kong, and P. Yu. Predicting social links for new users across aligned heterogeneous social networks. In ICDM, 2013.
[28]
J. Zhang, X. Kong, and P. Yu. Transfer heterogeneous links across location-based social networks. In WSDM, 2014.
[29]
J. Zhang, W. Shao, S. Wang, X. Kong, and P. Yu. Pna: Partial network alignment with generic stable matching. In IRI, 2015.
[30]
J. Zhang and P. Yu. Community detection for emerging networks. In SDM, 2015.
[31]
J. Zhang and P. Yu. Integrated anchor and social link predictions across partially aligned social networks. In IJCAI, 2015.
[32]
J. Zhang and P. Yu. Mcd: Mutual clustering across multiple heterogeneous networks. In IEEE BigData Congress, 2015.
[33]
J. Zhang and P. Yu. Multiple anonymized social networks alignment. In ICDM, 2015.
[34]
J. Zhang, P. Yu, and Z. Zhou. Meta-path based multi-network collective link prediction. In KDD, 2014.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
WWW '16: Proceedings of the 25th International Conference on World Wide Web
April 2016
1482 pages
ISBN:9781450341431

Sponsors

  • IW3C2: International World Wide Web Conference Committee

In-Cooperation

Publisher

International World Wide Web Conferences Steering Committee

Republic and Canton of Geneva, Switzerland

Publication History

Published: 11 April 2016

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. data mining
  2. multiple heterogeneous social networks
  3. partial network co-alignment
  4. unsupervised learning

Qualifiers

  • Research-article

Conference

WWW '16
Sponsor:
  • IW3C2
WWW '16: 25th International World Wide Web Conference
April 11 - 15, 2016
Québec, Montréal, Canada

Acceptance Rates

WWW '16 Paper Acceptance Rate 115 of 727 submissions, 16%;
Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)20
  • Downloads (Last 6 weeks)2
Reflects downloads up to 14 Jan 2025

Other Metrics

Citations

Cited By

View all

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