Indexing and Mining of the Local Patterns in Sequence Database

  • Xiaoming Jin
  • Likun Wang
  • Yuchang Lu
  • Chunyi Shi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2412)


Previous studies on frequent pattern discovery from temporal sequence mainly consider finding global patterns, where every record in a sequence contributes to support the patterns. In this paper, we present a novel problem class that is the discovery of local sequential patterns, which only a subsequence of the original sequence exhibits. The problem has a two-dimensional solution space consisting of patterns and temporal features, therefore it is impractical that use traditional methods on this problem directly in terms of either time complexity or result validity. Our approach is to maintain a suffix-tree-like index to support efficiently locating and counting of local patterns. Based on the index, a method is proposed for discovering such patterns. We have analyzed the behavior of the problem and evaluated the performance of our algorithm on both synthetic and real data. The results correspond with the definition of our problem and verify the superiority of our method.


Local Confidence Leaf Node Local Pattern Global Pattern Local Support 
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.
    Wang, K., Tan., J., Incremental discovery of sequential patterns. ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Montreal, Canada. 1996.Google Scholar
  2. 2.
    Mannila, H., Toivonen, H., Verkamo, A.I., Discovering frequent episodes in sequences. The First International Conference on Knowledge Discovery and Data Mining, Canada. 1995.Google Scholar
  3. 3.
    Kam, P.-s., Fu., A.W.-C., Discovering temporal patterns for interval-based events. DaWaK 2000, London, UK. 2000.Google Scholar
  4. 4.
    Chen, X., Petrounias, I., An integrated query and mining system for temporal association rules. DaWaK 2000, London, UK. 2000.Google Scholar
  5. 5.
    Tansel, A., Ayan, N., Discovery of association rules in temporal databases. KDD’98, Distributed Data Mining Workshop, New York, USA, 1998.Google Scholar
  6. 6.
    Han, J., Dong, G., Yin, Y., Efficient mining of partial periodic patterns in time series database. The Fifteenth International Conference on Data Engineering, Australia. 1999.Google Scholar
  7. 7.
    Srikant, R., Agrawal, R., Mining sequential patterns: generalizations and performance improvements. EDBT’96, Avignon, France, 1996.Google Scholar
  8. 8.
    Weiner, P., Linear pattern matching algorithms. Conference Record, The IEEE 14th Annual Symposium on Switching and Automata Theory, 1973.Google Scholar
  9. 9.
    Das, G., Lin, K., Mannila, H., Renganathan, G., Smyth, P., Rule discovery from time series. The 4th International Conference on Knowledge Discovery and Data Mining. 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Xiaoming Jin
    • 1
  • Likun Wang
    • 1
  • Yuchang Lu
    • 1
  • Chunyi Shi
    • 1
  1. 1.The State Key Laboratory of Intelligent Technology and System Computer Science and Technology Dept.Tsinghua UniversityBeijingChina

Personalised recommendations