An incremental linear-time learning algorithm for the optimum-path forest classifier
From MaRDI portal
Publication:2361490
Abstract: We present a classification method with incremental capabilities based on the Optimum-Path Forest classifier (OPF). The OPF considers instances as nodes of a fully-connected training graph, arc weights represent distances between two feature vectors. Our algorithm includes new instances in an OPF in linear-time, while keeping similar accuracies when compared with the original quadratic-time model.
Recommendations
Cites work
Cited in
(7)- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
- An incremental learning extremely random forest classifier for online learning
- A Learning Algorithm for the Optimum-Path Forest Classifier
- CONCEPT REPRESENTATION WITH OVERLAPPING FEATURE INTERVALS
- Optimum-path forest. Theory, algorithms, and applications
- A nature-inspired approach to speed up optimum-path forest clustering and its application to intrusion detection in computer networks
- Incremental learning of linear model trees
This page was built for publication: An incremental linear-time learning algorithm for the optimum-path forest classifier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361490)