Graph-based method for autonomous adaptation in online learning of non-stationary data

DOI10.1016/J.INS.2024.121765MaRDI QIDQ7010554zbMATH OpenFDO

Authors W. J. Alvarenga, A. C. A. A. Costa, F. V. Campos, L. C. B. Torres, Antônio P. Braga

Publication date 19 March 2025

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2024.121765

zbMATH Keywords

autonomous adaptationdominating setGabriel graphKDEonline learning

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• \(k\)-domination and \(k\)-independence in graphs: A survey
• A note on total domination
• A survey of selected recent results on total domination in graphs
• A survey on concept drift adaptation
• Advances in Artificial Intelligence – SBIA 2004
• Algorithm and hardness results on hop domination in graphs
• Disjoint independent dominating sets in graphs
• Dominating complex networks by identifying minimum skeletons
• Dynamic weighted majority: an ensemble method for drifting concepts
• Hop domination in graphs. II
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• Independent domination in graphs: A survey and recent results
• Minimum connected dominating sets and maximal independent sets in unit disk graphs
• On domination and independent domination numbers of a graph
• Self-triggered finite-time control for discrete-time Markov jump systems
• Support-vector networks
• Sur la sphère vide.
• Total domination in graphs

This page was built for publication: Graph-based method for autonomous adaptation in online learning of non-stationary data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7010554)