Using \(k\)-nearest-neighbor classification in the leaves of a tree (Q1606094): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-9473(01)00098-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2116179833 / rank | |||
Normal rank | |||
Latest revision as of 10:34, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using \(k\)-nearest-neighbor classification in the leaves of a tree |
scientific article |
Statements
Using \(k\)-nearest-neighbor classification in the leaves of a tree (English)
0 references
31 July 2002
0 references
nearest neighbors
0 references
classification
0 references
hybrid classifiers
0 references
