Semi-supervised Network Alignment

  • Jiawei Zhang
  • Philip S. Yu


As mentioned before, in the real-world online social networks, the anchor links are extremely difficult to label manually. The training set we can obtain is usually of a small size compared with the network scale, and most of the potential anchor links are unlabeled actually. For instance, given the Facebook and Twitter networks containing millions or billions of users, identifying a very small training set merely with hundreds of correct anchor links is however not an easy task. Therefore, it is not realistic to achieve a large set of labeled anchor links as required by the supervised network alignment models introduced in Chap.  4. On the other hand, completely ignoring the (small) set of labeled anchor links, just like the unsupervised network alignment models introduced in Chap.  5, may also create lots of problems, since these labeled anchor links can provide important signals for the network alignment model building.


  1. 1.
    E. Allgower, K. Georg, Numerical Continuation Methods: An Introduction (Springer, Berlin, 1990)CrossRefGoogle Scholar
  2. 2.
    M. Belkin, I. Matveeva, P. Niyogi, Regularization and semi-supervised learning on large graphs, in Learning Theory, ed. by J. Shawe-Taylor, Y. Singer (2004)Google Scholar
  3. 3.
    M. Belkin, P. Niyogi, V. Sindhwani, Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res. 7, 2399–2434 (2006)MathSciNetzbMATHGoogle Scholar
  4. 4.
    K. Bennett, A. Demiriz, Semi-supervised support vector machines, in Proceedings of the 1998 Conference on Advances in Neural Information Processing Systems II (1999)Google Scholar
  5. 5.
    S. Berchtold, C. Bohm, H. Kriegel, The pyramid-technique: towards breaking the curse of dimensionality, in Proceedings ACM SIGMOD International Conference on Management of Data (1998)Google Scholar
  6. 6.
    A. Blum, S. Chawla, Learning from labeled and unlabeled data using graph Mincuts, in Proceedings of the Eighteenth International Conference on Machine Learning (ICML ’01) (2001)Google Scholar
  7. 7.
    A. Blum, T. Mitchell, Combining labeled and unlabeled data with co-training, in Proceedings of the Eleventh Annual Conference on Computational Learning Theory (COLT’ 98) (1998)Google Scholar
  8. 8.
    O. Chapelle, B. Schlkopf, A. Zien, Semi-Supervised Learning, 1st edn. (The MIT Press, Cambridge, 2010)Google Scholar
  9. 9.
    A. Dempster, N. Laird, D. Rubin, Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B 39(1), 1–38 (1977)MathSciNetzbMATHGoogle Scholar
  10. 10.
    C. Elkan, K. Noto, Learning classifiers from only positive and unlabeled data, in Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’08) (2008)Google Scholar
  11. 11.
    X. Kong, J. Zhang, P. Yu, Inferring anchor links across multiple heterogeneous social networks, in Proceedings of the 22nd ACM International Conference on Information & Knowledge Management (CIKM ’13) (2013)Google Scholar
  12. 12.
    B. Liu, Y. Dai, X. Li, W. Lee, P. Yu, Building text classifiers using positive and unlabeled examples, in Third IEEE International Conference on Data Mining (2003)Google Scholar
  13. 13.
    L. Manevitz, M. Yousef, One-class SVMs for document classification. J. Mach. Learn. Res. 2, 139–154 (2002)zbMATHGoogle Scholar
  14. 14.
    Y. Ren, C.C. Aggarwal, J. Zhang, Meta diagram based active social networks alignment. CoRR (2019).
  15. 15.
    K. Rose, Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proc. IEEE 86(11), 2210–2239 (1998)CrossRefGoogle Scholar
  16. 16.
    B. Settles, Active learning literature survey. Computer sciences technical report, University of Wisconsin–Madison (2009)Google Scholar
  17. 17.
    A. Yuille, A. Rangarajan, The concave-convex procedure (CCCP), in Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic (NIPS’01) (2002)Google Scholar
  18. 18.
    J. Zhang, P. Yu, Integrated anchor and social link predictions across partially aligned social networks, in Proceedings of the 24th International Conference on Artificial Intelligence (IJCAI’15) (2015)Google Scholar
  19. 19.
    J. Zhang, P. Yu, Z. Zhou, Meta-path based multi-network collective link prediction, in Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD ’14) (2014)Google Scholar
  20. 20.
    J. Zhang, J. Chen, J. Zhu, Y. Chang, P. Yu, Link prediction with cardinality constraints, in Proceedings of the Tenth ACM International Conference on Web Search and Data Mining (WSDM ’17) (2017)Google Scholar
  21. 21.
    J. Zhang, J. Chen, S. Zhi, Y. Chang, P. Yu, J. Han, Link prediction across aligned networks with sparse low rank matrix estimation, in 2017 IEEE 33rd International Conference on Data Engineering (ICDE) (2017)Google Scholar
  22. 22.
    D. Zhou, O. Bousquet, T. Lal, J. Weston, B. Schölkopf, Learning with local and global consistency, in Proceedings of the 16th International Conference on Neural Information Processing Systems (NIPS’03) (2003)Google Scholar
  23. 23.
    X. Zhu, Semi-supervised learning literature survey. Technical Report 1530, Computer Sciences, University of Wisconsin-Madison (2005)Google Scholar
  24. 24.
    X. Zhu, Semi-supervised Learning with Graphs. PhD thesis, Pittsburgh, PA, USA, 2005. AAI3179046Google Scholar
  25. 25.
    J. Zhu, J. Zhang, Q. Wu, Y. Jia, B. Zhou, X. Wei, P. Yu, Constrained active learning for anchor link prediction across multiple heterogeneous social networks. Sensors 17(8), 1786 (2017)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Jiawei Zhang
    • 1
  • Philip S. Yu
    • 2
  1. 1.Department of Computer ScienceFlorida State UniversityTallahasseeUSA
  2. 2.Department of Computer ScienceUniversity of IllinoisChicagoUSA

Personalised recommendations