Skip to main content
Springer Nature Link
Log in

Adjustment of Indirect Association Rules for the Web

  • Conference paper
SOFSEM 2005: Theory and Practice of Computer Science (SOFSEM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3381))

  • 709 Accesses

Abstract

Indirect association rules are the extension of classic association rules that enables to discover indirect relationships existing between objects. To estimate the importance of individual parameters of the indirect association rules mining, experiments were carried out on historical web user sessions coming from an e-commerce portal. The influence of parameters of standard direct rules: direct support and direct confidence thresholds, was studied and it was proved that greater values of these two thresholds could significantly decrease the final quantity of indirect rules. This reduction may be additionally strengthened by the introduction of additional threshold to complete or partial indirect confidence. The choice of calculation method for partial indirect confidence was also examined and the multiplication method was selected as the most discriminative.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Adomavicius, G., Tuzhilin, A.: Using Data Mining Methods to Build Customer Profiles. IEEE Computer 34(2), 74–82 (2001)

    Google Scholar 

  2. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Int. Conference on Management of Data, pp. 207–216. ACM Press, New York (1993)

    Google Scholar 

  3. Cheung, D.W.L., Han, J., Ng, V., Wong, C.Y.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In: Twelfth Int. Conference on Data Engineering, pp. 106–114. IEEE Computer Society, Los Alamitos (1996)

    Chapter  Google Scholar 

  4. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: ACM SIGMOD Int. Conference on Management of Data, pp. 1–12. ACM, New York (2000)

    Chapter  Google Scholar 

  5. Kazienko, P.: IDARM - Mining of Indirect Association Rules (2005) (to appear)

    Google Scholar 

  6. Kazienko, P.: Multi-agent Web Recommendation Method Based on Indirect Association Rules. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds.) KES 2004. LNCS (LNAI), vol. 3214, pp. 1157–1164. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Kazienko, P.: Product Recommendation in E-Commerce Using Direct and Indirect Confidence for Historical User Sessions. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 255–269. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Kazienko, P., Kiewra, M.: Link Recommendation Method Based on Web Content and Usage Mining. In: Proc. of the International IIS: IIPWM 2003 Conference, Zakopane, Advances in Soft Computing, pp. 529–534. Springer, Heidelberg (2003)

    Google Scholar 

  9. Kazienko, P., Kiewra, M.: Personalized Recommendation of Web Pages. In: Nguyen, T. (ed.) Intelligent Technologies for Inconsistent Knowledge Processing. Advanced Knowledge International, ch. 10, Adelaide, South Australia, pp. 163–183 (2004)

    Google Scholar 

  10. Mobasher, B., Cooley, R., Srivastava, J.: Automatic Personalization Based on Web Usage Mining. Communications of the ACM 43(8), 142–151 (2000)

    Article  Google Scholar 

  11. Morzy, T., Zakrzewicz, M.: Data mining. In: Błażewicz, J., Kubiak, W., Morzy, T., Rubinkiewicz, M. (eds.) Handbook on Data Management in Information Systems, ch. 11, pp. 487–565. Springer, Heidelberg (2003)

    Google Scholar 

  12. Tan, P.-N., Kumar, V.: Mining Indirect Associations in Web Data. In: Kohavi, R., Masand, B., Spiliopoulou, M., Srivastava, J. (eds.) WebKDD 2001. LNCS (LNAI), vol. 2356, pp. 145–166. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Tan, P.-N., Kumar, V., Srivastava, J.: Indirect Association: Mining Higher Order Dependencies in Data. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 632–637. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Yang, H., Parthasarathy, S.: On the Use of Constrained Associations for Web Log Mining. In: Zaïane, O.R., Srivastava, J., Spiliopoulou, M., Masand, B. (eds.) WebKDD 2003. LNCS (LNAI), vol. 2703, pp. 100–118. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Yen, S.J., Chen, A.L.P.: An Efficient Approach to Discovering Knowledge from Large Databases. In: 4th Int.Conf. on Parallel and Distributed Information Systems, pp. 8–18. IEEE Computer Society, Los Alamitos (1996)

    Google Scholar 

  16. Zaki, M.J., Parathasarathy, S., Li, W.: A Localized Algorithm for Parallel Association Mining. In: SPAA 1997, 9th ACM Symposium on Parallel Algorithms and Architectures, pp. 321–330 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems, Wrocław University of Technology, Wybrże S. Wyspiańskiego 27, 50-370, Wrocław, Poland

    Przemysław Kazienko & Mariusz Matrejek

Authors
  1. Przemysław Kazienko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mariusz Matrejek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Charles University, Prague, Czech Republic

    Peter Vojtáš

  2. Institute of Informatics and Software Engineering Faculty of Informatics and Information technologies, Slovak University of Technology, Ilkovičova 3, 842 16, Bratislava,  

    Mária Bieliková

  3. STIX, École Polytechnique, 91128, Palaiseau Cedex, France

    Bernadette Charron-Bost

  4. Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kazienko, P., Matrejek, M. (2005). Adjustment of Indirect Association Rules for the Web. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30577-4_25

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30577-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation