Abstract
With the revolution of science and technology, we can accumulate huge amount of data which requires to be manipulated efficiently since the amount of data is expanding hence scarcity of knowledge is also increasing. Therefore analysis for more useful and interesting knowledge is on demand. Representative patterns can be a solution to represent data in a more concise way. Different efficient methods for mining frequent and erasable patterns exist in representative pattern mining field that are regarded as significant. We have proposed a new type of pattern called decaying pattern. These patterns are characterized as those patterns that were frequent for a time being and then decayed with time. These patterns of declining nature can give us the opportunity to analyze reasons behind items’ decrease such as extinct animals, finding unsolved accidental news, analysis of buying behavior of customers etc. that require further inspection.
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
References
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 2011. LNCS (LNAI), vol. 7104, pp. 124–135. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28320-8_11
Amphawan, K., Lenca, P., Surarerks, A.: Mining top-k regular-frequent itemsets using database partitioning and support estimation. Expert Syst. Appl. 39(2), 1924–1936 (2012)
Bayardo, R.J. : Efficiently mining long patterns from databases. In: Proceeding of the ACM-SIGMOD International Conference on Management of Data, pp. 85–93 (1998)
Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans. Know. Data Eng. 17(10), 1347–1362 (2005)
Han, J., Pei, J., Yin, J.: Frequent patterns without candidate generation a frequent-pattern tree approach. Data Min. Knowl. Disc. 8(1), 53–87 (2004)
Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed pat- terns without minimum support. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), Maebashi City, Japan, 9–12 December, pp. 211–218 (2002)
Lee, G., Yun, U., Ryang, H.: Mining weighted erasable patterns by using underestimated constraint-based pruning technique. J. Intell. Fuzzy Syst. 28(3), 1145–1157 (2014)
Leung, C.K.S., Khan, Q.I.: DSTree: a tree structure for the mining of frequent sets from data streams. In: Proceedings of the Sixth International Conference on Data Mining (ICDM 2006), pp. 928–932. IEEE Computer Society, Washington, DC (2006)
Nguyen, G., Le, T., Vo, B., Le, B.: Discovering erasable closed patterns. In: Nguyen, N.T., Trawiński, B., Kosala, R. (eds.) ACIIDS 2015. LNCS (LNAI), vol. 9011, pp. 368–376. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-15702-3_36
Nguyen, G., Le, T., Vo, B., Le, B.: EIFDD: an efficient approach for erasable itemset mining of very dense datasets. Appl. Intell. 43(1), 85–94 (2015)
Vo, B., Le, T., Nguyen, G., Hong, T.: Efficient algorithms for mining erasable closed patterns from product datasets. In: IEEE Access, p. 1 (2017)
Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: an efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans. Knowl. Data Eng. 17(5), 652–664 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Sultana, A., Ahmed, H., Ahmed, C.F. (2018). A New Approach for Mining Representative Patterns. In: Perner, P. (eds) Advances in Data Mining. Applications and Theoretical Aspects. ICDM 2018. Lecture Notes in Computer Science(), vol 10933. Springer, Cham. https://doi.org/10.1007/978-3-319-95786-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-95786-9_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-95785-2
Online ISBN: 978-3-319-95786-9
eBook Packages: Computer ScienceComputer Science (R0)