{"id":"https://openalex.org/W2603537372","doi":null,"title":"Choosing the Best Algorithm for an Incremental On-line Learning Task","display_name":"Choosing the Best Algorithm for an Incremental On-line Learning Task","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2603537372","mag":"2603537372"},"language":"en","primary_location":{"id":"pmh:oai:pub.uni-bielefeld.de:2907624","doi":null,"is_oa":true,"landing_page_url":"https://pub.uni-bielefeld.de/record/2907624","pdf_url":"https://pub.uni-bielefeld.de/record/2907624","source":{"id":"https://openalex.org/S4306401624","display_name":"Publikationen an der Universit\u00e4t Bielefeld (Universit\u00e4t Bielefeld)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"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\u00fcgge.","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pub.uni-bielefeld.de/record/2907624","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005558095","display_name":"Viktor Losing","orcid":"https://orcid.org/0000-0002-7444-1904","observed_orcids":["https://orcid.org/0000-0002-7444-1904"]},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Viktor Losing","raw_affiliation_strings":["Bielefeld University, Bielefeld, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7444-1904","affiliations":[{"raw_affiliation_string":"Bielefeld University, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091180862","display_name":"Barbara Hammer","orcid":"https://orcid.org/0000-0002-0935-5591","observed_orcids":["https://orcid.org/0000-0002-0935-5591"]},"institutions":[{"id":"https://openalex.org/I20121455","display_name":"Bielefeld University","ror":"https://ror.org/02hpadn98","country_code":"DE","type":"education","lineage":["https://openalex.org/I20121455"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Barbara Hammer","raw_affiliation_strings":["Bielefeld University, Bielefeld, Germany"],"raw_orcid":"https://orcid.org/0000-0002-0935-5591","affiliations":[{"raw_affiliation_string":"Bielefeld University, Bielefeld, Germany","institution_ids":["https://openalex.org/I20121455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004229948","display_name":"Heiko Wersing","orcid":"https://orcid.org/0000-0001-8481-2396","observed_orcids":["https://orcid.org/0000-0001-8481-2396"]},"institutions":[{"id":"https://openalex.org/I1283473643","display_name":"Honda (Japan)","ror":"https://ror.org/03jzay846","country_code":"JP","type":"company","lineage":["https://openalex.org/I1283473643"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Heiko Wersing","raw_affiliation_strings":["Honda (Japan), Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0001-8481-2396","affiliations":[{"raw_affiliation_string":"Honda (Japan), Tokyo, Japan","institution_ids":["https://openalex.org/I1283473643"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1131,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.91549109,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12761","display_name":"Data Stream Mining Techniques","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12761","display_name":"Data Stream Mining Techniques","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12676","display_name":"Machine Learning and ELM","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/incremental-learning","display_name":"incremental learning","score":0.9959999918937683},{"id":"https://openalex.org/keywords/e-learning","display_name":"online learning","score":0.9269999861717224},{"id":"https://openalex.org/keywords/data-streams","display_name":"data streams","score":0.8119999766349792},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.7799999713897705},{"id":"https://openalex.org/keywords/model-complexity","display_name":"model complexity","score":0.8240000009536743},{"id":"https://openalex.org/keywords/classification-accuracy","display_name":"classification accuracy","score":0.699999988079071},{"id":"https://openalex.org/keywords/big-data","display_name":"big data","score":0.800000011920929}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.828386664390564},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6603233814239502},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.6208624839782715},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5974191427230835},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5699206590652466},{"id":"https://openalex.org/C89198739","wikidata":"https://www.wikidata.org/wiki/Q3079880","display_name":"Data stream mining","level":2,"score":0.5415310263633728},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.5179409384727478},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.5127666592597961},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.48895418643951416},{"id":"https://openalex.org/C2780735816","wikidata":"https://www.wikidata.org/wiki/Q28324931","display_name":"Incremental learning","level":2,"score":0.4570569694042206},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.43662509322166443},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4002309739589691},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.365946888923645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09086492657661438},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:pub.uni-bielefeld.de:2907624","doi":null,"is_oa":true,"landing_page_url":"https://pub.uni-bielefeld.de/record/2907624","pdf_url":"https://pub.uni-bielefeld.de/record/2907624","source":{"id":"https://openalex.org/S4306401624","display_name":"Publikationen an der Universit\u00e4t Bielefeld (Universit\u00e4t Bielefeld)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"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\u00fcgge.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pub.librecat.org:2907624","doi":null,"is_oa":true,"landing_page_url":"https://pub.uni-bielefeld.de/record/2907624","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"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\u00fcgge.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:2603537372","doi":null,"is_oa":false,"landing_page_url":"http://www.elen.ucl.ac.be/Proceedings/esann/esannpdf/es2016-71.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306421047","display_name":"The European Symposium on Artificial Neural Networks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"The European Symposium on Artificial Neural Networks","raw_type":null}],"best_oa_location":{"id":"pmh:oai:pub.uni-bielefeld.de:2907624","doi":null,"is_oa":true,"landing_page_url":"https://pub.uni-bielefeld.de/record/2907624","pdf_url":"https://pub.uni-bielefeld.de/record/2907624","source":{"id":"https://openalex.org/S4306401624","display_name":"Publikationen an der Universit\u00e4t Bielefeld (Universit\u00e4t Bielefeld)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"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\u00fcgge.","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2603537372.pdf","grobid_xml":"https://content.openalex.org/works/W2603537372.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W114517082","https://openalex.org/W1437335841","https://openalex.org/W1985602045","https://openalex.org/W2039434802","https://openalex.org/W2056132907","https://openalex.org/W2101234009","https://openalex.org/W2103753221","https://openalex.org/W2108807072","https://openalex.org/W2119507074","https://openalex.org/W2124940540","https://openalex.org/W2133270667","https://openalex.org/W2153635508","https://openalex.org/W2158054309","https://openalex.org/W2159128662","https://openalex.org/W2162152641","https://openalex.org/W2613223284","https://openalex.org/W3120740533"],"related_works":["https://openalex.org/W2758219826","https://openalex.org/W2609002182","https://openalex.org/W3193795674","https://openalex.org/W4288913599","https://openalex.org/W4243630714","https://openalex.org/W2997967197","https://openalex.org/W4392428946","https://openalex.org/W34738725","https://openalex.org/W1529046154","https://openalex.org/W2078925889"],"abstract_inverted_index":{"Recently,":[0],"incremental":[1,65],"and":[2,15,49],"on-line":[3],"learning":[4,16],"gained":[5],"more":[6],"attention":[7],"\\nespecially":[8],"in":[9,53],"the":[10,21,60,83,94,97],"context":[11],"of":[12,24,32,42,63,82,96],"big":[13],"data":[14,18,26,74],"from":[17],"streams,\\nconflicting":[19],"with":[20,76,85],"traditional":[22],"assumption":[23],"complete":[25],"availability.":[27],"Even":[28],"though":[29],"\\na":[30],"variety":[31],"different":[33,68,77],"methods":[34,66],"are":[35],"available,":[36],"it":[37],"often":[38],"remains":[39],"unclear":[40],"which":[41],"them":[43],"is":[44],"suitable\\nfor":[45],"a":[46,101],"specific":[47],"task":[48],"how":[50],"they":[51],"perform":[52],"comparison":[54],"to":[55,87],"each":[56],"other.":[57],"\\nWe":[58],"analyze":[59],"key":[61],"properties":[62],"seven":[64],"representing":[67],"algorithm":[69],"classes.\\nOur":[70],"extensive":[71],"evaluation":[72],"on":[73],"sets":[75],"characteristics":[78],"gives":[79],"an":[80],"overview":[81],"performance":[84],"respect":[86],"accuracy":[88],"as":[89,91],"well":[90],"model":[92],"complexity,\\nfacilitating":[93],"choice":[95],"best":[98],"method":[99],"for":[100],"given":[102],"application.":[103]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2017-04-07T00:00:00"}