Abstract
Sequential patterns mining is an important research topic in data mining and knowledge discovery. The objective of mining sequential patterns is to find out frequent sequences based on the user-specified minimum support threshold, which implicitly assumes that all items in the data have similar probability distribution. This is often not the case in real-life applications. If the frequencies of items vary a great deal, we will suffer the dilemma called the rare item problem. In order to resolve the dilemma, an algorithm to discover sequential patterns with multiple minimum supports model is proposed, which can specify a different minimum item support for different item. The algorithm can not only discover sequential patterns formed between frequent sequences, but also discover sequential patterns formed either between frequent sequence and rare sequence or among rare sequences only. Moreover, an algorithm for mining direct and indirect sequential patterns with multiple minimum supports is designed simultaneously.
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.: Mining sequential patterns. In: The Proc. 1995 Int. Conf. on Data Engineering, Taibei, Taiwan (March 1995)
Tan, P.N., Kumar, V.: Indirect Association: Mining Higher Order Dependences in Data. In: Proc. Of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases, Lyon, France, pp. 632–737 (2000)
Liu, B., Hsu, W., Ma, Y.: Mining Association Rules with Multiple Minimum Supports. SIGKDD Explorations, 337–341 (1999)
Piatetsky-Shapiro, G.: Discovery, Analysis and Presentation os Strong Rules. In: Knowledge Discovery in Databases, pp. 229–248. AAAI/MIT, Menlo Park, CA (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ouyang, W., Huang, Q. (2011). Discovery of Direct and Indirect Sequential Patterns with Multiple Minimum Supports in Large Transaction Databases. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23881-9_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-23881-9_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23880-2
Online ISBN: 978-3-642-23881-9
eBook Packages: Computer ScienceComputer Science (R0)