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

@article{Ponti2017AnIL,
  title={An incremental linear-time learning algorithm for the Optimum-Path Forest classifier},
  author={Moacir P. Ponti and Mateus Riva},
  journal={Inf. Process. Lett.},
  year={2017},
  volume={126},
  pages={1-6}
}
  • M. Ponti, M. Riva
  • Published 12 April 2016
  • Computer Science
  • Inf. Process. Lett.

Figures and Tables from this paper

Developing a fast supervised optimum-path forest based on coreset

TLDR
A novel version of OPF is introduced which utilizes coreset approach for reducing the scale of the input dataset and finds the most informative vertices by proposing a novel incremental coreset construction algorithm.

Relevance Image Sampling from Collection Using Importance Selection on Randomized Optimum-Path Trees

  • M. Ponti
  • Computer Science
    2017 Brazilian Conference on Intelligent Systems (BRACIS)
  • 2017
TLDR
An algorithm that selects relevant images from a collection, based on pasting of small votes ensembles of optimum-path forest base classifiers, which is viable for large datasets and maintained in general their performances after sampling using this method.

One-Class to Multi-Class Model Update Using the Class-Incremental Optimum-Path Forest Classifier

TLDR
This work presents a meta-analysis of features and Meta-Level Features in Twitter Sentiment Analysis that ranks features, called meta-level features, according to their importance in the decision-making process.

Assessing Active Learning Strategies to Improve the Quality Control of the Soybean Seed Vigor

TLDR
Based on the obtained results, it is possible to observe that active learning approaches lead to more robust classifiers, which reach higher accuracies faster (in less learning iterations than traditional supervised learning approaches.

Nature-inspired optimum-path forest

References

SHOWING 1-10 OF 36 REFERENCES

Supervised pattern classification based on optimum‐path forest

TLDR
A general algorithm to learn from errors on an evaluation set without increasing the training set is proposed, and the advantages of the method with respect to SVM, ANN‐MLP, and k‐NN classifiers are shown.

Improving Accuracy and Speed of Optimum-Path Forest Classifier Using Combination of Disjoint Training Subsets

TLDR
A fast method to combine OPF-based classifiers trained with disjoint training subsets, designed to support parallel or distributed processing, and showed that OPF training step runs faster for a series of small subsets than for the whole training set.

Ensembles of Optimum-Path Forest Classifiers Using Input Data Manipulation and Undersampling

TLDR
This paper used the Optimum-Path Forest (OPF) classifier to investigate input data manipulation techniques in order to use less data from the training set without hampering the classification accuracy.

Data clustering as an optimum-path forest problem with applications in image analysis

TLDR
An approach for data clustering based on optimum-path forest with advantages over other pdf-based approaches and extensions to large datasets with results for interactive image segmentation and for fast, accurate, and automatic brain tissue classification in magnetic resonance (MR) images is proposed.

Sparse extreme learning machine classifier exploiting intrinsic graphs