Danny Panknin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Danny Panknin has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Frank C. Meinecke
Berlin Institute of Technology (TU Berlin), Machine Learning Group, Computer Science, Germany
1 shared publication- Klaus-Robert Müller
Berlin Institute of Technology (TU Berlin), Machine Learning Group, Computer Science, Germany
1 shared publication - Motoaki Kawanabe
RIKEN Center for Advanced Intelligence Project (RIKEN AIP) Tokyo Japan
1 shared publication Paul von Bünau
Berlin Institute of Technology (TU Berlin), Machine Learning Group, Computer Science, Germany
1 shared publication
Latest Publications
- Open Access
- 1 March 2016
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 699 (1) , 012021
Higher order stationary subspace analysis
Non-stationarity in data is an ubiquitous problem in signal processing. The recent stationary subspace analysis procedure (SSA) has enabled to decompose such data into a stationary subspace and a non-stationary part respectively. Algorithmically only weak non- stationarities could be tackled by SSA. The present paper takes the conceptual step generalizing from the use of first and second moments as in SSA to higher order moments, thus defining the proposed higher order stationary subspace analysis procedure (HOSSA). The paper derives the novel procedure and shows simulations. An obvious trade-off between the necessity of estimating higher moments and the accuracy and robustness with which they can be estimated is observed. In an ideal setting of plenty of data where higher moment information is dominating our novel approach can win against standard SSA. However, with limited data, even though higher moments actually dominate the underlying data, still SSA may arrive on par.
- 1 March 2016
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 699 (1) , 012021
Open AccessHigher order stationary subspace analysis
Non-stationarity in data is an ubiquitous problem in signal processing. The recent stationary subspace analysis procedure (SSA) has enabled to decompose such data into a stationary subspace and a non-stationary part respectively. Algorithmically only weak non- stationarities could be tackled by SSA. The present paper takes the conceptual step generalizing from the use of first and second moments as in SSA to higher order moments, thus defining the proposed higher order stationary subspace analysis procedure (HOSSA). The paper derives the novel procedure and shows simulations. An obvious trade-off between the necessity of estimating higher moments and the accuracy and robustness with which they can be estimated is observed. In an ideal setting of plenty of data where higher moment information is dominating our novel approach can win against standard SSA. However, with limited data, even though higher moments actually dominate the underlying data, still SSA may arrive on par.