Skip to main content
Have a personal or library account? Click to login
Mining Indirect Association Rules for Web Recommendation Cover

Mining Indirect Association Rules for Web Recommendation

International Journal of Applied Mathematics and Computer Science
Volume 19 (2009): Issue 1 (March 2009)
By:   
Open Access
|Apr 2009
References

References

  1. Adomavicius, G. and Tuzhilin, A. (2001). Using data mining methods to build customer profiles,34(2): 74-82.
    Open DOISearch in Google Scholar
  2. Agrawal, R., Imieliński, T. and Swami, A. (1993). Mining association rules between sets of items in large databases,, Washington, DC, USA, ACM Press, New York, NY, pp. 207-216.
    Search in Google Scholar
  3. Agrawal, R. and Srikant, R. (1994). Fast algorithms for mining association rules,, Santiago de Chile, Chile, Morgan Kaufmann, pp. 487-499.
    Search in Google Scholar
  4. Agrawal, R. and Shafer, J.C. (1996). Parallel mining of association rules,8(6): 962-969.
    Open DOISearch in Google Scholar
  5. Boley, D., Gini, M., Gross, R., Han, E.H., Hastings, K., Karypis, G., Kumar, V., Mobasher, B. and Moorey, J. (1999). Document categorization and query generation on the world wide web using WebACE,13(5-6): 365-391.
    Open DOISearch in Google Scholar
  6. Chen, L., Bhowmick, S.S. and Li, J. (2006). Mining temporal indirect associations,, Singapore,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 425-434.
    Search in Google Scholar
  7. Cheung, D.W.L., Han, J., Ng, V. and Wong, C.Y. (1996). Maintenance of discovered association rules in large databases: An incremental updating technique,, New Orleans, LA, USA, IEEE Computer Society, Los Alamitos, CA, pp. 106-114.
    Search in Google Scholar
  8. Cheung, D.W.L., Lee, S.D. and Kao, B. (1997). A general incremental technique for maintaining discovered association rules,, Melbourne, Australia, Series 6, World Scientific, pp. 185-194.
    Search in Google Scholar
  9. Cho, Y.H., Kim, J.K. and Kim, S.H. (2002). A personalized recommender system based on web usage mining and decision tree induction,23(3): 329-342.
    Open DOISearch in Google Scholar
  10. Chun, J., Oh, J.-Y., Kwon, S. and Kim, D. (2005). Simulating the effectiveness of using association rules for recommendation systems,, Berlin-Heidelberg-New York, NY,, Springer Verlag, Berlin-Heidelberg-New York, NY, pp. 306-314.
    Search in Google Scholar
  11. Daniłowicz, C. and Baliński, J. (2001). Document ranking based upon Markov chains,37(4): 623-637.
    Open DOISearch in Google Scholar
  12. EU (2002). Directive 2002/58/EC of the European Parliament and of the Council of 12 July 2002 concerning the processing of personal data and the protection of privacy in the electronic communications sector, Available at
    Search in Google Scholar
  13. Fagin, R., Kumar, R. and Sivakumar, D. (2003). Comparing toplists,17(1): 134-160.
    Open DOISearch in Google Scholar
  14. Géry, M. and Haddad, M.H. (2003). Evaluation of web usage mining approaches for user's next request prediction,, New Orleans, LA, USA, ACM Press, New York, NY, pp. 74-81.
    Search in Google Scholar
  15. Goodrum, A., McCain, K.W., Lawrence, S. and Giles, C.L. (2001). Scholarly publishing in the Internet age: A citation analysis of computer science literature,37(5): 661-675.
    Open DOISearch in Google Scholar
  16. Ha, S.H. (2002). Helping online customers decide through web personalization,17(6): 34-43.
    Open DOISearch in Google Scholar
  17. Hao, M.C., Hsu, M., Dayal, U., Wei, S.F., Sprenger, T. and Holenstein, T. (2001). Market basket analysis visualization on a spherical surface,, San Jose CA, pp. 227-233, Available at http://www. hpl. hp. com/techreports/2001/HPL-2001-3.pdf.
    Search in Google Scholar
  18. Hamano, S. and Sato, M. (2004). Mining indirect association rules,, Leipzig, Germany,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 106-116.
    Search in Google Scholar
  19. Han, J., Pei, J. and Yin, Y. (2000). Mining frequent patterns without candidate generation,, Dallas, TX, USA, ACM Press, New York, NY, pp. 1-12.
    Search in Google Scholar
  20. Henzinger, M.R. (2001). Hyperlink analysis for the Web,5(1): 45-50.
    Open DOISearch in Google Scholar
  21. Juszczyszyn, K., Kazienko, P. and Musiał, K. (2008). Local topology of social network based on motif analysis,, Zagreb, Croatia,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp.97-105, (in press).
    Search in Google Scholar
  22. Kazienko, P. and Kiewra, M. (2003). ROSA—Multi-agent system for web services personalization,, Madrid, Spain,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 297-306.
    Search in Google Scholar
  23. Kazienko, P. (2004a). Multi-agent web recommendation method based on indirect association rules,, Wellington, New Zealand,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 1157-1164.
    Open DOISearch in Google Scholar
  24. Kazienko, P. (2004b). Product recommendation in e-commerce using direct and indirect confidence for historical user sessions,, Padova, Italy,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 255-269.
    Open DOISearch in Google Scholar
  25. Kazienko, P. and Adamski, M. (2007). AdROSA—Adaptive personalization of web advertising,177(11): 2269-2295.
    Open DOISearch in Google Scholar
  26. Kazienko, P. and Kiewra, M. (2004). Personalized recommendation of web pages,T. Nguyen (Ed.),, Advanced Knowledge International, Adelaide, Australia, pp. 163-183.
    Search in Google Scholar
  27. Kazienko, P. and Kuźmińska, K. (2005). The influence of indirect association rules on recommendation ranking lists,, Wrocław, Polan, IEEE Computer Society, Los Alamitos, CA, pp. 482-487.
    Search in Google Scholar
  28. Kazienko, P. and Matrejek, M. (2005). Adjustment of indirect association rules for the web,, Liptovský Ján, Slovakia,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 211-220.
    Search in Google Scholar
  29. Kazienko, P. and Pilarczyk, M. (2008). Hyperlink recommendation based on positive and negative association rules,26(3):227-244, (in press).
    Open DOISearch in Google Scholar
  30. Kendall, M.G. (1948)., Charles Griffin & Company, Ltd., London.
    Search in Google Scholar
  31. Kobsa, A. (2002). Personalized hypermedia and international privacy,45(5): 64-67.
    Open DOISearch in Google Scholar
  32. Lawrence, S., Giles, C.L. and Bollacker, K. (1999). Digital libraries and autonomous citation indexing,32(6): 67-71.
    Open DOISearch in Google Scholar
  33. Lawrence, R.D., Almasi, G.S., Kotlyar, V., Viveros, M.S. and Duri, S.S. (2001). Personalization of supermarket product recommendations.5(1/2): 11-32.
    Search in Google Scholar
  34. Lee, G., Lee, K.L. and Chen, A.L.P. (2001). Efficient graph-based agorithms for discovering and maintaining association rules in large databases,3(3): 338-355.
    Open DOISearch in Google Scholar
  35. Lu, Z., Yao, Y. and Zhong, N. (2003). Web log mining,N. Zhong, J. Liu and Y. Yao (Eds.),, Springer, Berlin/New York, NY.
    Open DOISearch in Google Scholar
  36. Madria, S.K., Bhowmick, S.S., Ng, W.-K. and Lim, E.P. (1999). Research issues in web data mining., Florence, Italy,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 303-312.
    Open DOISearch in Google Scholar
  37. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D. and Alon, U. (2002). Network motifs: Simple building blocks of complex networks.298(5594): 824-827.
    Search in Google Scholar
  38. Mobasher, B., Cooley, R. and Srivastava, J. (2000). Automatic personalization based on web usage mining,43(8): 142-151.
    Open DOISearch in Google Scholar
  39. Montaner, M., López, B. and de la Rosa, J.L. (2003). A taxonomy of recommender agents on the internet,19(4): 285-330.
    Open DOISearch in Google Scholar
  40. Morzy, T. and Zakrzewicz, M. (2003). Data mining,J. Błażewicz, W. Kubiak, T. Morzy and M. Rubinkiewicz (Eds.),, Springer-Verlag, Berlin/Heidelberg/New York, NY, pp. 487-565.
    Open DOISearch in Google Scholar
  41. Nakagawa, M. and Mobasher, B. (2003). Impact of site characteristics on recommendation models based on association rules and sequential patterns., Acapulco, Mexico, Available at http://maya. cs. depaul. edu/~{}mobasher/papers/NM03a. pdf.
    Search in Google Scholar
  42. Spearman, C. (1904/1987). The proof and measurement of association between two things,15: 72-101.
    Open DOISearch in Google Scholar
  43. Tan, P.-N., Kumar, V. and Srivastava, J. (2000). Indirect association: Mining higher order dependencies in data,, Lyon, France,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 632-637.
    Search in Google Scholar
  44. Tan, P.-N. and Kumar, V. (2002). Mining indirect associations in web data., San Francisco, CA, USA,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 145-166.
    Open DOISearch in Google Scholar
  45. Tan, P.-N. and Kumar, V. (2003). Discovery of indirect associations from web usage data,N. Zhong, J. Liu and Y.Y. Yao (Eds.),, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 128-152.
    Open DOISearch in Google Scholar
  46. Wan, Q. and An, A. (2003). Efficient mining of indirect associations using HI-mine,, Halifax, Canada,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 206-221.
    Search in Google Scholar
  47. Wan, Q. and An, A. (2006a). An efficient approach to mining indirect associations.27(2): 135-158.
    Open DOISearch in Google Scholar
  48. Wan, Q. and An, A. (2006b). Efficient indirect association discovery using compact transaction databases,, Atlanta, GA, USA, IEEE Press, Los Alamitos, Ca, Available at http://www. cse. yorku. ca/~{}aan/research/paper/grc06-final. pdf.
    Search in Google Scholar
  49. Wang, D., Bao, Y., Yu, G. and Wang, G. (2002). Using page classification and association rule mining for personalized recommendation in distance learning,, Hong Kong, China,, Springer Verlag, Berlin-Heidelberg-New York, NY, pp. 363-376.
    Search in Google Scholar
  50. Weiss, R., Velez, B., Sheldon, M.A., Namprempre, C., Szilagyi, P., Duda, A. and Gifford, D.K. (1996). HyPursuit: A hierarchical network search engine that exploits content-link hypertext clustering,, Washington, DC, USA, ACM Press, New York, NY, pp. 180-193.
    Search in Google Scholar
  51. Yang, H. and Parthasarathy, S. (2003). On the use of constrained associations for web log mining,, Edmonton, Canada,, Springer-Verlag, Berlin-Heidelberg-New York, NY, pp. 100-118.
    Search in Google Scholar
  52. Yen, S.J. and Chen, A.L.P. (1996). An efficient approach to discovering knowledge from large databases,, Miami Beach, FL, USA, IEEE Computer Society, Los Alamitos, CA, pp. 8-18.
    Search in Google Scholar
  53. Zaki, M.J., Parathasarathy, S. and Li, W. (1997). A localized algorithm for parallel association mining,, Newport, RI, USA, ACM Press, New York, NY, pp. 321-330.
    Search in Google Scholar
DOI: https://doi.org/10.2478/v10006-009-0015-5 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 165 - 186
Published on: Apr 2, 2009
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
association rules,
indirect association rules,
recommender system,
web mining,
web usage mining
Related subjects:
Mathematics,
Applied mathematics

© 2009 Przemysław Kazienko, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 19 (2009): Issue 1 (March 2009)
Previous article