Abstract
Closed itemsets and their generators play an important role in frequent itemset and association rule mining since they lead to a lossless representation of all frequent itemsets. The previous approaches discover either frequent closed itemsets or generators separately. Due to their properties and relationship, the paper proposes GENCLOSE thatmines them concurrently. In a level-wise search, it enumerates the generators using a necessary and sufficient condition for producing (i+1)-item generators from i-item ones. The condition is designed based on object-sets which can be implemented efficiently using diffsets, is very convenience and is reliably proved. Along that process, pre-closed itemsets are gradually extended using three proposed expanded operators. Also, we prove that they bring us to expected closed itemsets. Experiments on many benchmark datasets confirm the efficiency of GENCLOSE.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Imielinski, T., Swami, N.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOID, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 478–499 (1994)
Tran, A., Truong, T., Le, B.: Structures of Association Rule Set. In: Pan, J.-S., Chen, S.-M., Nguyen, N.T. (eds.) ACIIDS 2012, Part II. LNCS (LNAI), vol. 7197, pp. 361–370. Springer, Heidelberg (2012)
Tran, A., Duong, H., Truong, T., Le, B.: Mining Frequent Itemsets with Dualistic Constraints. In: Anthony, P., Ishizuka, M., Lukose, D. (eds.) PRICAI 2012. LNCS (LNAI), vol. 7458, pp. 807–813. Springer, Heidelberg (2012)
Balcazar, J.L.: Redundancy, deduction schemes, and minimum-size base for association rules. Logical Methods in Computer Sciences 6(2:3), 1–33 (2010)
Bayardo, R.J.: Efficiently Mining Long Patterns from Databases. In: Proceedings of the SIGMOD Conference, pp. 85–93 (1998)
Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Proceedings of ICDE 2001, pp. 443–452 (2001)
Boulicaut, J., Bykowski, A., Rigotti, C.: Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries. Data Mining and Knowledge Discovery 7, 5–22 (2003)
Dong, G., Jiang, C., Pei, J., Li, J., Wong, L.: Mining Succinct Systems of Minimal Generators of Formal Concepts. In: Zhou, L., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 175–187. Springer, Heidelberg (2005)
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 Infor. Sys. 24(1), 29–60 (2005)
Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: Efficient Vertical Mining of Frequent Closures and Generators. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J.-F. (eds.) IDA 2009. LNCS, vol. 5772, pp. 393–404. Springer, Heidelberg (2009)
Wang, J., Han, J., Pei, J.: Closet+: Searching for the best strategies for mining frequent closed itemsets. In: Proceedings of ACM SIGKDD 2003 (2003)
Zaki, M.J., Gouda, K.: Fast Vertical Mining Using Diffsets. In: Proc. 9th ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (2003)
Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery 9, 223–248 (2004)
Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowledge and Data Engineering 17(4), 462–478 (2005)
Wille, R.: Concept lattices and conceptual knowledge systems. Computers and Math. with App. 23, 493–515 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Tran, A., Truong, T., Le, B. (2013). An Approach for Mining Concurrently Closed Itemsets and Generators. In: Nguyen, N., van Do, T., le Thi, H. (eds) Advanced Computational Methods for Knowledge Engineering. Studies in Computational Intelligence, vol 479. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00293-4_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-00293-4_27
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00292-7
Online ISBN: 978-3-319-00293-4
eBook Packages: EngineeringEngineering (R0)