Name
Abstract | ||
|---|---|---|
A difficult aspect of a time dependent classification task is that the data are not IID sampled. To model this dependency several approaches in longitudinal analysis were developed. However, these approaches either have trouble estimating their generalization performance or are parametric in a statistical sense. To overcome these problems we propose in this paper a new approach of time dependent ensembles. Our approach decomposes the time dependent classification task into a series of classification tasks with IID sampled data. Each task can be solved by a classifier that is not supposed to model any dependency in the data. This allows for the use of a much broader spectrum of existing approaches than is possible on the original data. The classifiers associated with the tasks form the time dependent ensembles. The ensembles estimates the final class of the objects being classified by using a voting scheme. The experiments show the potential of the time dependent ensembles. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ICMLA.2018.00164 | 2018 17TH IEEE INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA) |
Keywords | Field | DocType |
Prediction methods, Time series analysis, Ensembles | Pattern recognition,Voting,Task analysis,Computer science,Feature extraction,Parametric statistics,Artificial intelligence,Classifier (linguistics),Machine learning | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Florian Van Daalen | 1 | 0 | 0.34 |
| Evgueni N. Smirnov | 2 | 24 | 20.38 |
| Nasser Davarzani | 3 | 0 | 1.01 |
| Ralf L. M. Peeters | 4 | 62 | 22.61 |
| J. M. H. Karel | 5 | 9 | 5.57 |
| Hans-Peter Brunner-La Rocca | 6 | 0 | 0.34 |