Skip to main content

The Association Rule Algorithm with Missing Data in Data Mining

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3043))

Included in the following conference series:

Abstract

This paper discusses the use of an association rule algorithm in data mining and the processes of handling missing data in a distributed database environment. The investigation generated improved association rules using the model described here. The evaluations showed that more association patterns were generated in which the algorithm for missing data was used; this suggested more rules generated than by simply ignoring them. This implies that the model offer more precise and important association rules that is more valuable when applied for business decision making. With the discovery of accurate association rules or business patterns, approach for better market plans can be prepared and implemented to improve marketing schemes. One best-related application of handling missing data is for detecting fraud or devious database entries.

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 74.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, Srikant.: Fast Algorithms for Mining Association Rules. In: Proceeding of International Conference on Very Large Databases VLDB, pp. 487–499 (1994)

    Google Scholar 

  2. Coenen, F.: The Apriori Algorithm. (2001), http://www.csc.liv.ac.uk/~fans/ KDD/ aprioriTdemo.html#algorithm

  3. Edelstein, Herb. Data Mining: Can you dig it? articles/2003/vol3_no2/enterpriseviews, http://www.teradatamagazine.com/

  4. Han, J., Kamber, M.: Data mining concepts and techniques. Morgan Kaufmann, USA (2001)

    Google Scholar 

  5. Hellerstein, J.L., Ma, S., Perng, C.S.: Discovering actionable patterns in event data. IBM Systems Journal 41(3) (2002)

    Google Scholar 

  6. Multi-Dimensional Constrained Gradient Mining /JoyceManWingLamMSc.pdf (2001), ftp://fas.sfu.ca/pub/cs/theses/

  7. Nayak, R., J., Cook, D.J.: Approximate Association Rule Mining. In: Proceedings of the Florida Artificial Intelligence Research Symposium (2001)

    Google Scholar 

  8. Nestorov, Svetlozar, Jukic: Nenad. Ad-Hoc Association-Rule Mining within the Data Warehouse. In: Proceedings of 36th Annual Hawaii International Conference on System Sciences, January 2003, p. 232a (2003)

    Google Scholar 

  9. Pairwise Deletion of Missing Data vs. Mean Substitution. http:// /textbook/glosp.html, http://www.statsoftinc.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gerardo, B.D., Lee, J., Lee, J., Park, M., Lee, M. (2004). The Association Rule Algorithm with Missing Data in Data Mining. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24707-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24707-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics