Skip to main content

A Methodology for Exploring Association Models

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4404))

Abstract

Visualization in data mining is typically related to data exploration. In this chapter we present a methodology for the post processing and visualization of association rule models. One aim is to provide the user with a tool that enables the exploration of a large set of association rules. The method is inspired by the hypertext metaphor. The initial set of rules is dynamically divided into small comprehensible sets or pages, according to the interest of the user. From each set, the user can move to other sets by choosing one appropriate operator. The set of available operators transform sets of rules into sets of rules, allowing focusing on interesting regions of the rule space. Each set of rules can also be then seen with different graphical representations. The tool is web-based and dynamically generates SVG pages to represent graphics. Association rules are given in PMML format.

This work is supported by the European Union grant IST-1999-11.495 Sol-Eu-Net and the POSI/2001/Class Project sponsored by Fundação Ciência e Tecnologia, FEDER e Programa de Financiamento Plurianual de Unidades de I & D.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast Discovery of Association Rules. Advances in Knowledge Discovery and Data Mining, 307–328 (1996)

    Google Scholar 

  2. Azevedo, P.J.: CAREN – A Java based Apriori Implementation for Classification Purposes, Technical Report, Departamento de Informática, Universidade do Minho, http://www.di.uminho.pt/~pja/class/caren.html

  3. Berry, M.J.A., Linoff, G.S.: Data Mining Techniques: For Marketing, Sales, and Customer Support. John Wiley & Sons, Chichester (1997)

    Google Scholar 

  4. Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Building an Association Rules Framework to Improve Product Assortment Decisions. Data Min. Knowl. Discov. 8(1), 7–23 (2004)

    Article  MathSciNet  Google Scholar 

  5. Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. SIGMOD Record (ACM Special Interest Group on Man-agement of Data) 26(2), 255 (1997), http://citeseer.nj.nec.com/brin97dynamic.html

    Google Scholar 

  6. Chen, M.-C., Lin, C.-P.: A data mining approach to product assortment and shelf space allocation. In: Expert Systems with Applications. Elsevier, Amsterdam (2006)

    Google Scholar 

  7. Chang, H.-J., Hung, L.-P., Ho, C.-L.: An anticipation model of potential customers’ pur-chasing behavior based on clustering analysis and association rules analysis. In: Expert Systems with Applications. Elsevier, Amsterdam (2007)

    Google Scholar 

  8. Clementine Software, SPSS, http://www.spss.com

  9. Data Mining Group (PMML development), http://www.dmg.org/

  10. Demiriz, A.: Enhancing Product Recommender Systems on Sparse Binary Data. Data Min. Knowl. Discov. 9(2), 147–170 (2004)

    Article  MathSciNet  Google Scholar 

  11. Jorge, A.: Hierarchical Clustering for thematic browsing and summarization of large sets of Association Rules. In: Proceedings of the Fourth SIAM International Conference on Data Mining, pp. 178–187. SIAM press, Philadelphia (2004)

    Google Scholar 

  12. Jorge, A., Poças, J., Azevedo, P.: Post-processing operators for browsing large sets of association rules. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS, vol. 2534, pp. 414–421. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Lent, B., Swami, A., Widom, J.: Clustering Association Rules. In: Gray, A., Larson, P. (eds.) Proc. of the Thirteenth International Conference on Data Engineering, ICDE 1997, IEEE Computer Society, Birmingham (1997)

    Google Scholar 

  14. Kandogan, E.: Visualizing Multi-dimensional Clusters, Trends and Outliers using Star Coordinates. In: Proceedings of KDD 2001, ACM Press, New York (2001)

    Google Scholar 

  15. Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., Verkamo, A.: Finding interesting rules from large sets of discovered association rules. In: Nabil, R., et al. (eds.) Proceedings of 3rd International Conference on Information and Knowledge Management, pp. 401–407. ACM Press (1994)

    Google Scholar 

  16. Li, W., Han, J., Pei, J.: CMAR: Accurate and Efficient Classification Based on Multiple-Class-Association Rules. In: IEEE International Conference on Data Mining (2001), http://citeseer.nj.nec.com/li01cmar.html

  17. Ma, Y., Liu, B., Wong, K.: Web for Data Mininig: Organizing and Inter-preting the Discovered Rules Using the Web, School. SIGKDD Explorations, ACM SIGKDD 2(1) (July 2000)

    Google Scholar 

  18. Microsoft Web Site (JScript and JavaScript) and ASP, http://support.microsoft.com , http://support.microsoft.com

  19. Poças, J.: Um ambiente de pós-processamento para regras de associação. MSc. Thesis in Portuguese, Mestrado em Análise de Dados e Sistemas de Apoio à Decisão (2003)

    Google Scholar 

  20. Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: Proc. of 21st Intl. Conf. on Very Large Databases (VLDB) (1995)

    Google Scholar 

  21. Silberschatz, A., Tuzhilin, A.: On subjective measures of interestingness in knowledge discovery. In: Proceedings of the First International Conference on Knowledge Discovery and Data Mining, pp. 275–281 (1995), http://citeseer.nj.nec.com/silberschatz95subjective.html

  22. Tan, P.-N., Kumar, V.: Interestingness measures for association patterns: a perspective. In: Proceedings of the Workshop on Post-processing in Machine Learning and Data Mining, associated to KDD 2000 (2000)

    Google Scholar 

  23. Toivonen, H.: Sampling large databases for association rules. In: Proc. of 22nd Intl. Conf. on Very Large Databases (VLDB) (1996), http://citeseer.nj.nec.com/toivonen96sampling.html

  24. W3C DOM Level 1 specification, http://www.w3.org/DOM/

  25. W3C, Scalable Vector Graphics (SVG) 1.0 Specification, W3C Recommendation (September 2001), http://www.w3.org/TR/SVG/

  26. Wettshereck, D.: A KDDSE-independent PMML Visualizer. In: Bohanec, M., Mladenic, D., Lavrac, N. (eds.) Proc. of IDDM 2002, workshop on Integration aspects of Decision Support and Data Mining. associated to the conferences ECML/PKDD (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Simeon J. Simoff Michael H. Böhlen Arturas Mazeika

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jorge, A., Poças, J., Azevedo, P.J. (2008). A Methodology for Exploring Association Models. In: Simoff, S.J., Böhlen, M.H., Mazeika, A. (eds) Visual Data Mining. Lecture Notes in Computer Science, vol 4404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71080-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71080-6_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71079-0

  • Online ISBN: 978-3-540-71080-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics