Skip to main content

A Hybrid Recommendation Method with Double SVD Reduction

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2010)

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

Included in the following conference series:

Abstract

An issue related to recommendation is the requirement of considerable memory for calculating the recommendation score. We propose a hybrid information recommendation method using singular value decomposition (SVD) to reduce data size for calculation. This method combines two steps. First, the method reduces the number of documents on the basis of the users’ rating pattern by applying SVD based on collaborative filtering (CF). Second, it reduces the number of terms on the basis of the term frequency pattern of the reduced documents by applying SVD based on content-based filtering (CBF). The experimental results show that the proposed method has almost the same mean absolute error (MAE) as the SVD-based CBF. Originally, our data set has 9924 terms. The SVD-based CBF reduces the number of terms to 45 and the proposed method to 15 while preserving the same MAE. This means that the proposed method is effective for calculating recommendation.

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

References

  1. Herlocker, J., Konstan, J., Terveen, L., Riedl, J.: Evaluating Collaborative Filtering Recommender Systems. ACM Trans. on Information Systems 22(1), 5–53 (2004)

    Article  Google Scholar 

  2. Kamishima, T.: Algorithms for Recommender Systems. Journal of JSAI 22(6), 826–837 (2007)

    Google Scholar 

  3. Foltz, P.W., Dumais, S.T.: Personalized Information Delivery: An Analysis on Information Filtering Methods. Comm. of the ACM 35(12), 51–60 (1992)

    Article  Google Scholar 

  4. Sarwar, B.M., et al.: Application of Dimensionality Reduction in Recommender System—A Case Study. In: Proc. KDD Workshop on Web Mining for e-Commerce: Challenges and Opportunities (WebKDD). ACM Press, New York (2000)

    Google Scholar 

  5. Berry, M.W., Drmac, Z., Jessup, E.R.: Matrices, vector spaces, and information retrieval. SIAM Review 41(6), 391–407 (1999)

    MathSciNet  Google Scholar 

  6. Burke, R.: Hybrid recommender systems; Survey and experiments. User-modeling and user-adapted interactions 12(4), 331–370 (2002)

    Article  MATH  Google Scholar 

  7. Soboroff, I.M., Nicholas, C.K.: Related, but not Relevant: Content-Based Collaborative Filtering in TREC-8. Information Retrieval 5(2-3), 189–208 (2002)

    Article  Google Scholar 

  8. Hofmann, T.: Probabilistic latent semantic indexing. In: Proc. of SIGIR 1999, pp. 50–57 (1999)

    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

Ariyoshi, Y., Kamahara, J. (2010). A Hybrid Recommendation Method with Double SVD Reduction. In: Yoshikawa, M., Meng, X., Yumoto, T., Ma, Q., Sun, L., Watanabe, C. (eds) Database Systems for Advanced Applications. DASFAA 2010. Lecture Notes in Computer Science, vol 6193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14589-6_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14589-6_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14588-9

  • Online ISBN: 978-3-642-14589-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics