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

DOI10.1016/j.ins.2013.05.016zbMath1320.68132OpenAlexW2092868107MaRDI QIDQ497276

Yong-Cai Geng, Sumit K. Garg

Publication date: 23 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.05.016

zbMATH Keywords

incremental learningconcept drift\(K\)-associated graphgraph-based learningnon-stationary classificationpurity measure

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

Adaptive graph construction using data self-representativeness for pattern classification ⋮ Achieving a compromise between performance and complexity of structure: an incremental approach

Uses Software

• UCI-ml
• ElemStatLearn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• Incremental learning with partial instance memory
• Incremental learning of dynamic fuzzy neural networks for accurate system modeling
• Decision tree induction based on efficient tree restructuring
• Online ensemble learning: An empirical study
• A survey of outlier detection methodologies
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Advances in Artificial Intelligence – SBIA 2004

This page was built for publication: An incremental learning algorithm based on the \( K\)-associated graph for non-stationary data classification