2000 character limit reached
An incremental linear-time learning algorithm for the Optimum-Path Forest classifier (1604.03346v5)
Published 12 Apr 2016 in cs.LG and cs.CV
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.