CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Online Methods of Learning in Occurrence of Concept Drift

by Veena Mittal, Indu Kashyap
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 117 - Number 13
Year of Publication: 2015
Authors: Veena Mittal, Indu Kashyap
10.5120/20614-3280

Veena Mittal, Indu Kashyap . Online Methods of Learning in Occurrence of Concept Drift. International Journal of Computer Applications. 117, 13 ( May 2015), 18-22. DOI=10.5120/20614-3280

@article{ 10.5120/20614-3280,
author = { Veena Mittal, Indu Kashyap },
title = { Online Methods of Learning in Occurrence of Concept Drift },
journal = { International Journal of Computer Applications },
issue_date = { May 2015 },
volume = { 117 },
number = { 13 },
month = { May },
year = { 2015 },
issn = { 0975-8887 },
pages = { 18-22 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume117/number13/20614-3280/ },
doi = { 10.5120/20614-3280 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:59:18.222502+05:30
%A Veena Mittal
%A Indu Kashyap
%T Online Methods of Learning in Occurrence of Concept Drift
%J International Journal of Computer Applications
%@ 0975-8887
%V 117
%N 13
%P 18-22
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Due to potentially large number of applications of real-time data stream mining in scientific and business analysis, the real-time data streams mining has drawn attention of many researchers who are working in the area of machine learning and data mining. In many cases, for real-time data stream mining online learning is used. Environments that require online learning are non-stationary and whose underlying distributions may change over time i. e. concept drift, because of which mining of real- time data streams with concept drifts is quite challenging. However, ensemble methods have been suggested for this particular situation. This paper reviews various online methods of drift detection. We also present some results of our experiments that show the comparison of some online drift detection (concept drift) methods.

References
  1. Albert Bifet. Adaptive learning and mining for data streams and frequent patterns. PhD thesis, UniversitatPolit´ecnica de Catalunya, 2009.
  2. Albert Bifet and Richard Kirkby, DATA STREAM MINING: A Practical Approach, August 2009.
  3. Alexey Tsymbal, "The problem of concept drift: Definitions and related work", Technical report, Department of Computer Science, Trinity College, 2004.
  4. Indre Zliobaite. Learning under Concept Drift: an Overview. Tech. Report, Vilnius University, Faculty of Mathematics and Informatic, 2010
  5. MOA: Massive Online Analysis, a Framework for Stream Classification and Clustering Albert Bifet, Geoff Holmes, Bernhard Pfahringer, Philipp Kranen, Hardy Kremer, Timm Jansen, Thomas Seidl. Journal of Machine Learning Research (JMLR) Workshop and Conference Proceedings. Volume 11: Workshop on Applications of Pattern Analysis (2010).
  6. Minku, Leandro Lei, Online ensemble learning in the presence of concept drift, (2011) Ph. D. thesis, University of Birmingham
  7. Baena-Garc´?a, M. , Del Campo-Avila, J. , Fidalgo, R. and Bifet, A. (2006). Early drift detection method, Proceedings of the Forth ECML PKDD International Workshop on Knowledge Discovery From Data Streams (IWKDDS'06), Berlin, Germany, pp. 77–86.
  8. Gama, J. , Medas, P. , Castillo, G. and Rodrigues, P. (2004). Learning with drift detection, Proceedings of the Seventh Brazilian Symposium on Artificial Intelligence (SBIA'04) – Lecture Notes in Computer Science, Vol. 3171, Springer, S˜ao Luiz do Maranh˜ao, Brazil, pp. 286–295.
  9. Nishida, K. (2008). Learning and Detecting Concept Drift, PhD thesis, Hokkaido University, Japan.
  10. Stanley, K. O. (2003). Learning concept drift with a committee of decision trees, Technical Report UT-AI-TR-03-302, Department of Computer Sciences, University of Texas at Austin, Austin, USA.
  11. Kolter, J. Z. and Maloof, M. A. (2003). Dynamic weighted majority: A new ensemble method for tracking concept drift, Proceedings of the Third International IEEE Conference on Data Mining (ICDM'03), IEEE Press, Los Alamitos, CA, pp. 123–130.
  12. Kolter, J. Z. and Maloof, M. A. (2005). Using additive expert ensembles to cope with concept drift, Proceedings of the Twenty Second ACM International Conference on Machine Learning(ICML'05), Bonn, Germany, pp. 449–456.
  13. Ross, G. J. , Adams, N. M. , Tasoulis, D. K. , Hand, D. J. : Exponentially weighted moving average charts for detecting concept drift. Pattern Recognition Letters 33(2), 191–198 (2012)
  14. Bifet, A. , Gavald`a, R. : Learning from time-changing data with adaptive windowing. In: SIAM International Conference on Data Mining (2007)
  15. Page, E. S. : Continuous inspection schemes. Biometrika 41(1/2), 100–115 (1954)
  16. Albert Bifet, Jesse Read, Bernhard Pfahringer, Geoff Holmes, and Indr?e Zliobait? ? e CD-MOA: Change Detection Framework for Massive Online Analysis
  17. Littlestone, N. and Warmuth, M. K. (1994). The weighted majority algorithm, Information and Computation 108: 212–261.
  18. Roberts, S. W. , 1959. Control chart tests based on geometric moving averages. Technometrics 42 (1), 97–101.
  19. Albert Bifet, Geoff Holmes, Richard Kirkby and Bernhard Pfahringer, MOA: Massive Online Analysis, Journal of Machine Learning Research 11, 1601-1604. , 2010
Index Terms

Computer Science
Information Sciences

Keywords

Concept Drifts Drift detection algorithms Online methods of learning.

Powered by PhDFocusTM