CSSF-trie structure to mine constraint sequential patterns from progressive database

  • Authors:
  • V. Chandra Shekhar Rao;P. Sammulal

  • Affiliations:
  • Department of Computer Science and Engineering, Kakatiya Institute of Technology and Science, Warangal-506015, Andhra Pradesh, India;Department of Computer Science and Engineering, JNTUH College of Engineering, Nachupally, Karimnager, Andhra Pradesh, India

  • Venue:
  • International Journal of Knowledge Engineering and Data Mining
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper delineates the purpose of an algorithm for mining constraint sequential patterns from a progressive database. We construct the updated CSSF-trie from the static database with the intention of efficiently capturing the dynamic nature of data addition and deletion into the mining problem. Whenever the database gets updated from the distributed sources, the database may be static, inserted, or deleted. CSSF trie is also updated by including the updated sequence. The updated CSSF-trie is used to mine the progressive CSSF-patterns using the proposed algorithm. Finally, the experimentation is carried out using the synthetic and real life distributed databases that are given to the progressive CSSF-miner using thread environment. The experimental results provide better results in terms of the generated number of sequential patterns, execution time and the memory usage over the existing IncSpan algorithm.