Skip to main content

A Data Mining Approach to New Library Book Recommendations

  • Conference paper
  • First Online:
Digital Libraries: People, Knowledge, and Technology (ICADL 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2555))

Included in the following conference series:

Abstract

In this paper, we propose a data mining approach to recommending new library books that have never been rated or borrowed by users. In our problem context, users are characterized by their demographic attributes, and concept hierarchies can be defined for some of these demographic attributes. Books are assigned to the base categories of a taxonomy. Our goal is therefore to identify the type of users interested in some specific type of books. We call such knowledge generalized profile association rules. In this paper, we propose a new definition of rule interestingness to prune away rules that are redundant and not useful in book recommendation. We have developed a new algorithm for efficiently discovering generalized profile association rules from a circulation database. It is noted that generalized profile association rules can be applied to other kinds of applications, including e-commerce.

This research was supported by National Science Councile, ROC, under grant NSC 90-2213- E-110-022.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Aumann and Y. Lindell, “A statistical theory for quantitative association rules,” Proc. of the 5’th ACM SIGKDD Int’l. Conf. on Knowledge Discovery and Data Mining, pp. 261–270, 1999.

    Google Scholar 

  2. R. Agrawal and R. Srikant, “Fast algorithm for mining association rules,” Proc. of the 20th VLDB Conf., pp. 478–499, Sept. 1994.

    Google Scholar 

  3. J. S. Breese, D. Heckerman and C. Kadie, “Empirical Analysis of Predictive Algorithms for Collaborative Filtering,” Tech. Report, MSR-TR-98-12, Microsoft Research, Oct. 1998.

    Google Scholar 

  4. J. Han and Y. Fu, “Discovery of multiple-level association rules from large databases,” Proc. of the 21st VLDB Conf., pp. 420–431, 1995.

    Google Scholar 

  5. S. Jaroszewicz and D. A. Simovici, “Pruning redundant association rules using maximum entropy principle,” Proc. of 6’th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD2002), Taipei, Taiwan, 2002.

    Google Scholar 

  6. J. W. Kim, B. H. Lee, M. J. Shaw, H. L. Chang, and M. Nelson, “Application of Decision-tree Induction Techniques to Personalized Advertisements on Internet Storefronts,” International Journal of Electronic Commerce, 5(3), pp. 45–62, 2001.

    Google Scholar 

  7. B. Liu, W. Hsu, and Y. Ma, “Pruning and summarizing the discovered associations,” Proc. of the 5’th ACM SIGKDD Int’l. Conf. on Knowledge Discovery and Data Mining, pp.125–134, N.Y. Aug., 1999.

    Google Scholar 

  8. R. J. Mooney and L. Roy, “Content-based book recommending using learning for text categorization,” Proc. Of the 5’th ACM Conf. on Digital Libraries, pp. 195–240, June 2000.

    Google Scholar 

  9. M. J. Pazzani, “A framework for collaborative, content-based and demographic filtering,” Artificial Intelligence Review, pp. 393–408, 1999.

    Google Scholar 

  10. D. Pennock, E. Horvitz, S. Lawrence and C. L. Giles, “Collaborative filtering by personality diagnosis: a hybrid memory-and model-based approach,” Proc. of the 6’th Conf. on Uncertainty in Artificial Intelligence (UAI-2000), pp. 473–480, 2000.

    Google Scholar 

  11. B. Padmanabhan and A. Tuzhilin, “Small is beautiful: discovering the minimal set of unexpected patterns,” Proc. of the 6’th ACM SIGKDD Int’l. Conf. on Knowledge Discovery and Data Mining, pp.54–63, Aug. 2000.

    Google Scholar 

  12. R. Srikant and R. Agrawal, “Mining generalized association rules,” Proc. of the 21st VLDB Conf., pp. 409–419, 1995.

    Google Scholar 

  13. E. Suzuki and Y. Kodratoff, “Discovery of surprising exception rules based on intensity of implication,” Proc. of PKDD-98, France, p.10–18, 1998.

    Google Scholar 

  14. J. B. Schafer, J. A. Konstan, and J. Riedl, “E-Commerce Recommendation Applications,” Data Mining and Knowledge Discovery, 5(1), pp. 115–153, 2001.

    Article  MATH  Google Scholar 

  15. U. Shardanand and P. Maes, “Social Information Filtering: Algorithms for Automating’ Word of Mouth,” Proc. Of the Conference on Human Factors in Computing Systems (CHI’95), pp. 210–217, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hwang, SY., Lim, EP. (2002). A Data Mining Approach to New Library Book Recommendations. In: Lim, E.P., et al. Digital Libraries: People, Knowledge, and Technology. ICADL 2002. Lecture Notes in Computer Science, vol 2555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36227-4_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-36227-4_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00261-1

  • Online ISBN: 978-3-540-36227-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics