An incremental linear-time learning algorithm for the optimum-path forest classifier

DOI10.1016/j.ipl.2017.05.004zbMath1407.68413arXiv1604.03346OpenAlexW2339019511MaRDI QIDQ2361490

Moacir A. Ponti, Mateus Riva

Publication date: 30 June 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.03346

zbMATH Keywords

computational complexitygraph algorithmsminimum spanning treemachine learningOPF

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Hypergraphs (05C65)

Related Items (1)

A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems

Cites Work

• Algorithms for updating minimal spanning trees
• Estimating the number of connected components in sublinear time
• Incremental algorithms for minimal length paths

This page was built for publication: An incremental linear-time learning algorithm for the optimum-path forest classifier