A Novel Approach to Extract Best-K Happening Patterns across Streams

Authors

  • K.Nithya  Assistant Professor, Department of Computer Science and Engineering, Nandha College of Technology, Erode-52, Tamil Nadu, India
  • T.Aayebagavathi  UG Students, Department of Computer Science and Engineering, Nandha College of Technology, Erode-52, Tamil Nadu, India
  • V.Mahalakshmi  UG Students, Department of Computer Science and Engineering, Nandha College of Technology, Erode-52, Tamil Nadu, India
  • K.Nithya  UG Students, Department of Computer Science and Engineering, Nandha College of Technology, Erode-52, Tamil Nadu, India
  • K.Vijayalakshmi  UG Students, Department of Computer Science and Engineering, Nandha College of Technology, Erode-52, Tamil Nadu, India

Keywords:

Frequent Pattern Mining, Data Mining, Best-K Happening Patterns

Abstract

Frequent pattern mining is a fundamental problem for many domains, thus has a number of applications. In the Big data and IoT era, objects in these applications are often generated in a streaming fashion. An index-based algorithm is proposed in this project that addresses the challenge and provides the exact answer. The CP-Graph approach, a hybrid index of graph and inverted file structures. The CP-Graph computes the count of a given pattern and updates the answer while pruning unnecessary patterns. Data stream classification has been a widely studied research problem in recent years. The dynamic and evolving nature of data streams requires efficient and effective techniques that are significantly different from static data classification techniques. Two of the most challenging and well studied characteristics of data streams are its infinite length and concept-drift. Data stream classification poses many challenges to the data mining community. In this paper, we address four such major challenges, namely, infinite length, concept-drift, concept-evolution, and feature-evolution. Since a data stream is theoretically infinite in length, it is impractical to store and use all the historical data for training. Concept-drift is a common phenomenon in data streams, which occurs as a result of changes in the underlying concepts. Concept-evolution occurs as a result of new classes evolving in the stream.

References

  1. C.C.Aggarwal. On classification and segmentation of massive audio data streams. Knowl. and Info. Sys., 20:137–156, July 2009.
  2. C.C.Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for on-demand classification of evolving data streams. IEEE Trans. Knowl. Data Eng, 18(5):577–589, 2006.
  3. A.Bifet, G.Holmes, B.Pfahringer, R. Kirkby, and R. Gavald. New ensemble methods for evolving data streams. In Proc. SIGKDD, pages 139–148, 2009.
  4. S.Chen, H. Wang, S. Zhou, and P. Yu. Stop chasing trends: Discovering high order models in evolving data. In Proc. ICDE, pages 923–932, 2008.
  5. W.Fan. Systematic data selection to mine concept-drifting data streams. In Proc. SIGKDD, pages 128–137, 2004.
  6. J.Gao, W.Fan, and J.Han. On appropriate assumptions to mine data streams. In Proc. ICDM, pages 143–152, 2007.
  7. S.Hashemi, Y. Yang, Z.Mirzamomen, and M.Kangavari. Adapted one-versus-all decision trees for data stream classification. IEEE Trans. Knowl. Data Eng, 21(5):624–637, 2009.
  8. G.Hulten, L. Spencer, and P. Domingos. Mining timechanging data streams. In Proc. SIGKDD, pages 97–106, 2001.
  9. I.Katakis, G.Tsoumakas, and I.Vlahavas. Dynamic feature space and incremental feature selection for the classification of textual data streams. In Proc. ECML PKDD, pages 102–116.

Downloads

Published

2018-04-25

Issue

Section

Research Articles

How to Cite

[1]
K.Nithya, T.Aayebagavathi, V.Mahalakshmi, K.Nithya, K.Vijayalakshmi, " A Novel Approach to Extract Best-K Happening Patterns across Streams, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 1, pp.93-97, March-April-2018.