Abstract
Frequent-Regular pattern mining has been introduced to extract interesting patterns based on their occurrence behavior. This approach considers the terms of frequency and regularity to determine significant of patterns under user-given support and regularity thresholds. However, it is well-known that setting of thresholds to discover the most interesting results is a very difficult task and it is more reasonable to avoid specifying the suitable thresholds by letting users assign only simple parameters. In this paper, we introduce an alternative approach, called Top-k frequent/regular pattern mining based on weights of interests, which allows users to assign two simple parameters: (i) a weight of interest on frequency/regularity and (ii) a number of desired patterns. To mine patterns, we propose an efficient single-pass algorithm, TFRP-Mine, to quickly mine patterns with frequent/regular appearance. Experimental results show that our approach can effectively and efficiently discover the valuable patterns that meet the users’ interest.
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: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, pp. 207–216 (1993)
Goethals, B.: Frequent set mining. In: The Data Mining and Knowledge Discovery Handbook, pp. 377–397. Springer (2005)
Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15(1), 55–86 (2007)
Chang, J.: Mining weighted sequential patterns in a sequence database with a time-interval weight. Knowledge Based Systems 24(1), 1–9 (2011)
Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Discovering periodic-frequent patterns in transactional databases. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol. 5476, pp. 242–253. Springer, Heidelberg (2009)
Heierman, E.O., Youngblood, G.M., Cook, D.J.: Mining temporal sequences to discover interesting patterns. In: KDD Workshop on Mining Temporal and Sequential Data (2004)
Fu, A.W.-C., Kwong, R.W.-W., Tang, J.: Mining N-most Interesting Itemsets. In: Ohsuga, S., Raś, Z.W. (eds.) ISMIS 2000. LNCS (LNAI), vol. 1932, pp. 59–67. Springer, Heidelberg (2000)
Wang, J., Han, J., Lu, Y., Tzvetkov, P.: Tfp: an efficient algorithm for mining top-k frequent closed itemsets. Proceeding of the IEEE Transactions on Knowledge and Data Engineering 17, 652–664 (2005)
Yang, B., Huang, H., Wu, Z.: Topsis: Finding top-k significant n-itemsets in sliding windows adaptively. Knowl.-Based Syst. 21(6), 443–449 (2008)
Li, H.F.: Mining top-k maximal reference sequences from streaming web click-sequences with a damped sliding window. Expert Systems with Applications 36(8), 11304–11311 (2009)
Ke, Y., Cheng, J., Yu, J.X.: Top-k correlative graph mining. SDM, 1038–1049 (2009)
Webb, G.I.: Filtered-top-k association discovery. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 1(3), 183–192 (2011)
Fournier-Viger, P., Tseng, V.S.: Tns: mining top-k non-redundant sequential rules. In: Shin, S.Y., Maldonado, J.C. (eds.) SAC, pp. 164–166. ACM (2013)
Amphawan, K., Lenca, P., Surarerks, A.: Mining top-k periodic-frequent patterns without support threshold. In: IAIT 2009. CCIS, vol. 55, pp. 18–29. Springer, Heidelberg (2009)
Amphawan, K., Lenca, P., Surarerks, A.: Efficient mining top-k regular-frequent itemset using compressed tidsets. In: Cao, L., Huang, J.Z., Bailey, J., Koh, Y.S., Luo, J. (eds.) PAKDD Workshops 2011. LNCS, vol. 7104, pp. 124–135. Springer, Heidelberg (2012)
Amphawan, K., Lenca, P., Surarerks, A.: Mining top-k regular-frequent itemsets using database partitioning and support estimation. Expert Systems with Applications 39(2), 1924–1936 (2012)
Tanbeer, S.K., Ahmed, C.F., Jeong, B.S.: Mining regular patterns in incremental transactional databases. In: Int. Asia-Pacific Web Conference, pp. 375–377. IEEE Computer Society (2010)
Tanbeer, S.K., Ahmed, C.F., Jeong, B.S.: Mining regular patterns in data streams. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5981, pp. 399–413. Springer, Heidelberg (2010)
Surana, A., Kiran, R.U., Reddy, P.K.: An efficient approach to mine periodic-frequent patterns in transactional databases. In: Cao, L., Huang, J.Z., Bailey, J., Koh, Y.S., Luo, J. (eds.) PAKDD Workshops 2011. LNCS, vol. 7104, pp. 254–266. Springer, Heidelberg (2012)
Kiran, R.U., Reddy, P.K.: Mining periodic-frequent patterns with maximum items’ support constraints. In: Proceedings of the Third Annual ACM Bangalore Conference, COMPUTE 2010, pp. 1–8 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amphawan, K., Lenca, P. (2013). Mining Top-k Frequent/Regular Patterns Based on User-Given Trade-Off between Frequency and Regularity. In: Papasratorn, B., Charoenkitkarn, N., Vanijja, V., Chongsuphajaisiddhi, V. (eds) Advances in Information Technology. IAIT 2013. Communications in Computer and Information Science, vol 409. Springer, Cham. https://doi.org/10.1007/978-3-319-03783-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-03783-7_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03782-0
Online ISBN: 978-3-319-03783-7
eBook Packages: Computer ScienceComputer Science (R0)