Skip to main content

Soft-Constraint Based Online LDA for Community Recommendation

  • Conference paper

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

Abstract

With the number of social communities grows, social community recommendation has gradually become a critical technique for users to efficiently find their favorite communities. Currently a variety of recommendation techniques have been developed, such as content-based method, collaborative filtering, etc. There methods either easily overfit the data due to the limitation of observations or suffer the heavy computational cost. Besides, they don’t consider the relationships between users and communities, and cannot handle incoming users. In this paper, we propose a soft-constraint based online LDA (SO-LDA) method. We use the number of user’s posts within each community as soft-constraint to estimate the latent topics across the communities by an online LDA algorithm, in which an incremental method is adopted to facilitate model updating when incomes a new user. Experiment on the well-known MySpace community data shows that the proposed method takes much less time and outperforms the state-of-the-art community recommendation methods.

This paper is supported by the National High Technology Research and Development Program of China(863) (No. 2008AA01Z117), the National Natural Science Foundation of China ( No. 60933013), the National High Technology Research and Development Program of China(863) ( No. 2010ZX03004-003) and the Research Fund for the Doctoral Program of Higher Education.(No.20070358040).

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD 1993: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, vol. 22, pp. 207–216. ACM, New York (June 1993)

    Chapter  Google Scholar 

  2. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent dirichlet allocation. Journal of Machine Learning Research 3, 993–1022 (2003)

    Article  MATH  Google Scholar 

  3. Chen, W.Y., Chu, J.C., Luan, J., Bai, H., Wang, Y., Chang, E.Y.: Collaborative filtering for orkut communities: discovery of user latent behavior. In: WWW 2009: Proceedings of the 18th International Conference on World Wide Web, pp. 681–690. ACM, New York (2009)

    Chapter  Google Scholar 

  4. Griffiths, T.L., Steyvers, M.: Finding scientific topics. Proc. Natl. Acad. Sci. U. S. A. 101(suppl.1), 5228–5235 (2004)

    Article  Google Scholar 

  5. Herlocker, J.L., Konstan, J.A., Riedl, J.: Explaining collaborative filtering recommendations. In: CSCW 2000: Proceedings of the 2000 ACM Conference on Computer Supported Cooperative Work, pp. 241–250. ACM, New York (2000)

    Chapter  Google Scholar 

  6. Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22(1), 5–53 (2004)

    Article  Google Scholar 

  7. Hipp, J., Güntzer, U., Nakhaeizadeh, G.: Algorithms for association rule mining — a general survey and comparison. SIGKDD Explor. Newsl. 2(1), 58–64 (2000)

    Article  Google Scholar 

  8. Jin, X., Zhou, Y., Mobasher, B.: A maximum entropy web recommendation system: combining collaborative and content features. In: KDD 2005: Proceeding of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 612–617. ACM Press, New York (2005)

    Chapter  Google Scholar 

  9. Jung, K.Y.: Content-based image filtering for recommendation, pp. 312–321 (2006)

    Google Scholar 

  10. Krestel, R., Fankhauser, P., Nejdl, W.: Latent dirichlet allocation for tag recommendation. In: Bergman, L.D., Tuzhilin, A., Burke, R., Felfernig, A., Thieme, L.S., Bergman, L.D., Tuzhilin, A., Burke, R., Felfernig, A., Thieme, L.S. (eds.) RecSys, pp. 61–68. ACM, New York (2009)

    Chapter  Google Scholar 

  11. Pazzani, M., Billsus, D.: Content-based recommendation systems, pp. 325–341 (2007)

    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

Kang, Y., Yu, N. (2010). Soft-Constraint Based Online LDA for Community Recommendation. In: Qiu, G., Lam, K.M., Kiya, H., Xue, XY., Kuo, CC.J., Lew, M.S. (eds) Advances in Multimedia Information Processing - PCM 2010. PCM 2010. Lecture Notes in Computer Science, vol 6298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15696-0_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15696-0_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15695-3

  • Online ISBN: 978-3-642-15696-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics