Skip to main content

Exploit of Online Social Networks with Community-Based Graph Semi-Supervised Learning

  • Conference paper
Neural Information Processing. Theory and Algorithms (ICONIP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6443))

Included in the following conference series:

Abstract

With the rapid growth of the Internet, more and more people interact with their friends in online social networks like Facebook. Currently, the privacy issue of online social networks becomes a hot and dynamic research topic. Though some privacy protecting strategies are implemented, they are not stringent enough. Recently, Semi-Supervised Learning (SSL), which has the advantage of utilizing the unlabeled data to achieve better performance, attracts much attention from the web research community. By utilizing a large number of unlabeled data from websites, SSL can effectively infer hidden or sensitive information on the Internet. Furthermore, graph-based SSL is much more suitable for modeling real-world objects with graph characteristics, like online social networks. Thus, we propose a novel Community-based Graph (CG) SSL model that can be applied to exploit security issues in online social networks, then provide two consistent algorithms satisfying distinct needs. In order to evaluate the effectiveness of this model, we conduct a series of experiments on a synthetic data and two real-world data from StudiVZ and Facebook. Experimental results demonstrate that our approach can more accurately and confidently predict sensitive information of online users, comparing to previous models.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. http://www.facebook.com/press/info.php?statistics

  2. Blum, A., Chawla, S.: Learning from labeled and unlabeled data using graph mincuts. In: Proc. of ICML, pp. 19–26. Citeseer (2001)

    Google Scholar 

  3. Blum, A., Mitchell, T.: Combining labeled and unlabeled data with co-training. In: Proceedings of the eleventh annual Conference on Computational Learning Theory, p. 100. ACM, New York (1998)

    Google Scholar 

  4. Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological) 39(1), 1–38 (1977)

    MathSciNet  MATH  Google Scholar 

  5. Getoor, L., Taskar, B.: Introduction to statistical relational learning. MIT Press, Cambridge (2007)

    MATH  Google Scholar 

  6. He, J., Chu, W., Liu, Z.: Inferring privacy information from social networks. In: Mehrotra, S., Zeng, D.D., Chen, H., Thuraisingham, B., Wang, F.-Y. (eds.) ISI 2006. LNCS, vol. 3975, pp. 154–165. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Mo, M., Wang, D., Li, B., Hong, D., King, I.: Exploit of Online Social Networks with Semi-Supervised Learning. In: Proc. of IJCNN, pp. 1893–1900. IEEE, Los Alamitos (2010)

    Google Scholar 

  8. Vapnik, V.: Structure of statistical learning theory. Computational Learning and Probabilistic Reasoning, 3 (1996)

    Google Scholar 

  9. Xu, Z., Jin, R., Zhu, J., King, I., Lyu, M., Yang, Z.: Adaptive Regularization for Transductive Support Vector Machine. In: Proc. of NIPS, pp. 2125–2133 (2009)

    Google Scholar 

  10. Zheleva, E., Getoor, L.: To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles. In: Proc. of WWW, pp. 531–540. ACM, New York (2009)

    Google Scholar 

  11. Zhou, D., Bousquet, O., Lal, T., Weston, J., Scholkopf, B.: Learning with local and global consistency. In: Proc. of NIPS, pp. 595–602. MIT Press, Cambridge (2004)

    Google Scholar 

  12. Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using Gaussian fields and harmonic functions. In: Proc. of ICML (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mo, M., King, I. (2010). Exploit of Online Social Networks with Community-Based Graph Semi-Supervised Learning. In: Wong, K.W., Mendis, B.S.U., Bouzerdoum, A. (eds) Neural Information Processing. Theory and Algorithms. ICONIP 2010. Lecture Notes in Computer Science, vol 6443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17537-4_81

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17537-4_81

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17536-7

  • Online ISBN: 978-3-642-17537-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics