Skip to main content

Labeling Actors in Social Networks Using a Heterogeneous Graph Kernel

  • Conference paper
Social Computing, Behavioral-Cultural Modeling and Prediction (SBP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8393))

  • 4454 Accesses

Abstract

We consider the problem of labeling actors in social networks where the labels correspond to membership in specific interest groups, or other attributes of the actors. Actors in a social network are linked to not only other actors but also items (e.g., video and photo) which in turn can be linked to other items or actors. Given a social network in which only some of the actors are labeled, our goal is to predict the labels of the remaining actors. We introduce a variant of the random walk graph kernel to deal with the heterogeneous nature of the network (i.e., presence of a large number of node and link types). We show that the resulting heterogeneous graph kernel (HGK) can be used to build accurate classifiers for labeling actors in social networks. Specifically, we describe results of experiments on two real-world data sets that show HGK classifiers often significantly outperform or are competitive with the state-of-the-art methods for labeling actors in social networks.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Macskassy, S.A., Provost, F.: A simple relational classifier. In: MRDM Workshop at KDD 2003, pp. 64–76 (2003)

    Google Scholar 

  2. Macskassy, S.A., Provost, F.: Classification in networked data: A toolkit and a univariate case study. J. Mach. Learn. Res. 8, 935–983 (2007)

    Google Scholar 

  3. Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Magazine, 93–106 (2008)

    Google Scholar 

  4. Lu, Q., Getoor, L.: Link-based classification. In: ICML, pp. 496–503 (2003)

    Google Scholar 

  5. Eldardiry, H., Neville, J.: Across-model collective ensemble classification. In: AAAI (2011)

    Google Scholar 

  6. Zhou, D., Bousquet, O., Lal, T.N., Weston, J., Schölkopf, B.: Learning with local and global consistency. In: NIPS, pp. 321–328 (2004)

    Google Scholar 

  7. Wang, J., Jebara, T.: Graph transduction via alternating minimization. In: ICML (2008)

    Google Scholar 

  8. Angelova, R., Kasneci, G., Weikum, G.: Graffiti: graph-based classification in heterogeneous networks. World Wide Web Journal (2011)

    Google Scholar 

  9. Lin, F., Cohen, W.W.: Semi-supervised classification of network data using very few labels. In: Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining, pp. 192–199 (2010)

    Google Scholar 

  10. Ji, M., Han, J., Danilevsky, M.: Ranking-based classification of heterogeneous information networks. In: KDD, pp. 1298–1306 (2011)

    Google Scholar 

  11. Tang, L., Liu, H.: Scalable learning of collective behavior based on sparse social dimensions. In: CIKM, pp. 1107–1116 (2009)

    Google Scholar 

  12. Macskassy, S.A.: Improving learning in networked data by combining explicit and mined links. In: AAAI, pp. 590–595 (2007)

    Google Scholar 

  13. Macskassy, S.A.: Relational classifiers in a non-relational world: Using homophily to create relations. ICMLA (1), 406–411 (2011)

    Google Scholar 

  14. Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: ICML, pp. 321–328 (2003)

    Google Scholar 

  15. Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, R., Borgwardt, K.M.: Graph kernels. Journal of Machine Learning Research 11, 1201–1242 (2010)

    MATH  MathSciNet  Google Scholar 

  16. Kang, U., Tong, H., Sun, J.: Fast random walk graph kernel. In: SDM, pp. 828–838 (2012)

    Google Scholar 

  17. Li, X., Chen, H., Li, J., Zhang, Z.: Gene function prediction with gene interaction networks: a context graph kernel approach. Trans. Info. Tech. Biomed. 14(1), 119–128 (2010)

    Article  Google Scholar 

  18. Cortes, C., Mohri, M., Rostamizadeh, A.: Multi-class classification with maximum margin multiple kernel. In: ICML 2013, vol. 28, pp. 46–54 (May 2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bui, N., Honavar, V. (2014). Labeling Actors in Social Networks Using a Heterogeneous Graph Kernel. In: Kennedy, W.G., Agarwal, N., Yang, S.J. (eds) Social Computing, Behavioral-Cultural Modeling and Prediction. SBP 2014. Lecture Notes in Computer Science, vol 8393. Springer, Cham. https://doi.org/10.1007/978-3-319-05579-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05579-4_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05578-7

  • Online ISBN: 978-3-319-05579-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics