Skip to main content

Using Association Rules to Solve the Cold-Start Problem in Recommender Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6118))

Abstract

Recommender systems are widely used online to help users find other products, items etc that they may be interested in based on what is known about that user in their profile. Often however user profiles may be short on information and thus it is difficult for a recommender system to make quality recommendations. This problem is known as the cold-start problem. Here we investigate using association rules as a source of information to expand a user profile and thus avoid this problem. Our experiments show that it is possible to use association rules to noticeably improve the performance of a recommender system under the cold-start situation. Furthermore, we also show that the improvement in performance obtained can be achieved while using non-redundant rule sets. This shows that non-redundant rules do not cause a loss of information and are just as informative as a set of association rules that contain redundancy.

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   89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.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. Adomavicius, G., Tuzhilin, A.: Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions. IEEE Transactions on Knowledge and Data Engineering 17, 734–749 (2005)

    Article  Google Scholar 

  2. Burke, R.: Hybrid Recommender Systems: Survey and Experiments. User Modelling and User-Adapted Interaction 12, 331–370 (2002)

    Article  MATH  Google Scholar 

  3. Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating Collaborative Filtering Recommender Systems. ACM Transactions on Information Systems 22, 5–53 (2004)

    Article  Google Scholar 

  4. Leung, C.W., Chan, S.C., Chung, F.: Applying Cross-Level Association Rule Mining to Cold-Start Recommendations. In: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, Silicon Valley, California, USA, November 2007, pp. 133–136 (2007)

    Google Scholar 

  5. Middleton, S.E., Alani, H., Shadbolt, N.R., Roure, D.C.D.: Exploiting Synergy Between Ontologies and Recommender Systems. In: The Semantic Web Workshop, World Wide Web Conference (WWW 2002), Hawaii, USA, May 2002, pp. 41–50 (2002)

    Google Scholar 

  6. Pasquier, N., Taouil, R., Bastide, Y., Stumme, G.: Generating a Condensed Representation for Association Rules. Journal of Intelligent Information Systems 24, 29–60 (2005)

    Article  MATH  Google Scholar 

  7. Schein, A.I., Popescul, A., Ungar, L.H., Pennock, M.: Methods and Metrics for Cold-Start Recommendations. In: 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2002), Tampere, Finland, August 2002, pp. 253–260 (2002)

    Google Scholar 

  8. Shaw, G., Xu, Y., Geva, S.: Eliminating Association Rules in Multi-level Datasets. In: 4th International Conference on Data Mining (DMIN 2008), Las Vegas, USA, July 2008, pp. 313–319 (2008)

    Google Scholar 

  9. Shaw, G., Xu, Y., Geva, S.: Extracting Non-Redundant Approximate Rules from Multi-Level Datasets. In: 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), Dayton, Ohio, USA, November 2008, pp. 333–340 (2008)

    Google Scholar 

  10. Weng, L.T., Xu, Y., Li, Y., Nayak, R.: Exploiting Item Taxonomy for Solving Cold-start Problem in Recommendation Making. In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), Dayton, Ohio, USA, November 2008, pp. 113–120 (2008)

    Google Scholar 

  11. Xu, Y., Li, Y.: Generating Concise Association Rules. In: 16th ACM International Conference on Information and Knowledge Management (CIKM 2007), Lisbon, Portugal, November 2007, pp. 781–790 (2007)

    Google Scholar 

  12. Xu, Y., Li, Y., Shaw, G.: Concise Representations for Approximate Association Rules. In: IEEE International Conference on Systems, Man & Cybernetics (SMC 2008), Singapore, October 2008, pp. 94–101 (2008)

    Google Scholar 

  13. Ziegler, C.N., Lausen, G., Schmidt-Thieme, L.: Taxonomy-driven Computation of Product Recommendations. In: International Conference on Information and Knowledge Management (CIKM 2004), Washington, D.C., USA, November 2004, pp. 406–415 (2004)

    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

Shaw, G., Xu, Y., Geva, S. (2010). Using Association Rules to Solve the Cold-Start Problem in Recommender Systems. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2010. Lecture Notes in Computer Science(), vol 6118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13657-3_37

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13656-6

  • Online ISBN: 978-3-642-13657-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics