Abstract
It is well known that when mining frequent itemsets from a transaction database, the output is usually too large to be effectively exploited by users. To cope with this difficulty, several forms of condensed representations of the set of frequent itemsets have been proposed, among which the notion of closure is one of the most popular.
In this paper, we propose a new notion of closure that takes into account, not only the support of itemsets, but also their homogeneity degree with respect to a given taxonomy. To this end, we introduce and study the notion of frequent and homogeneous closed itemset and we show in particular that knowing all frequent and homogeneous closed itemsets along with their supports and homogeneity degrees, allows to know all frequent and homogenous itemsets. Moreover, we propose a level wise algorithm for mining frequent and homogeneous closed itemsets.
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 subscriptionsReferences
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 309–328. AAAI-MIT Press, (1996)
Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: IEEE International Conference on Data Mining (ICDM), pp. 35–42 (2004)
Bonchi, F., Lucchese, C.: Pushing tougher constraints in frequent pattern mining. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 114–124. Springer, Heidelberg (2005)
Calders, T., Goethals, B.: Mining all non-derivable frequent itemsets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 74–85. Springer, Heidelberg (2002)
Casali, A., Cicchetti, R., Lakhal, L.: Essential patterns: a perfect cover of frequent patterns. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, pp. 428–437. Springer, Heidelberg (2005)
Hilali, I., Jen, T.-Y., Laurent, D., Marinica, C., Ben Yahia, S.: Mining interesting disjunctive association rules from unfrequent items. In: Kawtrakul, A., Laurent, D., Spyratos, N., Tanaka, Y. (eds.) ISIP 2013. CCIS, vol. 421, pp. 84–100. Springer, Heidelberg (2014)
Marinica, C., Guillet, F.: Knowledge-based interactive postmining of association rules using ontologies. IEEE TKDE 22(6), 784–797 (2010)
Natarajan, R., Shekar, B.: A relatedness-based data-driven approach to determination of interestingness of association rules. In: ACM Symposium on Applied Computing (SAC), pp. 551–552. ACM (2005)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398–416. Springer, Heidelberg (1998)
Pei, J., Han, J., Mao, R.: Closet: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21–30 (2000)
Shekar, B., Natarajan, R.: A framework for evaluating knowledge-based interestingness of association rules. Fuzzy Optim. Decis. Making 3, 157–185 (2004)
Zaki, M.J., Hsiao, C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE TKDE 17(4), 462–478 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Hilali, I., Jen, TY., Laurent, D., Marinica, C., Yahia, S.B. (2016). Mining Frequent and Homogeneous Closed Itemsets. In: Kotzinos, D., Choong, Y., Spyratos, N., Tanaka, Y. (eds) Information Search, Integration and Personalization. ISIP 2014. Communications in Computer and Information Science, vol 497. Springer, Cham. https://doi.org/10.1007/978-3-319-38901-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-38901-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-38900-4
Online ISBN: 978-3-319-38901-1
eBook Packages: Computer ScienceComputer Science (R0)