A data mining approach to new library book recommendations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2555, Issue , 2002, Pages 229-240

  Hwang, San Yih ^a   Lim, Ee Peng ^b  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; DIGITAL LIBRARIES; POPULATION STATISTICS;

CONCEPT HIERARCHIES; PROFILE ASSOCIATION; RULE INTERESTINGNESS;

DATA MINING;

EID: 21144452945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36227-4_23     Document Type: Conference Paper

References (16)

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.
2. R. Agrawal and R. Srikant, “Fast algorithm for mining association rules,” Proc Of the 20th VLDB Conf, pp. 478–499, Sept. 1994.
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.
4. Special issue on information filtering, Communications of the ACM, 35(12), Dec. 1992.
5. J. Han and Y. Fu, “Discovery of multiple-level association rules from large databases,” Proc of the 21st VLDB Conf., pp. 420–431, 1995.
6. 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.
7. 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.
8. 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.
9. 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.
10. M. J. Pazzani, “A framework for collaborative, content-based and demographic filtering,” Artificial Intelligence Review, pp. 393-408, 1999.
11. 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.
12. 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.
13. R. Srikant and R. Agrawal, “Mining generalized association rules,” Proc of the 21st VLDB Conf, pp. 409–419, 1995.
14. E. Suzuki and Y. Kodratoff, “Discovery of surprising exception rules based on intensity of implication,” Proc of PKDD-98, France, p.10-18, 1998.
15. J. B. Schafer, J. A. Konstan, and J. Riedl, “E-Commerce Recommendation Applications,” Data Mining and Knowledge Discovery, 5(1), pp. 115-153, 2001.
16. 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.