Skip to main content

Exception Detection of Data Stream Based on Improved Maximal Frequent Itemsets Mining

  • Conference paper
  • First Online:
Trusted Computing and Information Security (CTCIS 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 704))

Included in the following conference series:

Abstract

The security of data stream attracts more attention in daily life, the huge number of data stream makes it impossible to detect its exceptions, and the maximal frequent itemsets (MFIs) can perfectly imply data stream and the number is smaller, therefore, the time cost and memory usage are much more efficient. This paper proposes DMFI to detect the exceptions of data stream, an improved method called MRMFI and a pattern matching method called IM-Sunday and included in DMFI. MRMFI mines the MFIs from data stream and it uses two matrices to store the information, the frequent multiple-itemsets are generated by the extension of frequent 2-itemsets. Then, the exceptions are detected by using IM-Sunday algorithm to match the patterns in MFIs. Some experimental studies are conducted based on proposed method, the results show that the MRFIM method can mine MFIs in less time and DMFI can efficiently detect the exceptions of data stream.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Calders, T., Dexters, N., Gillis, J.J.M., et al.: Mining frequent itemsets in a stream. Inf. Syst. 39, 233–255 (2014)

    Article  Google Scholar 

  2. Nori, F., Deypir, M., Sadreddini, M.H.: A sliding window based algorithm for frequent closed itemset mining over data streams. J. Syst. Softw. 86(3), 615–623 (2013)

    Article  Google Scholar 

  3. Deng, Z.H.: DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl. Soft Comput. 41, 214–223 (2016)

    Article  Google Scholar 

  4. Shin, S.J., Lee, D.S., Lee, W.S.: CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams. Inf. Sci. 278, 559–576 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Li, H.F., Lee, S.Y., Shan, M.K.: Online mining (recently) maximal frequent itemsets over data streams. In: 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications (RIDE-SDMA 2005), pp. 11–18. IEEE (2005)

    Google Scholar 

  6. Fan, G.D., Yin, S.H.: A frequent itemsets mining algorithm based on matrix in sliding window over data streams. In: 3rd International Conference Intelligent System Design and Engineering Applications, pp. 66–69 (2013)

    Google Scholar 

  7. Yan, Q.Y., Xia, S.X., Feng, K.W.: Probabilistic distance based abnormal pattern detection in uncertain series data. Knowl.-Based Syst. 36, 182–190 (2012)

    Article  Google Scholar 

  8. Liu, J., Deng, H.F.: Outlier detection on uncertain data based on local information. Knowl.-Based Syst. 51, 60–71 (2013)

    Article  Google Scholar 

  9. Böhm, C., Plant, C., Shao, J., et al.: Clustering by synchronization. In: Proceedings of 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 583–592. ACM (2010)

    Google Scholar 

  10. Kao, L.J., Huang, Y.P.: Association rules based algorithm for identifying outlier transactions in data stream. In: International Conference on Systems, Man, and Cybernetics (SMC), pp. 3209–3214. IEEE (2012)

    Google Scholar 

  11. Angiulli, F., Fassetti, F.: Detecting distance-based outliers in streams of data. In: Proceedings of the 16th Conference on Information and Knowledge Management, pp. 811–820. ACM (2007)

    Google Scholar 

  12. Wang, W., Guyet, T., Quiniou, R., et al.: Autonomic intrusion detection: adaptively detecting anomalies over unlabeled audit data streams in computer networks. Knowl.-Based Syst. 70, 103–117 (2014)

    Article  Google Scholar 

  13. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  14. Cho, S., Na, J.C., Park, K., et al.: A fast algorithm for order-preserving pattern matching. Inf. Process. Lett. 115(2), 397–402 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  15. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762–772 (1977)

    Article  MATH  Google Scholar 

  16. Sunday, D.M.: A very fast substring search algorithm. Commun. ACM 33(8), 132–142 (1990)

    Article  Google Scholar 

  17. Chen, J.F., Cai, S.H., Zhu, L.L., et al.: An improved string-searching algorithm and its application in component security testing. Tsinghua Sci. Technol. 21(3), 281–294 (2016)

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by Scientific and technological key projects of Xinjiang Production & Construction Corps (Grant No. 2015AC023).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ruizhi Sun .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cai, S., Sun, R., Cheng, C., Wu, G. (2017). Exception Detection of Data Stream Based on Improved Maximal Frequent Itemsets Mining. In: Xu, M., Qin, Z., Yan, F., Fu, S. (eds) Trusted Computing and Information Security. CTCIS 2017. Communications in Computer and Information Science, vol 704. Springer, Singapore. https://doi.org/10.1007/978-981-10-7080-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7080-8_10

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7079-2

  • Online ISBN: 978-981-10-7080-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics