Choosing the Best Algorithm for an Incremental On-line Learning Task

Losing V, Hammer B, Wersing H (2016)
Presented at the European Symposium on Artificial Neural Networks, Brügge.

Konferenzbeitrag | Englisch
 
Download
OA 319.76 KB
Abstract / Bemerkung
Recently, incremental and on-line learning gained more attention especially in the context of big data and learning from data streams, conflicting with the traditional assumption of complete data availability. Even though a variety of different methods are available, it often remains unclear which of them is suitable for a specific task and how they perform in comparison to each other. We analyze the key properties of seven incremental methods representing different algorithm classes. Our extensive evaluation on data sets with different characteristics gives an overview of the performance with respect to accuracy as well as model complexity, facilitating the choice of the best method for a given application.
Erscheinungsjahr
2016
Konferenz
European Symposium on Artificial Neural Networks
Konferenzort
Brügge
Konferenzdatum
2016-04-27 – 2016-04-29
Page URI
https://pub.uni-bielefeld.de/record/2907624

Zitieren

Losing V, Hammer B, Wersing H. Choosing the Best Algorithm for an Incremental On-line Learning Task. Presented at the European Symposium on Artificial Neural Networks, Brügge.
Losing, V., Hammer, B., & Wersing, H. (2016). Choosing the Best Algorithm for an Incremental On-line Learning Task. Presented at the European Symposium on Artificial Neural Networks, Brügge.
Losing, Viktor, Hammer, Barbara, and Wersing, Heiko. 2016. “Choosing the Best Algorithm for an Incremental On-line Learning Task”. Presented at the European Symposium on Artificial Neural Networks, Brügge .
Losing, V., Hammer, B., and Wersing, H. (2016).“Choosing the Best Algorithm for an Incremental On-line Learning Task”. Presented at the European Symposium on Artificial Neural Networks, Brügge.
Losing, V., Hammer, B., & Wersing, H., 2016. Choosing the Best Algorithm for an Incremental On-line Learning Task. Presented at the European Symposium on Artificial Neural Networks, Brügge.
V. Losing, B. Hammer, and H. Wersing, “Choosing the Best Algorithm for an Incremental On-line Learning Task”, Presented at the European Symposium on Artificial Neural Networks, Brügge, 2016.
Losing, V., Hammer, B., Wersing, H.: Choosing the Best Algorithm for an Incremental On-line Learning Task. Presented at the European Symposium on Artificial Neural Networks, Brügge (2016).
Losing, Viktor, Hammer, Barbara, and Wersing, Heiko. “Choosing the Best Algorithm for an Incremental On-line Learning Task”. Presented at the European Symposium on Artificial Neural Networks, Brügge, 2016.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
Dieses Objekt ist durch das Urheberrecht und/oder verwandte Schutzrechte geschützt. [...]
Volltext(e)
Name
319.76 KB
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T09:18:42Z
MD5 Prüfsumme
a6d71231bf074b33822aa8c437125d23


Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar