Abstract
Weighted Frequent Itemset Mining (WFIM) has been proposed as an alternative to frequent itemset mining that considers not only the frequency of items but also their relative importance. However, an important limitation of WFIM is that it does not consider how recent the patterns are. To address this issue, we extend WFIM to consider the recency of patterns, and thus present the Recent Weighted Frequent Itemset Mining (RWFIM). A projection-based algorithm named RWFIM-P is designed to mine Recent Weighted Frequent Itemsets (RWFIs) based on a novel upper-bound downward closure property. Moreover, an improved algorithm named RWFIM-PE is also proposed, which introduces a new pruning strategy named Estimated Weight of 2-itemset Pruning (EW2P) to prune unpromising candidate of RWFIs early. An experimental evaluation against a state-of-the-art WFIM algorithm on the real-world and synthetic datasets show that the proposed algorithms are highly efficient.
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
Frequent itemset mining dataset repository, http://fimi.ua.ac.be/data/
Agrawal, R., Imielinski, T., Swami, A.: Database mining: A performance perspective. IEEE Trans. on Knowledge and Data Engineering 5, 914–925 (1993)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: The Intern. Conf. on Very Large Data Bases, pp. 487–499 (1994)
Agrawal, R., Srikant, R.: Quest synthetic data generator, http://www.Almaden.ibm.com/cs/quest/syndata.html
Agrawal, R., Srikant, R.: Mining sequential patterns. In: The Intern. Conf. on Data Engineering, pp. 3–14 (1995)
Cai, C.H., Fu, A.W.C., Kwong, W.W.: Mining association rules with weighted items. In: Intern. Database Engineering and Applications Symposium, pp. 68–77 (1998)
Chen, M.S., Han, J., Yu, P.S.: Data mining: An overview from a database perspective. IEEE Trans. on Knowledge and Data Engineering 8, 866–883 (1996)
Geng, L., Hamilton, H.J.: Interestingness measures for data mining: A survey. ACM Computing Surveys 38 (2006)
Lan, G.C., Hong, T.P., Lee, H.Y., Lin, C.W.: Mining weighted frequent itemsets. In: The 30th Workshop on Combinatorial Mathematics and Computation Theory, pp. 85–89 (2013)
Lan, G.C., Hong, T.P., Lee, H.Y.: An efficient approach for finding weighted sequential patterns from sequence databases. Applied Intelligence 41, 439–452 (2014)
Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)
Sun, K., Bai, F.: Mining weighted association rules without preassigned weights. IEEE Trans. on Knowledge and Data Engineering 20, 489–495 (2008)
Tao, F., Murtagh, F., Farid, M.: Weighted association rule mining using weighted support and significance framework. In: ACM SIGKDD Intern. Conf. on Knowledge Discovery and Data Mining, pp. 661–666 (2003)
Vo, B., Coenen, F., Le, B.: A new method for mining frequent weighted itemsets based on wit-trees. Expert Systems with Applications 40, 1256–1264 (2013)
Wang, W., Yang, J., Yu, P.S.: Efficient mining of weighted association rules (WAR). In: ACM SIGKDD Intern. Conf. on Knowledge Discovery and Data Mining, pp. 270–274 (2000)
Yun, U., Leggett, J.: WFIM: Weighted frequent itemset mining with a weight range and a minimum weight. In: SIAM Intern. Conf. on Data Mining, pp. 636–640 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Lin, J.CW., Gan, W., Fournier-Viger, P., Hong, TP. (2015). Mining Weighted Frequent Itemsets with the Recency Constraint. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds) Web Technologies and Applications. APWeb 2015. Lecture Notes in Computer Science(), vol 9313. Springer, Cham. https://doi.org/10.1007/978-3-319-25255-1_52
Download citation
DOI: https://doi.org/10.1007/978-3-319-25255-1_52
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25254-4
Online ISBN: 978-3-319-25255-1
eBook Packages: Computer ScienceComputer Science (R0)