Abstract
Mining sequential patterns is to discover sequential purchasing behaviors for most of the customers from a large amount of customer transactions. An example of such a pattern is that most of the customers purchased item B after purchasing item A, and then they purchased item C after using item B. The manager can use this information to promote item B and item C when a customer purchased item A and item B, respectively. However, the manager cannot know what time the customers will need these products if we only discover the sequential patterns without any extra information. In this paper, we develop a new algorithm to discover not only the sequential patterns but also the time interval between any two items in the pattern. We call this information the time-gap sequential patterns. An example of time-gap sequential pattern is that most of the customers purchased item A, and then they bought item B after m to n days, and then after p to q days, they bought item C. When a customer bought item A, the information about item B can be sent to this customer after m to n days, that is, we can provide the product information in which the customer is interested on the appropriate date.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the ACM SIGMOD international conference on management of data, Seattle, Washington, June 1998, pp 94–105
Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of the international conference on data engineering, pp 3–14
Agrawal R, Srikant R (1996) Mining sequential patterns: generalizations and performance improvements. In: Proceedings of the 5th international conference on extending database technology, pp 3–17
Ahmed CF, Tanbeer SK, Jeong B-S, Lee Y-K (2011) HUC-Prune: an efficient candidate pruning technique to mine high utility patterns. Int J Appl Intell 34(2):181–198
Chen YL, Chiang MC, Ko MT (2003) Discovering time-interval sequential patterns in sequence databases. Expert Syst Appl 25(3):343–354
Chen YL, Huang CK (2005) Discovering fuzzy time-interval sequential patterns in sequence databases. IEEE Trans Syst Man Cybern, Part B, Cybern 35(5)
Gorawski M, Jureczek P, Gorawski M (2010) Exploration of continuous sequential patterns using the CPGrowth algorithm. In: Multimedia and network information system technology. AISC, vol 80, pp 165–172
Hong TP, Lin CW, Wu YL (2008) Incrementally fast updated frequent pattern trees. Expert Syst Appl 34(4):2424–2435
Han J, Mao R, Pei J, Yin Y (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8:53–87
Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Daya U, Hsu MC (2001) PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the international conference on data engineering, pp 215–224
Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, Dayal U, Hsu MC (2004) Mining sequential patterns by pattern-growth: the PrefixSpan approach. IEEE Trans Knowl Data Eng 16(11):1424–1440
Tsai CY, Jen H, Chen I-C (2010) Time-interval process model discovery and validation—a genetic process mining approach. Int J Appl Intel 33(1):54–66
Yen SJ, Lee YS (2012) Mining time-gap sequential patterns. In: Proceedings of the international conference on industrial, engineering & other applications of applied intelligent systems (IEA/AIE), June 2012. Lecture notes in artificial intelligence, vol 7345, pp 637–646
Yen SJ, Wang CK, Ouyang LY (2012) A search space algorithm for mining frequent patterns. J Inf Sci Eng 28(1):177–191
Zaki MJ (1998) Efficient enumeration of frequent sequences. In: ACM proceedings of the seventh international conference on information and knowledge management, November 1998, pp 68–75
Zaki MJ (2001) SPADE: an efficient algorithm for mining frequent sequences. Mach Learn 40:31–60
Zhang S, Chen F, Wu X, Zhang C, Wang R (2012) Mining bridging rules between conceptual clusters. Int J Appl Intell 36(1):108–118
IBM synthetic data generator. http://www.almaden.ibm.com/software/quest/Resorces/index.shtml
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yen, SJ., Lee, YS. Mining non-redundant time-gap sequential patterns. Appl Intell 39, 727–738 (2013). https://doi.org/10.1007/s10489-013-0426-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-013-0426-8