Skip to main content

Association Rules Mining Based on Minimal Generator of Frequent Closed Itemset

  • Chapter
  • First Online:
Ecosystem Assessment and Fuzzy Systems Management

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 254))

Abstract

As there is rules redundancy in mining association rules with traditional methods, an improvement is presented by increasing combinations of itemsets based on minimal generator method; thus, the loss of minimal generator items of frequent closed itemsets is avoided, and the concept and process of rule generation algorithm are further simplified, which makes the algorithm more readable and easier to implement. Experimental results show that the algorithm provide better integrity of minimal generator items and more effective association rules without increasing timing cost.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

References

  1. Luo, G., Liu, J.: Algorithm based on association rule for adjacency graph of frequent closed itemset. Comput. Eng. 36(12), 36–42 (2010)

    Google Scholar 

  2. Pasquier, N., Bastide, Y.: Discovering frequent closed itemsets for association rules. In: Proceedings of the 7th International Conference on Database Theory Jerusalem, pp. 398–416. Springer (1999)

    Google Scholar 

  3. Li, J., Xu, Y., Wang, Y., Wang, Y.: The simplest association rule and mining algorithm. Comput. Eng. 33(13), 46–48 (2007)

    Google Scholar 

  4. Geng, L., Hamiton, J.: Interestingness measure for data mining: a survey. ACM Comput. Surv. 38(3), 1145–1177 (2006)

    Article  Google Scholar 

  5. Shao, F., et al.: Data Mining: Principles and Algorithms, 2nd edn, vol. 9, pp. 90–91. Science Press (2009)

    Google Scholar 

  6. Bastide, Y., Pasquier, N., Taouil, R., et al.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Proceedings of the 1st International Conference on Computational Logic, pp. 927–986. Springer, London (2000)

    Google Scholar 

Download references

Acknowledgments

Thanks to the support by The Introduction of International Advanced Forestry Science and Technology project of the State Forestry Administration of China (No. 2013-4-65), the National Natural Science Foundation of China (No. 41271387), the tourism constructing study soft science project of Xian city (No. SF1228-3), and the academician innovation project of Shaanxi Normal University (No. 999521).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chang-ying Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Chen, Xm., Wang, Cy., Cao, H. (2014). Association Rules Mining Based on Minimal Generator of Frequent Closed Itemset. In: Cao, BY., Ma, SQ., Cao, Hh. (eds) Ecosystem Assessment and Fuzzy Systems Management. Advances in Intelligent Systems and Computing, vol 254. Springer, Cham. https://doi.org/10.1007/978-3-319-03449-2_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03449-2_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03448-5

  • Online ISBN: 978-3-319-03449-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics