An incremental learning algorithm based on the K-associated graph for non-stationary data classification-Reference-Cited by-同舟云学术

An incremental learning algorithm based on the K-associated graph for non-stationary data classification

Published:2013-10 Issue: Volume:246 Page:52-68
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Bertini João Roberto,Zhao Liang,Lopes Alneu A.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference43 articles.

1. A. Asuncion, D.J. Newman, UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences, 2007. .

2. Manifold regularization: a geometric framework for learning from labeled and unlabeled examples;Belkin;Journal of Machine Learning Research,2006

3. Partially labeled data stream classification with the semi-supervised k-associated graph;Bertini;Journal of the Brazilian Computer Society,2012

4. A nonparametric classification method based on k-associated graphs;Bertini;Information Sciences,2011

5. Semi-Supervised Learning,2006

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Using the K-associated Optimal Graph to Provide Counterfactual Explanations;2022 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE);2022-07-18

2. Weighted Ensemble with one-class Classification and Over-sampling and Instance selection (WECOI): An approach for learning from imbalanced data streams;Journal of Computational Science;2022-05

3. Feature Ranking from Random Forest Through Complex Network’s Centrality Measures;Advances in Databases and Information Systems;2022

4. Learning from Imbalanced Data Streams Based on Over-Sampling and Instance Selection;Computational Science – ICCS 2021;2021

5. GEP‐based classifiers with d rift‐detection;Expert Systems;2020-06-18