Skip to main content

Hybrid Technique for Frequent Pattern Extraction from Sequential Database

  • Conference paper
  • 3680 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 327))

Abstract

Data mining has became a familiar tool for mining stored value from the large scale databases that are known as Sequential Database. These databases has large number of itemsets that can arrive frequently and sequentially, it can also predict the users behaviors. The evaluation of user behavior is done by using Sequential pattern mining where the frequent patterns extracted with several limitations. Even the previous sequential pattern techniques used some limitations to extract those frequent patterns but these techniques does not generated the more reliable patterns .Thus, it is very complex to the decision makers for evaluation of user behavior. In this paper, to solve this problem a technique called hybrid pattern is used which has both time based limitation and space limitation and it is used to extract more feasible pattern from sequential database. Initially, the space limitation is applied to break the sequential database using the maximum and minimum threshold values. To this end, the time based limitation is applied to extract more feasible patterns where a bury-time arrival rate is computed to extract the reliable patterns.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: 20th VLDB Conference, Chile, pp. 487–499 (1994)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Mining sequential patterns. In: 11th International Conference on Data Engineering, Taiwan, pp. 3–14 (1995)

    Google Scholar 

  3. Ayres, J., Flannick, J., Gehrke, J., And Yiu, T.: Sequential pattern mining using a bitmap representation. In: 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 429–435. ACM, New York (2002)

    Google Scholar 

  4. Chen, Y.L., Chiang, M.C., Ko, M.T.: Discovering time-interval sequential patterns in sequence databases. Expert Systems with Applications 25, 343–354 (2003)

    Article  Google Scholar 

  5. Chen, Q., Dayal, U., Han, J., Hsu, M.C., Mortazavi-Asl, B., Pei, J.: FreeSpan: frequent pattern-projected sequential pattern mining. In: International Conference on Knowledge Discovery and Data Mining, USA, pp. 355–359 (2000)

    Google Scholar 

  6. Chen, Q., Dayal, U., Han, J., Hsu, M.C., Mortazavi-Asl, B., Pei, J., Pinto, H., Wang, J.: Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Transactions on Knowledge and Data Engineering 16, 1424–1440 (2004)

    Article  Google Scholar 

  7. Jou, C., Shyur, H.-J., Chang, K.: A data mining approach to discovering reliable sequential patterns. The Journal of Systems and Software 86, 2196–2203 (2013)

    Article  Google Scholar 

  8. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD International Conference of Data, Dallas, TX, pp. 1–12 (2000)

    Google Scholar 

  9. Pei, J., Han, J., Pinto, H.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In: 11th IEEE International conference on Data Engineering, Germany, pp. 215–224 (2001)

    Google Scholar 

  10. Kim, C., Lim, J.H., Ng, R.T., Shim, K.: SQUIRE: sequential pattern mining with quantities. Journal of Systems and Software 80, 1726–1745 (2007)

    Article  Google Scholar 

  11. Orlando, S., Perego, R., Silvestri, C.: A new algorithm for gap constrained sequence mining. In: ACM Symposium on Applied Computing, New York, pp. 540–547 (2004)

    Google Scholar 

  12. Toroslu, I.H.: Repetition support and mining cyclic patterns. Expert Systems with Applications 25, 303–311 (2003)

    Article  Google Scholar 

  13. Zaki, M.: SPADE: An efficient algorithm for mining frequent sequences. Machine Learning 42(2), 31–60 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kuthadi, V.M.: A new data stream mining algorithm for interestingness-rich association rules. Journal of Computer Information Systems 53(3), 14–27 (2013)

    Google Scholar 

  15. Selvaraj, R., Kuthadi, V.M.: A modified hiding high utility item first algorithm with item selector for hiding sensitive item sets. International Journal of Innovative Computing, Information and Control 9(12), 4851–4862 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Selvaraj, R., Kuthadi, V.M., Marwala, T. (2015). Hybrid Technique for Frequent Pattern Extraction from Sequential Database. In: Satapathy, S., Biswal, B., Udgata, S., Mandal, J. (eds) Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014. Advances in Intelligent Systems and Computing, vol 327. Springer, Cham. https://doi.org/10.1007/978-3-319-11933-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11933-5_29

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11932-8

  • Online ISBN: 978-3-319-11933-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics