Skip to main content

Library Book Recommendations Based on Latent Topic Aggregation

  • Conference paper

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

Abstract

During recent years, how to provide personalized services has become an important research issue in library services. The libraries provide more and more personalized services such as customized web interface and reading suggestions. In the traditional approaches, the features of the books that a reader likes are used to construct the profile of the reader to support recommendation of books such as query keywords. But with the fact of the huge holdings in the libraries, the librarians need to effectively help the readers to find the books of interest. Collaborative filtering (CF) is a way to make it possible by use patron’s circulation logs which contain their borrow history as favorite readings. In this paper, we first use Latent Dirichlet Allocation to find the latent topics existing in the circulation logs, then we combine patron reading histories with the generated latent topics to produce a suggestion list for the patron. With the elaborated experiments demonstrated in this paper, it showed good results from the volunteers’ feedback.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Kent, A., et al.: Use of library materials: the university of Pittsburgh study. Pittsburgh University, PA (1979)

    Google Scholar 

  2. Deerwester, S., Dumais, S.T., Furnas, G.W., Landauer, T.K., Harshman, R.: Indexing by latent semantic analysis. Journal of the American Society for Information Science 41(6), 391–407 (1990)

    Article  Google Scholar 

  3. Hofmann, T.: Unsupervised learning by probabilistic latent semantic analysis. Machine Learning 42(1), 177–196 (2001)

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  5. Girolami, M., Kaban, A.: On an equivalence between PLSI and LDA. In: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 433–434 (2003)

    Google Scholar 

  6. Jain, A.K., Murty, M.N., Flynn, P.J.: Data Clustering: A Review. ACM Computing Surveys 31, 264–323 (1999)

    Article  Google Scholar 

  7. Widyantoro, D., Ioerger, T.R., Yen, J.: An Incremental Approach to Building a Cluster Hierarchy. In: Proceedings of the 2002 IEEE International Conference on Data Mining, ICDM 2002 (2002)

    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

Sie, SH., Yeh, JH. (2014). Library Book Recommendations Based on Latent Topic Aggregation. In: Tuamsuk, K., Jatowt, A., Rasmussen, E. (eds) The Emergence of Digital Libraries – Research and Practices. ICADL 2014. Lecture Notes in Computer Science, vol 8839. Springer, Cham. https://doi.org/10.1007/978-3-319-12823-8_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12823-8_45

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12822-1

  • Online ISBN: 978-3-319-12823-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics