Mining Actionable Partial Orders in Collections of Sequences
Mining frequent partial orders from a collection of sequences was introduced as an alternative to mining frequent sequential patterns in order to provide a more compact/understandable representation. The motivation was that a single partial order can represent the same ordering information between items in the collection as a set of sequential patterns (set of totally ordered sets of items). However, in practice, a discovered set of frequent partial orders is still too large for an effective usage. We address this problem by proposing a method for ranking partial orders with respect to significance that extends our previous work on ranking sequential patterns. In experiments, conducted on a collection of visits to a website of a multinational technology and consulting firm we show the applicability of our framework to discover partial orders of frequently visited webpages that can be actionable in optimizing effectiveness of web-based marketing.
KeywordsPartial Order Sequential Pattern Linear Extension Parallel Pattern Serial Pattern
Unable to display preview. Download preview PDF.
- 1.Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery 15(1) (2007)Google Scholar
- 2.Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE, pp. 3–14 (1995)Google Scholar
- 3.Yan, X., Han, J., Afshar, R.: Clospan: Mining closed sequential patterns in large datasets. In: SDM, pp. 166–177 (2003)Google Scholar
- 4.Guan, E., Chang, X., Wang, Z., Zhou, C.: Mining maximal sequential patterns. In: 2005 International Conference on Neural Networks and Brain, pp. 525–528 (2005)Google Scholar
- 5.Huang, X., An, A., Cercone, N.: Comparison of interestingness functions for learning web usage patterns. In: Proceedings of the Eleventh International Conference on Information and Knowledge Management, CIKM 2002, pp. 617–620. ACM, New York (2002)Google Scholar
- 8.Casas-Garriga, G.: Summarizing sequential data with closed partial orders. In: Proceedings of the Fifth SIAM International Conference on Data Mining, April 2005, pp. 380–390 (2005)Google Scholar
- 10.Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q.: Mining sequential patterns by pattern-growth: The prefixspan approach. TKDE 16 (November 2004)Google Scholar
- 11.Gwadera, R., Atallah, M., Szpankowski, W.: Reliable detection of episodes in event sequences. In: Third IEEE International Conference on Data Mining, pp. 67–74 (November 2003)Google Scholar
- 12.Gwadera, R., Atallah, M., Szpankowski, W.: Markov models for discovering significant episodes. In: SIAM International Conference on Data Mining, pp. 404–414 (April 2005)Google Scholar
- 13.Atallah, M., Gwadera, R., Szpankowski, W.: Detection of significant sets of episodes in event sequences. In: Fourth IEEE International Conference on Data Mining, pp. 67–74 (October 2004)Google Scholar
- 16.Knuth, D.E., Szwarcfiter, J.L.: A structured program to generate all topological sorting arrangements. Inf. Process. LettGoogle Scholar