Abstract
Recommendation systems help overcome information overload by providing personalized suggestions based on a history of users’ preference. Association rule-based filtering method is often used for automatic recommendation systems yet it inherently lacks ability to single out a product to recommend for each individual user. In this paper, we propose an association rule ranking algorithm. In the algorithm, we measure how much a user is relevant to every association rule by comparing attributes of a user with the attributes of others who belong to the same association rule. By providing such an algorithm, it is possible to recommend products with associated rankings, which results in better customer satisfaction. We show through simulations, that the accuracy of association rule-based filtering is improved if we appropriately rank association rules for a given user.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on Management of Data, Washington D.C., pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast Algorithm for Mining Association Rules. In: Proceedings of the 20th VLDB Conference, Santiago, Chile (1994)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining using twodimensional optimized association rules for numeric data: scheme, algorithms, visualization. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Montreal, Canada, pp. 13–23 (1996)
Goldberg, D., Nichols, D., Oki, B.M., Terry, D.: Using Collaborative Filtering to Weave an Information Tapestry. Communications of the ACM 35(12), 61–70 (1992)
Holsheimer, M., Kersten, M., Mannila, H., Toivonent, H.: A perspective on database and data mining. In: Proceedings of the First International Conference on Knowledge Discovery and Data Mining, Montreal, Canada (1996)
Resnick, P., Neophytos, I., Miteth, S., Bergstrom, P., Riedl, J.: GroupLens: An Open Architecture for Collaborative Filtering of Netnews. In: Proceedings of CSCW 1994: Conference on Computer Supported Cooperative Work, Chapel Hill NC, pp. 175–186. Addison-Wesley, Reading (1994)
Shardanand, U., Maes, P.: Social Information Filtering: Algorithms for Automating ’Word of Mouth’. In: Proceedings of CHI 1995, Denver CO, pp. 210–217. ACM Press, New York (1995)
Zheng, Z., Kohavi, R., Mason, L.: Real World Performance of Association Rule Algorithms. In: Proceedings of the Seventh ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY (2001)
Sarwar, Badrul, M., Karypis, G., Kontan, J.A., John T.: Application of dimensionality Reduction in recommender System. In: Proceedings of WebKDD 2000 Workshop Web Mining for E-Commerce-Challenges and Opportunities (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chun, J., Oh, J.Y., Kwon, S., Kim, D. (2005). Simulating the Effectiveness of Using Association Rules for Recommendation Systems. In: Baik, DK. (eds) Systems Modeling and Simulation: Theory and Applications. AsiaSim 2004. Lecture Notes in Computer Science(), vol 3398. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30585-9_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-30585-9_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24477-6
Online ISBN: 978-3-540-30585-9
eBook Packages: Computer ScienceComputer Science (R0)