Papers
Topics
Authors
Recent
Search
2000 character limit reached

An Evolving Population Approach to Data-Stream Classification with Extreme Verification Latency

Published 7 Dec 2023 in cs.NE, cs.AI, and cs.LG | (2312.14948v1)

Abstract: Recognising and reacting to change in non-stationary data-streams is a challenging task. The majority of research in this area assumes that the true class label of incoming points are available, either at each time step or intermittently with some latency. In the worse case this latency approaches infinity and we can assume that no labels are available beyond the initial training set. When change is expected and no further training labels are provided the challenge of maintaining a high classification accuracy is very great. The challenge is to propagate the original training information through several timesteps, possibly indefinitely, while adapting to underlying change in the data-stream. In this paper we conduct an initial study into the effectiveness of using an evolving, population-based approach as the mechanism for adapting to change. An ensemble of one-class-classifiers is maintained for each class. Each classifier is considered as an agent in the sub-population and is subject to selection pressure to find interesting areas of the feature space. This selection pressure forces the ensemble to adapt to the underlying change in the data-stream.

Authors (2)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. C.C. Aggarwal, J. Han, J. Wang, and P.S. Yu. “On demand classification of data streams” In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 503-508). ACM. 2004.
  2. M. Arostegi, J.L. Lobo, and J. Del Ser, “SLAYER: A Semi-supervised Learning Approach for Drifting Data Streams under Extreme Verification Latency”. In Workshop on Interactive Adaptive Learning (p. 50). 2021
  3. R. Capo, A. Sanchez, and R. Polikar, “Core support extraction for learning from initially labeled nonstationary environments using compose”. In 2014 International Joint Conference on Neural Networks (IJCNN) (pp. 602-608). IEEE. July, 2014.
  4. G. Ditzler, M. Roveri, C. Alippi, and R. Polikar. “Learning in nonstationary environments: A survey” IEEE Computational Intelligence Magazine, 10(4), pp.12-25. 2015.
  5. K.B. Dyer, R., Capo, and R. Polikar, R.“Compose: A semisupervised learning framework for initially labeled nonstationary streaming data”. IEEE transactions on neural networks and learning systems, 25(1), pp.12-26. 2013.
  6. H. Edelsbrunner, D., Kirkpatrick, and R. Seidel, “On the shape of a set of points in the plane”. IEEE Transactions on information theory, 29(4), pp.551-559. 1983.
  7. C. Fahy, S. Yang, and M. Gongora, “Classification in Dynamic Data Streams with a Scarcity of Labels”. IEEE Transactions on Knowledge and Data Engineering. 2021
  8. C. Fahy.,S. Yang, and M. Gongora, “Scarcity of labels in non-stationary data streams: A survey”. ACM Computing Surveys (CSUR), 55(2), pp.1-39. 2022
  9. C. Fahy and S. Yang, “Ant colony stream clustering: A fast density clustering algorithm for dynamic data streams”. IEEE transactions on cybernetics, 49(6), pp.2215-2228.
  10. C. Fahy and S. Yang, “Dynamic stream clustering using ants”. In Advances in Computational Intelligence Systems: Contributions Presented at the 16th UK Workshop on Computational Intelligence, September 7–9, 2016, Lancaster, UK (pp. 495-508). Cham: Springer International Publishing.2016
  11. R.S. Ferreira, G. Zimbrão, G. and L.G. Alvim, “AMANDA: Semi-supervised density-based adaptive model for non-stationary data with extreme verification latency”. Information Sciences, 488, pp.219-237. 2019.
  12. A. Forestiero, C. Pizzuti, and G. Spezzano, “A single pass algorithm for clustering evolving data streams based on swarm intelligence,” Data Mining and Knowledge Discovery, vol. 26, no. 1, pp. 1–26, Nov. 2011.
  13. R. Hyde, P. Angelov, and A. R. MacKenzie, “Fully online clustering of evolving data streams into arbitrarily shaped clusters,” Information Sciences, vol. 382-383, pp. 96–114, 2017.
  14. P. Juszczak, D.M. Tax, E. Pe, and R.P. Duin, “Minimum spanning tree based one-class classifier”. Neurocomputing, 72(7-9), pp.1859-1869. 2009
  15. S.S. Khan, and M.G. Madden, “A survey of recent trends in one class classification”. In Irish conference on artificial intelligence and cognitive science (pp. 188-197). Springer, Berlin, Heidelberg. August, 2009
  16. G. Krempl, “The algorithm APT to classify in concurrence of latency and drift,” in Advances in Intelligent Data Analysis (Lecture Notes in Computer Science), vol. 7014, J. Gama, E. Bradley, and J. Hollmen, Eds. Berlin Heidelberg, Germany: Springer-Verlag, pp. 222–233. 2011.
  17. J. Mũnoz-Marí, F. Bovolo, L. Gómez-Chova, L. Bruzzone, and G. Camp-Valls, “Semisupervised one-class support vector machines for classification of remote sensing data.” IEEE transactions on geoscience and remote sensing, 48(8), pp.3188-3197. 2010
  18. V.M. Souza, D.F. Silva, J. Gama and E. Gustavo. “Data stream classification guided by clustering on nonstationary environments and extreme verification latency” SIAM-ICDM, pp. 873-881. 2015.
  19. V.M. Souza, D.F Silva, G.E., Batista, and J. Gama, J., “Classification of evolving data streams with infinitely delayed labels”. In 2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA) (pp. 214-219). IEEE. December, 2015.
  20. V. Souza, T. Pinho, and G. Batista, “Evaluating stream classifiers with delayed labels information”. In 2018 7th Brazilian Conference on Intelligent Systems (BRACIS) (pp. 408-413). IEEE. 2018.
  21. M. Umer, R. Polikar, and C. Frederickson, “Level iw: Learning extreme verification latency with importance weighting”. In 2017 International Joint Conference on Neural Networks (IJCNN) (pp. 1740-1747). IEEE. May, 2017.
  22. M. Umer, C. Frederickson, C. and R. Polikar, “Learning under extreme verification latency quickly: Fast compose.” In 2016 IEEE Symposium Series on Computational Intelligence (SSCI) (pp. 1-8). IEEE. December, 2016.
  23. M. Umer and R. Polikar, ”Comparative analysis of extreme verification latency learning algorithms”. arXiv preprint arXiv:2011.14917. 2020

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.