Christian Schreckenberger

dblp:250/8948 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2023
0000-0002-1229-4945ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Machine learning and data management · 67% Data mining · 33%
Artificial intelligence
1 paper
Learning theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
online learning
0.712023
Towards Utilitarian Online Learning - A Review of Online Algorithms in Open Feature Space · IJCAI 2023
Data mining › predictive modeling › classification
ensemble learning
0.712023
Online Random Feature Forests for Learning in Varying Feature Spaces · AAAI 2023
Machine learning and data management
feature space evolution
0.712023
Towards Utilitarian Online Learning - A Review of Online Algorithms in Open Feature Space · IJCAI 2023
Machine learning and data management
online learning
0.712023
Online Random Feature Forests for Learning in Varying Feature Spaces · AAAI 2023

Methods — techniques the papers use, named apart from their topics

online learning · 0.7ensemble methods · 0.7
YearPublicationVenuePosition
2023 Online Random Feature Forests for Learning in Varying Feature Spaces
abstract
In this paper, we propose a new online learning algorithm tailored for data streams described by varying feature spaces (VFS), wherein new features constantly emerge and old features may stop to be observed over various time spans. Our proposed algorithm, named Online Random Feature Forests for Feature space Variabilities (ORF3V), provides a strategy to respect such feature dynamics by generating, updating, pruning, as well as online re-weighing an ensemble of what we call feature forests, which are generated and updated based on a compressed and storage efficient representation for each observed feature. We benchmark our algorithm on 12 datasets, including one novel real-world dataset of government COVID-19 responses collected through a crowd-sensing program in Spain. The empirical results substantiate the viability and effectiveness of our ORF3V algorithm and its superior accuracy performance over the state-of-the-art rival models.
Christian Schreckenberger, Yi He 0007, Stefan Lüdtke, Christian Bartelt, Heiner Stuckenschmidt
AAAI1
2023 Towards Utilitarian Online Learning - A Review of Online Algorithms in Open Feature Space
abstract
Human intelligence comes from the capability to describe and make sense of the world surrounding us, often in a lifelong manner. Online Learning (OL) allows a model to simulate this capability, which involves processing data in sequence, making predictions, and learning from predictive errors. However, traditional OL assumes a fixed set of features to describe data, which can be restrictive. In reality, new features may emerge and old features may vanish or become obsolete, leading to an open feature space. This dynamism can be caused by more advanced or outdated technology for sensing the world, or it can be a natural process of evolution. This paper reviews recent breakthroughs that strived to enable OL in open feature spaces, referred to as Utilitarian Online Learning (UOL). We taxonomize existing UOL models into three categories, analyze their pros and cons, and discuss their application scenarios. We also benchmark the performance of representative UOL models, highlighting open problems, challenges, and potential future directions of this emerging topic.
Yi He 0007, Christian Schreckenberger, Heiner Stuckenschmidt, Xindong Wu 0001
IJCAI2
2022 Dynamic Forest for Learning from Data Streams with Varying Feature Spaces
Christian Schreckenberger, Christian Bartelt, Heiner Stuckenschmidt
CoopIS1