An incremental linear-time learning algorithm for the optimum-path forest classifier (Q2361490): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Estimating the number of connected components in sublinear time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for updating minimal spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Incremental algorithms for minimal length paths / rank | |||
Normal rank | |||
Latest revision as of 01:10, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An incremental linear-time learning algorithm for the optimum-path forest classifier |
scientific article |
Statements
An incremental linear-time learning algorithm for the optimum-path forest classifier (English)
0 references
30 June 2017
0 references
OPF
0 references
graph algorithms
0 references
computational complexity
0 references
minimum spanning tree
0 references
machine learning
0 references
