Skip to main content

A Pragmatic Approach to Summarize Association Rules in Business Analytics Projects

  • Conference paper
Technologies and Applications of Artificial Intelligence (TAAI 2014)

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

Abstract

Association rule mining is an important data mining method primarily used for market basket analysis. However, the method usually generates a large number of association rules; and it is difficult to use domain-independent objective measures to help find pragmatically important rules. To address these issues, we present a general method that succinctly summarizes rules with common consequent(s). This consequent-based approach allows user to focus on evaluating a rule set based on the practical significance of consequent(s) in an application domain, which usually outweighs the importance of objective measures such as rule confidence. We provide a case study to demonstrate how the proposed method can be used in conjunction with a heuristic procedure to find important rules generated from large real-world data, leading to discovery of important business knowledge and insights.

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., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: Proc. of the ACM Conference on Management of Data, pp. 207–216 (1993)

    Google Scholar 

  2. An, A., Khan, S., Huang, X.: Objective and subjective algorithms for grouping association rules. In: Proc of the Third IEEE International Conference on Data Mining, pp. 477–480 (2003)

    Google Scholar 

  3. Ashrafi, M.Z., Taniar, D., Smith, K.: A new approach of eliminating redundant association rules. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds.) DEXA 2004. LNCS, vol. 3180, pp. 465–474. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Kotsiantis, S., Kanellopoulos, D.: Association Rules Mining: A Recent Overview. GESTS International Transactions on Computer Science and Engineering 32(1), 71–82 (2006)

    Google Scholar 

  5. Liu, B., Hu, M., Hsu, W.: Multi-level organization and summarization of the discovered rules. In: Proc. of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 208–217 (2000)

    Google Scholar 

  6. Luong, V.P.: The representative basis for association rules. In: Proc. of IEEE International Conference on Data Mining, pp. 639–640 (2001)

    Google Scholar 

  7. Mansingh, G., Osei-Bryson, K.-M., Reichgelt, H.: Using ontologies to facilitate post -processing of association rules by domain experts. Information Sciences 181(3), 419–434 (2001)

    Article  Google Scholar 

  8. Marinica, C., Guillet, F., Briand, H.: Post-Processing of Discovered Association Rules Using Ontologies. In: Proc. of the IEEE International Conference on Data Mining Workshops, ICDMW 2008, pp. 126–133 (2008)

    Google Scholar 

  9. Sadhasivam, K.S.C., Angamuthu, T.: Mining rare itemset with automated support thresholds. Journal of Computer Science 7(3), 394–399 (2011)

    Article  Google Scholar 

  10. Shaw, G., Xu, Y., Geva, S.: Eliminating Association Rules in Multi-level Datasets. In: Proc. of the 4th International Conference on Data Mining (DMIN 2008), Las Vegas, USA, pp. 313–319 (2008)

    Google Scholar 

  11. Tan, S.C., Lau, P.S.: Time Series Clustering: A Superior Alternative for Market Basket Analysis. In: Proc. of The First International Conference on Advanced Data and Information Engineering (2013)

    Google Scholar 

  12. Tseng, M.C., Lin, W.Y.: Efficient Mining of Generalized Association Rules with Non-uniform Minimum Support. Data & Knowledge Engineering 62(1), 41–64 (2007)

    Article  Google Scholar 

  13. Toivonen, H., Klemetinen, M., Ronkainen, P., Hatonen, K., Mannila, H.: Pruning and grouping discovered association rules. In: Proc. of Mlnet Workshop on Statistics, Machine Learning, and Discovery in Databases, pp. 47–52 (1995)

    Google Scholar 

  14. Xu, Y., Li, Y., Shaw, G.: Reliable representations for association rules. Data & Knowledge Engineering 70(6), 555–575 (2011)

    Article  Google Scholar 

  15. Zaki, M.J.: Generating Non-redundant Association Rules. In: Proc. of the 6th ACM Knowledge Discovery and Data Mining Conference (SIGKDD 2000), pp. 34–43 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Tan, S.C., Sim, B.H. (2014). A Pragmatic Approach to Summarize Association Rules in Business Analytics Projects. In: Cheng, SM., Day, MY. (eds) Technologies and Applications of Artificial Intelligence. TAAI 2014. Lecture Notes in Computer Science(), vol 8916. Springer, Cham. https://doi.org/10.1007/978-3-319-13987-6_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13987-6_30

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13986-9

  • Online ISBN: 978-3-319-13987-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics