M. Sc. Minh Tuan Pham

Methods for Intelligent Interactive Systems (I2S)

Telephone: +49 561 804-6017
Email: tuan.pham[at]uni-kassel[dot]de

Website: Tuan Pham Minh

Location: Wilhelmshöher Allee 73
34121 Kassel

Room: WA-altes Gebäude (WA 73), ohne Raumangabe

Publications

[ 2023 ]
[ 2022 ]
[ 2021 ]
[ 2020 ]
[ 2019 ]
[ 2017 ]
[ 2016 ]
[ 2015 ]

2023[ to top ]

Active Label Refinement for Semantic Segmentation of Satellite Images. Pham, Minh Tuan; Wijesingha, Jayan; Kottke, Daniel; Herde, Marek; Huseljic, Denis; Sick, Bernhard; Wachendorf, Michael; Esch, Thomas. In arXiv e-prints, bl arXiv:2309.06159. 2023.
- [ Abstract ]
- [ BibTeX ]
- [ EndNote ]
- [ URL ]
Remote sensing through semantic segmentation of satellite images contributes to the understanding and utilisation of the earth's surface. For this purpose, semantic segmentation networks are typically trained on large sets of labelled satellite images. However, obtaining expert labels for these images is costly. Therefore, we propose to rely on a low-cost approach, e.g. crowdsourcing or pretrained networks, to label the images in the first step. Since these initial labels are partially erroneous, we use active learning strategies to cost-efficiently refine the labels in the second step. We evaluate the active learning strategies using satellite images of Bengaluru in India, labelled with land cover and land use labels. Our experimental results suggest that an active label refinement to improve the semantic segmentation network's performance is beneficial.
@article{pham2023active, abstract = {Remote sensing through semantic segmentation of satellite images contributes to the understanding and utilisation of the earth's surface. For this purpose, semantic segmentation networks are typically trained on large sets of labelled satellite images. However, obtaining expert labels for these images is costly. Therefore, we propose to rely on a low-cost approach, e.g. crowdsourcing or pretrained networks, to label the images in the first step. Since these initial labels are partially erroneous, we use active learning strategies to cost-efficiently refine the labels in the second step. We evaluate the active learning strategies using satellite images of Bengaluru in India, labelled with land cover and land use labels. Our experimental results suggest that an active label refinement to improve the semantic segmentation network's performance is beneficial.}, author = {Pham, Minh Tuan and Wijesingha, Jayan and Kottke, Daniel and Herde, Marek and Huseljic, Denis and Sick, Bernhard and Wachendorf, Michael and Esch, Thomas}, journal = {arXiv e-prints}, keywords = {itegpub}, pages = {arXiv:2309.06159}, title = {Active Label Refinement for Semantic Segmentation of Satellite Images}, year = 2023 }
%0 Journal Article %1 pham2023active %A Pham, Minh Tuan %A Wijesingha, Jayan %A Kottke, Daniel %A Herde, Marek %A Huseljic, Denis %A Sick, Bernhard %A Wachendorf, Michael %A Esch, Thomas %D 2023 %J arXiv e-prints %P arXiv:2309.06159 %T Active Label Refinement for Semantic Segmentation of Satellite Images %U https://arxiv.org/abs/2309.06159 %X Remote sensing through semantic segmentation of satellite images contributes to the understanding and utilisation of the earth's surface. For this purpose, semantic segmentation networks are typically trained on large sets of labelled satellite images. However, obtaining expert labels for these images is costly. Therefore, we propose to rely on a low-cost approach, e.g. crowdsourcing or pretrained networks, to label the images in the first step. Since these initial labels are partially erroneous, we use active learning strategies to cost-efficiently refine the labels in the second step. We evaluate the active learning strategies using satellite images of Bengaluru in India, labelled with land cover and land use labels. Our experimental results suggest that an active label refinement to improve the semantic segmentation network's performance is beneficial.

2022[ to top ]

Stream-Based Active Learning in Changing Environments under Verification Latency. Pham, Tuan. In Organic Computing -- Doctoral Dissertation Colloquium 2021, S. Tomforde, C. Krupitzer (reds.), bll 152–164. kassel university press, 2022.
- [ Abstract ]
- [ BibTeX ]
- [ EndNote ]
Labeling data often requires human interaction, which is slow and costly depending on the required expertise. Stream-based active learning reduces the cost of labeling for data stream mining by only querying the labels for instances that improve the classifier the most. However, state-of-the-art stream-based active learning strategies assume that verification latency, i.e., the time between a query and the availability of the queried label, is negligible. In reality, this is usually not the case as the experts who provide such labels are not available all the time, and the labeling process itself requires time. This article investigates the impact of verification latency within a stream-based active learning scenario for changing data streams. We focus on two different types of changes that occur over time, i.e., changes in the number of features and changes in the distribution of instances and/or labels. In particular, we identify challenges that occur due to verification latency and propose ideas to overcome these problems within a stream-based active learning strategy.
@incollection{pham2022stream-based, abstract = {Labeling data often requires human interaction, which is slow and costly depending on the required expertise. Stream-based active learning reduces the cost of labeling for data stream mining by only querying the labels for instances that improve the classifier the most. However, state-of-the-art stream-based active learning strategies assume that verification latency, i.e., the time between a query and the availability of the queried label, is negligible. In reality, this is usually not the case as the experts who provide such labels are not available all the time, and the labeling process itself requires time. This article investigates the impact of verification latency within a stream-based active learning scenario for changing data streams. We focus on two different types of changes that occur over time, i.e., changes in the number of features and changes in the distribution of instances and/or labels. In particular, we identify challenges that occur due to verification latency and propose ideas to overcome these problems within a stream-based active learning strategy.}, author = {Pham, Tuan}, booktitle = {Organic Computing – Doctoral Dissertation Colloquium 2021}, editor = {Tomforde, Sven and Krupitzer, Christian}, keywords = {itegpub}, pages = {152–164}, publisher = {kassel university press}, title = {Stream-Based Active Learning in Changing Environments under Verification Latency}, year = 2022 }
%0 Book Section %1 pham2022stream-based %A Pham, Tuan %B Organic Computing -- Doctoral Dissertation Colloquium 2021 %D 2022 %E Tomforde, Sven %E Krupitzer, Christian %I kassel university press %P 152--164 %T Stream-Based Active Learning in Changing Environments under Verification Latency %X Labeling data often requires human interaction, which is slow and costly depending on the required expertise. Stream-based active learning reduces the cost of labeling for data stream mining by only querying the labels for instances that improve the classifier the most. However, state-of-the-art stream-based active learning strategies assume that verification latency, i.e., the time between a query and the availability of the queried label, is negligible. In reality, this is usually not the case as the experts who provide such labels are not available all the time, and the labeling process itself requires time. This article investigates the impact of verification latency within a stream-based active learning scenario for changing data streams. We focus on two different types of changes that occur over time, i.e., changes in the number of features and changes in the distribution of instances and/or labels. In particular, we identify challenges that occur due to verification latency and propose ideas to overcome these problems within a stream-based active learning strategy.
Stream-based active learning for sliding windows under the influence of verification latency. Pham, Tuan; Kottke, Daniel; Krempl, Georg; Sick, Bernhard. In Machine Learning, 111(6), bll 2011–2036. Springer, 2022.
- [ Abstract ]
- [ BibTeX ]
- [ EndNote ]
Stream-based active learning (AL) strategies minimize the labeling effort by querying labels that improve the classifier's performance the most. So far, these strategies neglect the fact that an oracle or expert requires time to provide a queried label. We show that existing AL methods deteriorate or even fail under the influence of such verification latency. The problem with these methods is that they estimate a label's utility on the currently available labeled data. However, when this label would arrive, some of the current data may have gotten outdated and new labels have arrived. In this article, we propose to simulate the available data at the time when the label would arrive. Therefore, our method Forgetting and Simulating (FS) forgets outdated information and simulates the delayed labels to get more realistic utility estimates. We assume to know the label's arrival date a priori and the classifier's training data to be bounded by a sliding window. Our extensive experiments show that FS improves stream-based AL strategies in settings with both, constant and variable verification latency.
@article{pham2022stream, abstract = {Stream-based active learning (AL) strategies minimize the labeling effort by querying labels that improve the classifier's performance the most. So far, these strategies neglect the fact that an oracle or expert requires time to provide a queried label. We show that existing AL methods deteriorate or even fail under the influence of such verification latency. The problem with these methods is that they estimate a label's utility on the currently available labeled data. However, when this label would arrive, some of the current data may have gotten outdated and new labels have arrived. In this article, we propose to simulate the available data at the time when the label would arrive. Therefore, our method Forgetting and Simulating (FS) forgets outdated information and simulates the delayed labels to get more realistic utility estimates. We assume to know the label's arrival date a priori and the classifier's training data to be bounded by a sliding window. Our extensive experiments show that FS improves stream-based AL strategies in settings with both, constant and variable verification latency.}, author = {Pham, Tuan and Kottke, Daniel and Krempl, Georg and Sick, Bernhard}, journal = {Machine Learning}, keywords = {itegpub}, number = 6, pages = {2011–2036}, publisher = {Springer}, title = {Stream-based active learning for sliding windows under the influence of verification latency}, volume = 111, year = 2022 }
%0 Journal Article %1 pham2022stream %A Pham, Tuan %A Kottke, Daniel %A Krempl, Georg %A Sick, Bernhard %D 2022 %I Springer %J Machine Learning %N 6 %P 2011--2036 %R doi.org/10.1007/s10994-021-06099-z %T Stream-based active learning for sliding windows under the influence of verification latency %V 111 %X Stream-based active learning (AL) strategies minimize the labeling effort by querying labels that improve the classifier's performance the most. So far, these strategies neglect the fact that an oracle or expert requires time to provide a queried label. We show that existing AL methods deteriorate or even fail under the influence of such verification latency. The problem with these methods is that they estimate a label's utility on the currently available labeled data. However, when this label would arrive, some of the current data may have gotten outdated and new labels have arrived. In this article, we propose to simulate the available data at the time when the label would arrive. Therefore, our method Forgetting and Simulating (FS) forgets outdated information and simulates the delayed labels to get more realistic utility estimates. We assume to know the label's arrival date a priori and the classifier's training data to be bounded by a sliding window. Our extensive experiments show that FS improves stream-based AL strategies in settings with both, constant and variable verification latency.

2021[ to top ]

Statistical Analysis of Pairwise Connectivity. Krempl, Georg; Kottke, Daniel; Pham, Tuan. In International Conference on Discovery Science (DS), Lecture Notes in Computer Science, bll 138–148. Springer, 2021.
- [ BibTeX ]
- [ EndNote ]
@inproceedings{krempl2021statistical, author = {Krempl, Georg and Kottke, Daniel and Pham, Tuan}, booktitle = {International Conference on Discovery Science (DS)}, keywords = {itegpub}, pages = {138–148}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Statistical Analysis of Pairwise Connectivity}, year = 2021 }
%0 Conference Paper %1 krempl2021statistical %A Krempl, Georg %A Kottke, Daniel %A Pham, Tuan %B International Conference on Discovery Science (DS) %D 2021 %I Springer %P 138--148 %R 10.1007/978-3-030-88942-5_11 %T Statistical Analysis of Pairwise Connectivity
scikit-activeml: A Library and Toolbox for Active Learning Algorithms. Kottke, Daniel; Herde, Marek; Minh, Tuan Pham; Benz, Alexander; Mergard, Pascal; Roghman, Atal; Sandrock, Christoph; Sick, Bernhard. In Preprints, bl 2021030194. 2021.
- [ Abstract ]
- [ BibTeX ]
- [ EndNote ]
- [ URL ]
Machine learning applications often need large amounts of training data to perform well. Whereas unlabeled data can be easily gathered, the labeling process is difficult, time-consuming, or expensive in most applications. Active learning can help solve this problem by querying labels for those data points that will improve the performance the most. Thereby, the goal is that the learning algorithm performs sufficiently well with fewer labels. We provide a library called scikit-activeml that covers the most relevant query strategies and implements tools to work with partially labeled data. It is programmed in Python and builds on top of scikit-learn.
@article{kottke2021scikit, abstract = {Machine learning applications often need large amounts of training data to perform well. Whereas unlabeled data can be easily gathered, the labeling process is difficult, time-consuming, or expensive in most applications. Active learning can help solve this problem by querying labels for those data points that will improve the performance the most. Thereby, the goal is that the learning algorithm performs sufficiently well with fewer labels. We provide a library called scikit-activeml that covers the most relevant query strategies and implements tools to work with partially labeled data. It is programmed in Python and builds on top of scikit-learn.}, author = {Kottke, Daniel and Herde, Marek and Minh, Tuan Pham and Benz, Alexander and Mergard, Pascal and Roghman, Atal and Sandrock, Christoph and Sick, Bernhard}, journal = {Preprints}, keywords = {itegpub}, pages = 2021030194, title = {{scikit-activeml}: {A} Library and Toolbox for Active Learning Algorithms}, year = 2021 }
%0 Journal Article %1 kottke2021scikit %A Kottke, Daniel %A Herde, Marek %A Minh, Tuan Pham %A Benz, Alexander %A Mergard, Pascal %A Roghman, Atal %A Sandrock, Christoph %A Sick, Bernhard %D 2021 %J Preprints %P 2021030194 %T scikit-activeml: A Library and Toolbox for Active Learning Algorithms %U https://www.preprints.org/manuscript/202103.0194/ %X Machine learning applications often need large amounts of training data to perform well. Whereas unlabeled data can be easily gathered, the labeling process is difficult, time-consuming, or expensive in most applications. Active learning can help solve this problem by querying labels for those data points that will improve the performance the most. Thereby, the goal is that the learning algorithm performs sufficiently well with fewer labels. We provide a library called scikit-activeml that covers the most relevant query strategies and implements tools to work with partially labeled data. It is programmed in Python and builds on top of scikit-learn.

2020[ to top ]

Seeing Around Street Corners: Non-Line-of-Sight Detection and Tracking In-the-Wild Using Doppler Radar. Scheiner, Nicolas; Kraus, Florian; Wei, Fangyin; Phan, Buu; Mannan, Fahim; Appenrodt, Nils; Ritter, Werner; Dickmann, Jurgen; Dietmayer, Klaus; Sick, Bernhard; Heide, Felix. In IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2020.
- [ BibTeX ]
- [ EndNote ]
@inproceedings{scheiner2020seeing, author = {Scheiner, Nicolas and Kraus, Florian and Wei, Fangyin and Phan, Buu and Mannan, Fahim and Appenrodt, Nils and Ritter, Werner and Dickmann, Jurgen and Dietmayer, Klaus and Sick, Bernhard and Heide, Felix}, booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)}, keywords = {itegpub}, publisher = {IEEE}, title = {Seeing Around Street Corners: Non-Line-of-Sight Detection and Tracking In-the-Wild Using Doppler Radar}, year = 2020 }
%0 Conference Paper %1 scheiner2020seeing %A Scheiner, Nicolas %A Kraus, Florian %A Wei, Fangyin %A Phan, Buu %A Mannan, Fahim %A Appenrodt, Nils %A Ritter, Werner %A Dickmann, Jurgen %A Dietmayer, Klaus %A Sick, Bernhard %A Heide, Felix %B IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) %D 2020 %I IEEE %R 10.1109/cvpr42600.2020.00214 %T Seeing Around Street Corners: Non-Line-of-Sight Detection and Tracking In-the-Wild Using Doppler Radar
Improving Self-Adaptation For Multi-Sensor Activity Recognition with Active Learning. Pham Minh, T.; Kottke, D.; Tsarenko, A.; Gruhl, C.; Sick, B. In International Joint Conference on Neural Networks (IJCNN). IEEE, 2020.
- [ BibTeX ]
- [ EndNote ]
@inproceedings{phamminh2020improving, author = {{Pham Minh}, T. and {Kottke}, D. and {Tsarenko}, A. and {Gruhl}, C. and {Sick}, B.}, booktitle = {International Joint Conference on Neural Networks (IJCNN)}, keywords = {itegpub}, publisher = {IEEE}, title = {Improving Self-Adaptation For Multi-Sensor Activity Recognition with Active Learning}, year = 2020 }
%0 Conference Paper %1 phamminh2020improving %A Pham Minh, T. %A Kottke, D. %A Tsarenko, A. %A Gruhl, C. %A Sick, B. %B International Joint Conference on Neural Networks (IJCNN) %D 2020 %I IEEE %R 10.1109/ijcnn48605.2020.9206873 %T Improving Self-Adaptation For Multi-Sensor Activity Recognition with Active Learning

2019[ to top ]

Tree Species Classification Based on Hybrid Ensembles of a Convolutional Neural Network (CNN) and Random Forest Classifiers. Knauer, Uwe; Styp von Rekowski, Cornelius; Stecklina, Marianne; Krokotsch, Tilman; Pham Minh, Tuan; Hauffe, Viola; Kilias, David; Ehrhardt, Ina; Sagischewski, Herbert; Chmara, Sergej; Seiffert, Udo. In Remote Sensing, 11(23), bl 2788. MDPI, 2019.
- [ Abstract ]
- [ BibTeX ]
- [ EndNote ]
- [ URL ]
In this paper, we evaluate different popular voting strategies for fusion of classifier results. A convolutional neural network (CNN) and different variants of random forest (RF) classifiers were trained to discriminate between 15 tree species based on airborne hyperspectral imaging data. The spectral data was preprocessed with a multi-class linear discriminant analysis (MCLDA) as a means to reduce dimensionality and to obtain spatial–spectral features. The best individual classifier was a CNN with a classification accuracy of 0.73 +/− 0.086. The classification performance increased to an accuracy of 0.78 +/− 0.053 by using precision weighted voting for a hybrid ensemble of the CNN and two RF classifiers. This voting strategy clearly outperformed majority voting (0.74), accuracy weighted voting (0.75), and presidential voting (0.75).
@article{knauer2019tree, abstract = {In this paper, we evaluate different popular voting strategies for fusion of classifier results. A convolutional neural network (CNN) and different variants of random forest (RF) classifiers were trained to discriminate between 15 tree species based on airborne hyperspectral imaging data. The spectral data was preprocessed with a multi-class linear discriminant analysis (MCLDA) as a means to reduce dimensionality and to obtain spatial–spectral features. The best individual classifier was a CNN with a classification accuracy of 0.73 +/− 0.086. The classification performance increased to an accuracy of 0.78 +/− 0.053 by using precision weighted voting for a hybrid ensemble of the CNN and two RF classifiers. This voting strategy clearly outperformed majority voting (0.74), accuracy weighted voting (0.75), and presidential voting (0.75).}, author = {Knauer, Uwe and Styp von Rekowski, Cornelius and Stecklina, Marianne and Krokotsch, Tilman and Pham Minh, Tuan and Hauffe, Viola and Kilias, David and Ehrhardt, Ina and Sagischewski, Herbert and Chmara, Sergej and Seiffert, Udo}, journal = {Remote Sensing}, keywords = {imported}, number = 23, pages = 2788, publisher = {MDPI}, title = {Tree Species Classification Based on Hybrid Ensembles of a Convolutional Neural Network (CNN) and Random Forest Classifiers}, volume = 11, year = 2019 }
%0 Journal Article %1 knauer2019tree %A Knauer, Uwe %A Styp von Rekowski, Cornelius %A Stecklina, Marianne %A Krokotsch, Tilman %A Pham Minh, Tuan %A Hauffe, Viola %A Kilias, David %A Ehrhardt, Ina %A Sagischewski, Herbert %A Chmara, Sergej %A Seiffert, Udo %D 2019 %I MDPI %J Remote Sensing %N 23 %P 2788 %R 10.3390/rs11232788 %T Tree Species Classification Based on Hybrid Ensembles of a Convolutional Neural Network (CNN) and Random Forest Classifiers %U https://www.mdpi.com/2072-4292/11/23/2788 %V 11 %X In this paper, we evaluate different popular voting strategies for fusion of classifier results. A convolutional neural network (CNN) and different variants of random forest (RF) classifiers were trained to discriminate between 15 tree species based on airborne hyperspectral imaging data. The spectral data was preprocessed with a multi-class linear discriminant analysis (MCLDA) as a means to reduce dimensionality and to obtain spatial–spectral features. The best individual classifier was a CNN with a classification accuracy of 0.73 +/− 0.086. The classification performance increased to an accuracy of 0.78 +/− 0.053 by using precision weighted voting for a hybrid ensemble of the CNN and two RF classifiers. This voting strategy clearly outperformed majority voting (0.74), accuracy weighted voting (0.75), and presidential voting (0.75).
Generative Adversarial Networks for Operational Scenario Planning of Renewable Energy Farms: A Study on Wind and Photovoltaic. Schreiber, Jens; Jessulat, Maik; Sick, Bernhard. In International Conference on Artificial Neural Networks and Machine Learning (ICANN): Image Processing, bll 550–564. Springer, Cham, 2019.
- [ BibTeX ]
- [ EndNote ]
@inproceedings{schreiber2019generative, address = {Cham}, author = {Schreiber, Jens and Jessulat, Maik and Sick, Bernhard}, booktitle = {International Conference on Artificial Neural Networks and Machine Learning (ICANN): Image Processing}, keywords = {imported}, pages = {550–564}, publisher = {Springer}, title = {Generative Adversarial Networks for Operational Scenario Planning of Renewable Energy Farms: A Study on Wind and Photovoltaic}, year = 2019 }
%0 Conference Paper %1 schreiber2019generative %A Schreiber, Jens %A Jessulat, Maik %A Sick, Bernhard %B International Conference on Artificial Neural Networks and Machine Learning (ICANN): Image Processing %C Cham %D 2019 %I Springer %P 550--564 %R 10.1007/978-3-030-30508-6_44 %T Generative Adversarial Networks for Operational Scenario Planning of Renewable Energy Farms: A Study on Wind and Photovoltaic %@ 978-3-030-30508-6

2017[ to top ]

Identifying Representative Load Time Series for Load Flow Calculations. Henze, Janosch; Kneiske, Tanja; Braun, Martin; Sick, Bernhard. In Workshop on Data Analytics for Renewable Energy Integration (DARE), ECML PKDD, bll 83–93. Springer, Cham, Switzerland, 2017.
- [ Abstract ]
- [ BibTeX ]
- [ EndNote ]
Power system analyses increasingly use annual time series for temporal and spatial assessment of operational and also planning aspects. These analyses are often limited due to the computational time of the large amount of load flow calculation. By introducing algorithms which are capable of generating shorter and representative time series of measured load or power generation time series, the calculation time for load flow calculations can be reduced. We present a method which is capable of extracting features from the time series and use those features to create a representative time series. Furthermore, we show that our method is capable of maintaining the most important statistical features of the original time series by applying a Fisher-Pitman Permutation test.
@inproceedings{henze2017identifying, abstract = {Power system analyses increasingly use annual time series for temporal and spatial assessment of operational and also planning aspects. These analyses are often limited due to the computational time of the large amount of load flow calculation. By introducing algorithms which are capable of generating shorter and representative time series of measured load or power generation time series, the calculation time for load flow calculations can be reduced. We present a method which is capable of extracting features from the time series and use those features to create a representative time series. Furthermore, we show that our method is capable of maintaining the most important statistical features of the original time series by applying a Fisher-Pitman Permutation test.}, address = {Cham, Switzerland}, author = {Henze, Janosch and Kneiske, Tanja and Braun, Martin and Sick, Bernhard}, booktitle = {Workshop on Data Analytics for Renewable Energy Integration (DARE), ECML PKDD}, keywords = {imported}, pages = {83–93}, publisher = {Springer}, title = {Identifying Representative Load Time Series for Load Flow Calculations}, year = 2017 }
%0 Conference Paper %1 henze2017identifying %A Henze, Janosch %A Kneiske, Tanja %A Braun, Martin %A Sick, Bernhard %B Workshop on Data Analytics for Renewable Energy Integration (DARE), ECML PKDD %C Cham, Switzerland %D 2017 %I Springer %P 83--93 %R 10.1007/978-3-319-71643-5_8 %T Identifying Representative Load Time Series for Load Flow Calculations %X Power system analyses increasingly use annual time series for temporal and spatial assessment of operational and also planning aspects. These analyses are often limited due to the computational time of the large amount of load flow calculation. By introducing algorithms which are capable of generating shorter and representative time series of measured load or power generation time series, the calculation time for load flow calculations can be reduced. We present a method which is capable of extracting features from the time series and use those features to create a representative time series. Furthermore, we show that our method is capable of maintaining the most important statistical features of the original time series by applying a Fisher-Pitman Permutation test.

2016[ to top ]

Probabilistic Active Learning for Active Class Selection. Kottke, D.; Krempl, G.; Stecklina, M.; Styp von Rekowski, C.; Sabsch, T.; Pham Minh, T.; Deliano, M.; Spiliopoulou, M.; Sick, B. In Workshop on the Future of Interactive Learning Machines, NIPS, bll 1–9. Barcelona, Spain, 2016.
- [ BibTeX ]
- [ EndNote ]
@inproceedings{kottke2016probabilistic, address = {Barcelona, Spain}, author = {Kottke, D. and Krempl, G. and Stecklina, M. and {Styp von Rekowski}, C. and Sabsch, T. and Pham Minh, T. and Deliano, M. and Spiliopoulou, M. and Sick, B.}, booktitle = {Workshop on the Future of Interactive Learning Machines, NIPS}, keywords = {imported}, pages = {1–9}, title = {Probabilistic Active Learning for Active Class Selection}, year = 2016 }
%0 Conference Paper %1 kottke2016probabilistic %A Kottke, D. %A Krempl, G. %A Stecklina, M. %A Styp von Rekowski, C. %A Sabsch, T. %A Pham Minh, T. %A Deliano, M. %A Spiliopoulou, M. %A Sick, B. %B Workshop on the Future of Interactive Learning Machines, NIPS %C Barcelona, Spain %D 2016 %P 1--9 %T Probabilistic Active Learning for Active Class Selection
Generative Exponential Smoothing and Generative ARMA Models to Forecast Time-Variant Rates or Probabilities. Kalkowski, E.; Sick, B. In International Work-Conference on Time Series (ITISE): Selected Contributions, bll 75–88. Springer, Cham, Switzerland, 2016.
- [ BibTeX ]
- [ EndNote ]
@inproceedings{kalkowski2016generative, address = {Cham, Switzerland}, author = {Kalkowski, E. and Sick, B.}, booktitle = {International Work-Conference on Time Series (ITISE): Selected Contributions}, keywords = {imported}, pages = {75–88}, publisher = {Springer}, title = {Generative Exponential Smoothing and Generative {ARMA} Models to Forecast Time-Variant Rates or Probabilities}, year = 2016 }
%0 Conference Paper %1 kalkowski2016generative %A Kalkowski, E. %A Sick, B. %B International Work-Conference on Time Series (ITISE): Selected Contributions %C Cham, Switzerland %D 2016 %I Springer %P 75--88 %R 10.1007/978-3-319-28725-6_6 %T Generative Exponential Smoothing and Generative ARMA Models to Forecast Time-Variant Rates or Probabilities

2015[ to top ]

Track-Based Forecasting of Pedestrian Behavior by Polynomial Approximation and Multilayer Perceptions. Goldhammer, M.; Köhler, S.; Doll, K.; Sick, B. In SAI Intelligent Systems Conference (IntelliSys), Studies in Computational Intelligence, bll 259–279. Springer, Cham, Switzerland, 2015.
- [ BibTeX ]
- [ EndNote ]
@inproceedings{goldhammer2015track, address = {Cham, Switzerland}, author = {Goldhammer, M. and K{\"o}hler, S. and Doll, K. and Sick, B.}, booktitle = {SAI Intelligent Systems Conference (IntelliSys)}, keywords = {imported}, pages = {259–279}, publisher = {Springer}, series = {Studies in Computational Intelligence}, title = {Track-Based Forecasting of Pedestrian Behavior by Polynomial Approximation and Multilayer Perceptions}, year = 2015 }
%0 Conference Paper %1 goldhammer2015track %A Goldhammer, M. %A Köhler, S. %A Doll, K. %A Sick, B. %B SAI Intelligent Systems Conference (IntelliSys) %C Cham, Switzerland %D 2015 %I Springer %P 259--279 %R 10.1007/978-3-319-33386-1_13 %T Track-Based Forecasting of Pedestrian Behavior by Polynomial Approximation and Multilayer Perceptions