Abstract
It is important to propose effective algorithms that find basic association rules and generate all consequence association rules from those basic rules. In this paper, we propose the new concept of eliminable itemset to show how to represent itemset by generators and eliminable itemsets. Using algebraic approach based on equivalence relations, we propose a new approach to partition the set of association rules into basic and consequence sets. After describing their strict relations, we propose two ways to derive all consequence association rules from the basic association rules. These two ways satisfy the properties: sufficiency, preserved confidence. Moreover, they do not derive repeated consequence rules. Hence, we save much time for discovering association rule mining.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal, C.C., Yu, P.S.: Online Generation of Association Rules. In: Proceedings of the International Conference on Data Engineering, pp. 402–411 (1998)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th Very Large Data Bases Conference Santiago, Chile, pp. 478–499 (1994)
Bao, H.T.: An approach to concept formation based on formal concept analysis. IEICE trans, Information and systems E78-D(5) (1995)
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal Non- Redundant Association Rules Using Frequent Closed Itemsets. In: 1st International Conference on Computational Logic (2000)
Godin, R., Missaoul, R., Alaour, H.: Incremental concept formation algorithms based on Galois lattices. Magazine of computational Intelligence, 246–247 (1995)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining of association rules using closed item set lattices. Information systems 24(1), 25–46 (1999)
Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. J. of Intelligent Information Systems 24(1), 29–60 (2005)
Zaki, M.J.: Mining Non-Redundant Association Rules. Data Mining and Knowledge Discovery 9, 223–248 (2004)
Frequent Itemset Mining Dataset Repository (2009), http://fimi.cs.helsinki.fi/data/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Truong, T.C., Tran, A.N. (2010). Structure of Set of Association Rules Based on Concept Lattice. In: Nguyen, N.T., Katarzyniak, R., Chen, SM. (eds) Advances in Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12090-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-12090-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12089-3
Online ISBN: 978-3-642-12090-9
eBook Packages: EngineeringEngineering (R0)