Abstract
This paper proposes an effective approach for the maintenance of a frequent-itemset lattice in incremental mining based on the pre-large concept. First, the building process of a frequent-itemset lattice is improved using a proposed theorem regarding the paternity relation between two nodes in the lattice. Then, based on the pre-large concept, an approach for maintaining a frequent-itemset lattice with dynamically inserted data is proposed. The experimental results show that the proposed approach outperforms the batch approach for building the lattice in terms of execution time.
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., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: SIGMOD 1993, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487–499 (1994)
Cheung, D.W., Han, J., Ng, V.T., Wong, C.Y.: Maintenance of discovered association rules in large databases: An incremental updating approach. In: The 12th IEEE International Conference on Data Engineering, USA, pp. 106–114 (1996)
Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using FP-trees. IEEE Transactions on Knowledge and Data Engineering 17, 1347–1362 (2005)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMODKDD 2000, pp. 1–12 (2000)
Hong, T.P., Wang, C.Y., Tao, Y.H.: A new incremental data mining algorithm using pre-large itemsets. Intelligent Data Analysis 5(2), 111–129 (2001)
Lin, C.W., Hong, T.P., Lu, W.H.: The Pre-FUFP algorithm for incremental mining. Expert Systems with Applications 36(5), 9498–9505 (2009)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems 24(1), 25–46 (1999)
Song, W., Yang, B., Xu, Z.: Index-BitTableFI: An improved algorithm for mining frequent itemsets. Knowledge-Based Systems 21, 507–513 (2008)
Vo, B., Le, B.: Mining traditional association rules using frequent itemsets lattice. In: 39th International Conference on CIE, Troyes, France, July 6-8, pp. 1401–1406 (2009)
Vo, B., Le, B.: Interestingness measures for association rules: Combination between lattice and hash tables. Expert Systems with Applications 38(9), 11630–11640 (2011)
Vo, B., Hong, T.P., Le, B.: A lattice-based approach for mining most generalization association rules. Knowledge-Based Systems 45, 20–30 (2013)
Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: KDD 2003, pp. 326–335 (2003)
Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering 17(4), 462–478 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Vo, B., Le, T., Hong, TP., Le, B. (2014). Maintenance of a Frequent-Itemset Lattice Based on Pre-large Concept. In: Huynh, V., Denoeux, T., Tran, D., Le, A., Pham, S. (eds) Knowledge and Systems Engineering. Advances in Intelligent Systems and Computing, vol 245. Springer, Cham. https://doi.org/10.1007/978-3-319-02821-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-02821-7_27
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02820-0
Online ISBN: 978-3-319-02821-7
eBook Packages: EngineeringEngineering (R0)