Abstract
Towards the user, it is necessary to find the frequent itemsets which include a set C0, especially when C0 is changed regularly. Our recent studies showed that the frequent itemset mining with often changed constraints should be based on closed itemsets lattice and generators instead of database directly. In this paper, we propose a unique representation of frequent itemsets restricted on constraint C0 using closed frequent itemsets and their generators. Then, we develop the efficient algorithm to quickly and non-repeatedly generate all frequent itemsets contain C0. Extensive experiments on a broad range of many synthetic and real datasets showed the effectiveness of our approach.
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., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th International Conference on Very Large Data Bases, pp. 478–499 (1994)
Anh, T., Hai, D., Tin, T., Bac, L.: Efficient Algorithms for Mining Frequent Itemsets with Constraint. In: Proc. of the Third International Conference on Knowledge and Systems Engineering, pp. 19–25 (2011)
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)
Anh, T., Tin, T., Bac, L., Hai, D.: Mining Association Rules Restricted on Constraint. In: Proc. IEEE-RIVF 2012, pp. 51–56 (2012)
Bayardo, R.J., Agrawal, R., Gunopulos, D.: Constraint-Based Rule Mining in Large, Dense Databases. Data Mining and Knowledge Discovery 4, 217–240 (2000)
Birkhoff, G.: Lattice theory. American Mathematical Society, New York (1948)
Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: Examiner: Optimized level-wise frequent pattern mining with monotone constraints. In: Proc. IEEE ICDM 2003, pp. 11–18 (2003B)
Bonchi, F., Giannotti, F., Mazzanti, A., Pedreschi, D.: ExAnte: Anticipated data reduction in constrained pattern mining. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol. 2838, pp. 59–70. Springer, Heidelberg (2003)
Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Proc. IEEE ICDM 2004 (2004) (in Press)
Boulicaut, J.F., Bykowski, A.: Frequent closures as a concise representation for binary Data Mining. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol. 1805, pp. 62–73. Springer, Heidelberg (2000)
Boulicaut, J.F., 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)
Bucila, C., Gehrke, J.E., Kifer, D., White, W.: Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Mining and Knowledge Discovery 7, 241–272 (2003)
Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A maximal frequent itemset algorithm for transactional databases. In: Proc. IEEE ICDE 2001, pp. 443–452 (2001)
Jeudy, B., Boulicaut, J.F.: Optimization of association rule mining queries. Intelligent Data Analysis 6, 341–357 (2002)
Lin, D.I., Kedem, Z.M.: Pincer search: An efficient algorithm for discovering the maximum frequent sets. IEEE Trans. on Knowledge and Data Engineering 14, 553–566 (2002)
Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1, 241–258 (1997)
Nguyen, R.T., Lakshmanan, V.S., Han, J., Pang, A.: Exploratory Mining and Pruning Optimizations of Constrained Association Rules. In: Proc. of the 1998 ACM-SIG-MOD Int’l Conf. on the Management of Data, pp. 13–24 (1998)
Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. J. Intelligent Information Systems 24, 29–60 (2005)
Pei, J., Han, J., Lakshmanan, L.V.S.: Mining frequent itemsets with convertible constraints. In: Proc. IEEE ICDE 2001, pp. 433–442 (2001)
Pei, J., Han, J.: Constrained Frequent Pattern Mining: A Pattern-Growth View. In: Proc. ACM SIGKDD Explorations (Special Issue on Constraints in Data Mining), vol. 4, pp. 31–39 (2002)
Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proc. KDD 1997, pp. 67–73 (1997)
Truong, T.C., Tran, A.N.: Structure of set of association rules based on concept lattice. In: Nguyen, N.T., Katarzyniak, R., Chen, S.-M. (eds.) Advances in Intelligent Information and Database Systems. SCI, vol. 283, pp. 217–227. Springer, Heidelberg (2010)
Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery, 223–248 (2004)
Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD 1997), pp. 283–296 (1997)
Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowledge and Data Engineering 17, 462–478 (2005)
Wille, R.: Concept lattices and conceptual knowledge systems. Computers and Math. with App. 23, 493–515 (1992)
Frequent Itemset Mining Dataset Repository (FIMDR), http://fimi.cs.helsinki.fi/data/ (accessed 2009)
http://www.cs.rpi.edu/~zaki/wwwnew/pmwiki.php/Software/Software#patutils (acessed 2010)
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
Duong, H., Truong, T., Le, B. (2013). An Efficient Algorithm for Mining Frequent Itemsets with Single Constraint. 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_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-00293-4_28
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00292-7
Online ISBN: 978-3-319-00293-4
eBook Packages: EngineeringEngineering (R0)