The binomial-neighbour instance-based learner on a multiclass performance measure scheme
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605469741 | ||
| 003 | CHVBK | ||
| 005 | 20210128100324.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20151001xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1461-z |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1461-z | ||
| 245 | 0 | 4 | |a The binomial-neighbour instance-based learner on a multiclass performance measure scheme |h [Elektronische Daten] |c [Theodoros Theodoridis, Huosheng Hu] |
| 520 | 3 | |a This paper presents a novel instance-based learning methodology the Binomial-Neighbour (B-N) algorithm. Unlike to other k-Nearest Neighbour algorithms, B-N employs binomial search through vectors of statistical features and distance primitives. The binomial combinations derived from the search with best classification accuracy are distinct primitives which characterise a pattern. The statistical features employ a twofold role; initially to model the data set in a dimensionality reduction preprocessing, and finally to exploit these attributes to recognise patterns. The paper introduces as well a performance measure scheme for multiclass problems using type error statistics. We harness this scheme to evaluate the B-N model on a benchmark human action dataset of normal and aggressive activities. Classification results are being compared with the standard IBk and IB1 models achieving significantly exceptional recognition performance. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Instance-based learning |2 nationallicence | |
| 690 | 7 | |a k-Nearest neighbours |2 nationallicence | |
| 690 | 7 | |a Lazy learners |2 nationallicence | |
| 690 | 7 | |a Action recognition |2 nationallicence | |
| 700 | 1 | |a Theodoridis |D Theodoros |u University of Salford, Salford, UK |4 aut | |
| 700 | 1 | |a Hu |D Huosheng |u University of Essex, Colchester, UK |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/10(2015-10-01), 2973-2981 |x 1432-7643 |q 19:10<2973 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1461-z |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1461-z |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Theodoridis |D Theodoros |u University of Salford, Salford, UK |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Hu |D Huosheng |u University of Essex, Colchester, UK |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/10(2015-10-01), 2973-2981 |x 1432-7643 |q 19:10<2973 |1 2015 |2 19 |o 500 | ||