Skip to main content

Latent Factor BlockModel for Modelling Relational Data

  • Conference paper
  • 2956 Accesses

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

Abstract

In this paper we address the problem of modelling relational data, which has appeared in many applications such as social network analysis, recommender systems and bioinformatics. Previous studies either consider latent feature based models to do link prediction in the relational data but disregarding local structure in the network, or focus exclusively on capturing network structure of objects based on latent blockmodels without coupling with latent characteristics of objects to avoid redundant information. To combine the benefits of the previous work, we model the relational data as a function of both latent feature factors and latent cluster memberships of objects via our proposed Latent Factor BlockModel (LFBM) to collectively discover globally predictive intrinsic properties of objects and capture the latent block structure. We also develop an optimization transfer algorithm to learn the latent factors. Extensive experiments on the synthetic data and several real world datasets suggest that our proposed LFBM model outperforms the state-of-the-art approaches for modelling the relational data.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   129.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hoff, P.D.: Multiplicative latent factor models for description and prediction of social networks. In: Computational & Mathematical Organization Theory, pp. 261–272 (2009)

    Google Scholar 

  2. Long, B., Zhang, Z.M., Yu, P.S.: A probabilistic framework for relational clustering. In: KDD, pp. 470–479 (2007)

    Google Scholar 

  3. Airoldi, M., Blei, D., Fienberg, S., Xing, E.: Mixed membership stochastic block models. In: JMLR, pp. 1981–2014 (2008)

    Google Scholar 

  4. Snijders, T., Nowicki, K.: Estimating and prediction for stochastic blockmodels for graphs with latent block struture. Journal of Classification 14(1), 75–100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  5. Agarwal, D., Merugu, S.: Predictive discrete latent factor models for large scale dyadic data. In: KDD, pp. 26–35 (2007)

    Google Scholar 

  6. Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: NIPS, pp. 556–562 (2000)

    Google Scholar 

  7. Gao, S., Denoyer, L., Gallinari, P.: Temporal link prediction by integrating content and structure information. In: CIKM 2011, pp. 1169–1174 (2011)

    Google Scholar 

  8. Li, W.-J., Yeung, D.-Y., Zhang, Z.: Generalized latent factor models for social network analysis. In: IJCAI, pp. 1705–1710 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gao, S., Denoyer, L., Gallinari, P., Guo, J. (2013). Latent Factor BlockModel for Modelling Relational Data. In: Serdyukov, P., et al. Advances in Information Retrieval. ECIR 2013. Lecture Notes in Computer Science, vol 7814. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36973-5_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36973-5_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36972-8

  • Online ISBN: 978-3-642-36973-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics