Skip to main content

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

  • 1291 Accesses

Abstract

At present, so many techniques are available which can be applicable to wide range of datasets. They provide an effective way to mine frequent pattern from the datasets. Most of them use different kind s of data structures for the processing which provide variations in requirement of time and space. Generally, traditional techniques are restricted to the narrow area or provide effective results only in the specific environment. So, it requires continuous optimization and updation. Dynamic data structure and mapping shows more effectiveness compared to the traditional techniques in terms of time and space requirement for processing.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

  1. Han, J., Kamber, M., Pei, J.: Data mining: concepts and techniques. Morgan Kaufmann, San Francisco (2006).

    Google Scholar 

  2. Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge, London (2009).

    Google Scholar 

  3. Pandey, H. M.: Design Analysis and Algorithms. Firewall Media Publication, New Delhi (2008).

    Google Scholar 

  4. Zhang, Z., Wu, W., Huang, Y.: Mining dynamic interdimension association rules for local-scale weather prediction. In: 28th Annual International Computer Software and Applications Conference (COMPSAC), pp. 146–149. IEEE (2004).

    Google Scholar 

  5. Bhalodiya, D., Patel, K. M., Patel, C.: An efficient way to find frequent pattern with dynamic programming approach. In: Nirma University International Conference on Engineering (NUiCONE), pp. 1–5. IEEE (2013).

    Google Scholar 

  6. Gupta, A., Arora, R., Sikarwar, R., Saxena, N.: Web usage mining using improved Frequent Pattern Tree algorithms. In: International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT), pp. 573–578. IEEE (2014).

    Google Scholar 

  7. Mutakabbir, K. M., Mahin, S. S., Hasan, M. A.: Mining frequent pattern within a genetic sequence using unique pattern indexing and mapping techniques. In: 3rd International Conference on Informatics, Electronics & Vision, pp. 1–5. IEEE (2014).

    Google Scholar 

  8. Aggarwal, S., Kaur, R.: Comparative Study of Various Improved Versions of Apriori Algorithm. In: International Journal of Engineering Trends and Technology, Vol. 4, (4) (2013) 687–690.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sagar Gajera .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media Singapore

About this paper

Cite this paper

Sagar Gajera, Manmay Badheka (2017). Improvisation in Frequent Pattern Mining Technique. In: Satapathy, S., Bhateja, V., Joshi, A. (eds) Proceedings of the International Conference on Data Engineering and Communication Technology. Advances in Intelligent Systems and Computing, vol 469. Springer, Singapore. https://doi.org/10.1007/978-981-10-1678-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-1678-3_29

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-1677-6

  • Online ISBN: 978-981-10-1678-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics