Incremental Learning with Concept Drift Detection and Prototype-based Embeddings for Graph Stream Classification

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Malialis, Kleanthis, Li, Jin, Panayiotou, Christos G., Polycarpou, Marios M.
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913630586404864
author Malialis, Kleanthis
Li, Jin
Panayiotou, Christos G.
Polycarpou, Marios M.
author_facet Malialis, Kleanthis
Li, Jin
Panayiotou, Christos G.
Polycarpou, Marios M.
contents Data stream mining aims at extracting meaningful knowledge from continually evolving data streams, addressing the challenges posed by nonstationary environments, particularly, concept drift which refers to a change in the underlying data distribution over time. Graph structures offer a powerful modelling tool to represent complex systems, such as, critical infrastructure systems and social networks. Learning from graph streams becomes a necessity to understand the dynamics of graph structures and to facilitate informed decision-making. This work introduces a novel method for graph stream classification which operates under the general setting where a data generating process produces graphs with varying nodes and edges over time. The method uses incremental learning for continual model adaptation, selecting representative graphs (prototypes) for each class, and creating graph embeddings. Additionally, it incorporates a loss-based concept drift detection mechanism to recalculate graph prototypes when drift is detected.
format Preprint
id arxiv_https___arxiv_org_abs_2404_02572
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Incremental Learning with Concept Drift Detection and Prototype-based Embeddings for Graph Stream Classification
Malialis, Kleanthis
Li, Jin
Panayiotou, Christos G.
Polycarpou, Marios M.
Machine Learning
Data stream mining aims at extracting meaningful knowledge from continually evolving data streams, addressing the challenges posed by nonstationary environments, particularly, concept drift which refers to a change in the underlying data distribution over time. Graph structures offer a powerful modelling tool to represent complex systems, such as, critical infrastructure systems and social networks. Learning from graph streams becomes a necessity to understand the dynamics of graph structures and to facilitate informed decision-making. This work introduces a novel method for graph stream classification which operates under the general setting where a data generating process produces graphs with varying nodes and edges over time. The method uses incremental learning for continual model adaptation, selecting representative graphs (prototypes) for each class, and creating graph embeddings. Additionally, it incorporates a loss-based concept drift detection mechanism to recalculate graph prototypes when drift is detected.
title Incremental Learning with Concept Drift Detection and Prototype-based Embeddings for Graph Stream Classification
topic Machine Learning
url https://arxiv.org/abs/2404.02572