An incremental linear-time learning algorithm for the Optimum-Path Forest classifier

04/12/2016
by   Moacir Ponti, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/28/2020

OPFython: A Python-Inspired Optimum-Path Forest Classifier

Machine learning techniques have been paramount throughout the last year...
research
04/13/2022

A Novel Approach for Optimum-Path Forest Classification Using Fuzzy Logic

In the past decades, fuzzy logic has played an essential role in many re...
research
04/10/2019

Asymptotic Optimality of a Time Optimal Path Parametrization Algorithm

Time Optimal Path Parametrization is the problem of minimizing the time ...
research
09/04/2016

A Probabilistic Optimum-Path Forest Classifier for Binary Classification Problems

Probabilistic-driven classification techniques extend the role of tradit...
research
06/14/2023

A note on the complexity of addition

We show that the sum of a sequence of integers can be computed in linear...
research
02/18/2021

Hierarchical Learning Using Deep Optimum-Path Forest

Bag-of-Visual Words (BoVW) and deep learning techniques have been widely...
research
12/14/2022

Simplification of Forest Classifiers and Regressors

We study the problem of sharing as many branching conditions of a given ...

Please sign up or login with your details

Forgot password? Click here to reset