Skip to main content

Identifying Relationships in Transactional Data

  • Conference paper
Book cover Advances in Artificial Intelligence – IBERAMIA 2012 (IBERAMIA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7637))

Included in the following conference series:

Abstract

Association rules is the traditional way used to study market basket or transactional data. One drawback of this analysis is the huge number of rules generated. As a complement to association rules, Association Rules Network (ARN), based on Social Network Analysis (SNA) has been proposed by several researchers. In this work we study a real market basket analysis problem, available in a Belgian supermarket, using ARNs. We learn ARNs by considering the relationships between items that appear more often in the consequent of the association rules. Moreover, we propose a more compact variant of ARNs: the Maximal Itemsets Social Network. In order to assess the quality of these structures, we compute SNA based metrics, like weighted degree and utility of community.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: 20th Intl. Conf. on Very Large Data Bases (VLDB 1994), pp. 487–499 (1994)

    Google Scholar 

  2. Albert, R., Barabasi, A.: Statistical Mechanisms of Complex Networks. Reviews of Modern Physics 74, 47–97 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blondel, V.D., Guillaumem, J., Lambiotte, R., Lefebrvre, E.: Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics: Theory and Experiment P10008, 1–12 (2008)

    Google Scholar 

  4. Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Using Association Rules for Product Assortment Decisions – A Case Study. In: 5th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining (KDD 1999), pp. 254–260. ACM (1999)

    Google Scholar 

  5. Easley, D., Kleinberg, J.: Networks, Crowds, and Markets – Reasoning About a Highly Connected World. Cambridge University Press (2010)

    Google Scholar 

  6. Faceli, K., Lorena, A.C., Gama, J., Carvalho, A.: Inteligência Artificial – Uma Abordagem de Aprendizado de Máquina. Livros Técnicos e Científicos (2011)

    Google Scholar 

  7. Fruchterman, T., Reingold, E.M.: Graph Drawing by Force-Directed Placement. Software: Practice and Experience 21(11), 1129–1164 (1991)

    Google Scholar 

  8. Kretschmer, H., Kretschmer, T.: Application of a New Centrality Measure for Social Network Analysis to Bibliometric and Webometric Data. In: 1st IEEE Int. Conf. of Digital Information Management (ICDIM 2006), pp. 199–204. IEEE (2006)

    Google Scholar 

  9. Lopez-Fernandez, L., Robles, G., Gonzalez-Barahona, J.M.: Applying Social Network Analysis to the Information in CVS Repositories. In: 1st International Workshop on Mining Software Repositories (MSR 2004), pp. 101–105 (2004)

    Google Scholar 

  10. Newman, M.E.J.: The Structure and Function of Complex Networks. Society for Industrial and Applied Mathematics Review 45(2), 167–256 (2003)

    MathSciNet  MATH  Google Scholar 

  11. Newman, M.E.J.: Fast Algorithm for Detecting Community Structure in Networks. Physical Review E 69(6), 066133, 1–5 (2004)

    Article  Google Scholar 

  12. Pandey, G., Chawla, S., Poon, S., Arunasalam, B., Davis, J.: Association Rules Network – Definition and Applications. Statistical Analysis and Data Mining 1(4), 260–279 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Raeder, T., Chawla, N.: Market Basket Analysis with Networks. Social Network Analysis and Mining 1(2), 97–113 (2011)

    Article  Google Scholar 

  14. Gouda, K., Zaki, M.: Efficiently Mining Maximal Frequent Itemsets. In: 2001 IEEE International Conference on Data Mining (ICDM 2001), pp. 163–170. IEEE (2001)

    Google Scholar 

  15. Bastian, M., Heymann, S., Jacomy, M.: Gephi – An Open Source Software for Exploring and Manipulating Networks. In: 3rd Intl. AAAI Conf. on Weblogs and Social Media (ICWSM 2009), pp. 361–362. AAAI (2009)

    Google Scholar 

  16. R Core Team: R – A Language and Environment for Statistical. R Foundation for Statistical Computing (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rodrigues, M., Gama, J., Ferreira, C.A. (2012). Identifying Relationships in Transactional Data. In: Pavón, J., Duque-Méndez, N.D., Fuentes-Fernández, R. (eds) Advances in Artificial Intelligence – IBERAMIA 2012. IBERAMIA 2012. Lecture Notes in Computer Science(), vol 7637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34654-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34654-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34653-8

  • Online ISBN: 978-3-642-34654-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics