Abstract
The generalized association rule base(GARB) presented by Li(2003) can efficiently solve the problem of quantity of rule in the process of acquiring rule by traditional association rule mining algorithms. Therefore, how to deduce all rules contained in the rule of GARB becomes an urgent issue in order to support more effective decision-making. In this paper, the notation of lower closed itemset of an itemset was proposed and some properties of it are proved. Then, it is concluded that the above problem can be solved if all the lower closed itemsets of frequent closed itemset(FCI) are obtained. Finally, an algorithm for mining all lower closed itemsets of an itemset was given and its validity is proved.
This work was supported by the National Natural Science Foundation of China (NSFC) and Basic Science Foundation of Southwest Jiaotong University.
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.
References
Agrawal, R., Scrikant, R.: Fast algorithm for mining association rules. In: Proceeding of VLDB 1994, Santiago, Chile, pp. 487–499 (1994)
Toivonen, H., Klemettinen, M., RonKainen, P., Hatonen, K., Mannila, H.: Pruning and grouping discovered association rules. In: Lavrač, N., Wrobel, S. (eds.) ECML 1995. LNCS, vol. 912, pp. 47–52. Springer, Heidelberg (1995)
Liu, B., Hu, M., Hsu, W.: Multi-level organization and summarization of the discovered rules. In: Proceedings of KDD 2000, Boston, USA, pp. 208–217 (2000)
Ng, R., Lakshmanan, L., Han, J.W., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of SIGMOD 1998, Seattle, Washington, pp. 13–24 (1998)
Han, J.W., Fu, Y.: Mining multiple-level association rules in large databases. IEEE Trans. on knowledge and data engineering 11, 798–804 (1999)
Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. In: Proceedings of KDD 1999, New York, pp. 337–341 (1999)
Li, T.R., Ma, J., Xu, Y.: An improving mining algorithm aiming at a kind of specific function of degree of interest. In: Proceedings of ICMLC 2002, Beijing, China, pp. 1214–1218 (2002)
Li, T.R., Niu, Y.Q., Ma, J., Xu, Y.: Generalized association rule base mining and its algorithm. In: Proceedings of PDCAT 2003, Chengdu, China, pp. 919–922 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Tr., Qing, M., Ma, J., Xu, Y. (2004). An Algorithm for Mining Lower Closed Itemsets. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-30501-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24013-6
Online ISBN: 978-3-540-30501-9
eBook Packages: Computer ScienceComputer Science (R0)