Mining Actionable Partial Orders in Collections of Sequences

  • Robert Gwadera
  • Gianluca Antonini
  • Abderrahim Labbi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6911)


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.


Partial Order Sequential Pattern Linear Extension Parallel Pattern Serial Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE, pp. 3–14 (1995)Google Scholar
  3. 3.
    Yan, X., Han, J., Afshar, R.: Clospan: Mining closed sequential patterns in large datasets. In: SDM, pp. 166–177 (2003)Google Scholar
  4. 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. 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
  6. 6.
    Gwadera, R., Crestani, F.: Ranking sequential patterns with respect to significance. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS(LNAI), vol. 6118, pp. 286–299. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  7. 7.
    Mannila, H., Meek, C.: Global partial orders from sequential data. In: KDD 2000: Proceedings of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 161–168. ACM, New York (2000)CrossRefGoogle Scholar
  8. 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
  9. 9.
    Pei, J., Wang, H., Liu, J., Wang, K., Wang, J., Yu, P.S.: Discovering frequent closed partial orders from strings. IEEE Transactions on Knowledge and Data Engineering 18, 1467–1481 (2006)CrossRefGoogle Scholar
  10. 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. 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. 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. 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
  14. 14.
    Varol, Y.L., Rotem, D.: An algorithm to generate all topological sorting arrangements. The Computer Journal 24(1), 83–84 (1981)CrossRefzbMATHGoogle Scholar
  15. 15.
    Pruesse, G., Ruskey, F.: Generating linear extensions fast. SIAM J. Comput. 23, 373–386 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Knuth, D.E., Szwarcfiter, J.L.: A structured program to generate all topological sorting arrangements. Inf. Process. LettGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Robert Gwadera
    • 1
  • Gianluca Antonini
    • 1
  • Abderrahim Labbi
    • 1
  1. 1.IBM Zurich Research LaboratoryRüschlikonSwitzerland

Personalised recommendations