Skip to main content

A Novel Method for Mining Class Association Rules with Itemset Constraints

  • Conference paper

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

Abstract

Mining class association rules with itemset constraints is very popular in mining medical datasets. For example, when classifying which populations are at high risk for the HIV infection, epidemiologists often concentrate on rules which include demographic information such as sex, age, and marital status in the rule antecedents. However, two existing methods, post-processing and pre-processing, require much time and effort. In this paper, we propose a lattice-based approach for efficiently mining class association rules with itemset constraints. We first build a lattice structure to store all frequent itemsets. We then use paternity relations among nodes to discover rules satisfying the constraint without re-building the lattice. The experimental results show that our proposed method outperforms other methods in the mining time.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vo, B., Le, B.: Mining traditional association rules using frequent itemsets lattice. In: The 39th International Conference on Computers & Industrial Engineering (CIE 2009), pp. 1401–1406. IEEE (2009)

    Google Scholar 

  2. Nguyen, D., Vo, B., Le, B.: Efficient Strategies for Parallel Mining Class Association Rules. Expert Systems with Applications 41, 4716–4729 (2014)

    Article  Google Scholar 

  3. Van, T.-T., Vo, B., Le, B.: IMSR_PreTree: an improved algorithm for mining sequential rules based on the prefix-tree. Vietnam Journal of Computer Science 1, 97–105 (2014)

    Article  Google Scholar 

  4. Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: The 4th International Conference on Knowledge Discovery and Data Mining (KDD 1998), pp. 80–86 (1998)

    Google Scholar 

  5. Vo, B., Le, B.: A novel classification algorithm based on association rules mining. In: Richards, D., Kang, B.-H. (eds.) PKAW 2008. LNCS, vol. 5465, pp. 61–75. Springer, Heidelberg (2009)

    Google Scholar 

  6. Nguyen, L.T., Vo, B., Hong, T.-P., Thanh, H.C.: CAR-Miner: An efficient algorithm for mining class-association rules. Expert Systems with Applications 40, 2305–2311 (2013)

    Article  Google Scholar 

  7. Nguyen, D., Vo, B.: Mining class-association rules with constraints. In: Van Huynh, N., Denoeux, T., Tran, D.H., Le, A.C., Pham, B.S. (eds.) KSE 2013, Part II. AISC, vol. 245, pp. 323–334. Springer, Heidelberg (2014)

    Google Scholar 

  8. Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: The 3rd International Conference on Knowledge Discovery and Data Mining (KDD 1997), pp. 67–73 (1997)

    Google Scholar 

  9. Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: ACM SIGMOD International Conference on Management of Data, pp. 13–24. ACM (1998)

    Google Scholar 

  10. Lin, W.-Y., Huang, K.-W., Wu, C.-A.: MCFPTree: An FP-tree-based algorithm for multi-constraint patterns discovery. International Journal of Business Intelligence and Data Mining 5, 231–246 (2010)

    Article  Google Scholar 

  11. Nguyen, D., Truong, T., Vo, B.: Mining Frequent Patterns containing HIV-Positive in HIV Voluntary Counseling and Testing data. ICIC Express Letters 8, 541–546 (2014)

    Google Scholar 

  12. Duong, H., Truong, T., Vo, B.: An efficient method for mining frequent itemsets with double constraints. Engineering Applications of Artificial Intelligence 27, 148–154 (2014)

    Article  Google Scholar 

  13. Vo, B., Le, T., Hong, T.-P., Le, B.: An effective approach for maintenance of pre-large-based frequent-itemset lattice in incremental mining. Applied Intelligence (in press, 2014)

    Google Scholar 

  14. Nguyen, L.T., Vo, B., Hong, T.-P., Thanh, H.C.: Classification based on association rules: A lattice-based approach. Expert Systems with Applications 37, 11357–11366 (2012)

    Article  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

Nguyen, D., Vo, B., Le, B. (2014). A Novel Method for Mining Class Association Rules with Itemset Constraints. In: Hwang, D., Jung, J.J., Nguyen, NT. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2014. Lecture Notes in Computer Science(), vol 8733. Springer, Cham. https://doi.org/10.1007/978-3-319-11289-3_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11289-3_50

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11288-6

  • Online ISBN: 978-3-319-11289-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics