G. Jongbloed
Please Note
22 records found
1
We prove that under mild assumptions of weak long-range dependence, we may apply FLH to m ≈ log n partitioned data streams to mitigate high correlations. We show that the resulting algorithm Thinned-FLH (TFLH) achieves the minimax optimal cumulative error rate of O(n^(1/3)C_n^(2/3)) with high probability, matching the performance in the independent case up to logarithmic factors. We also conduct a simulation study, which validates our theoretical findings and demonstrates that TFLH may outperform FLH in high dependence environments in spite of the data thinning. ...
We prove that under mild assumptions of weak long-range dependence, we may apply FLH to m ≈ log n partitioned data streams to mitigate high correlations. We show that the resulting algorithm Thinned-FLH (TFLH) achieves the minimax optimal cumulative error rate of O(n^(1/3)C_n^(2/3)) with high probability, matching the performance in the independent case up to logarithmic factors. We also conduct a simulation study, which validates our theoretical findings and demonstrates that TFLH may outperform FLH in high dependence environments in spite of the data thinning.
Analysis of the Spatial Extent, Intensity, and Duration of Rainfall Events in the Netherlands
A Statistical Approach Using Radar Data (1998-2023)
The study reveals significant increases in the spatial extent and duration of rainfall events, with these trends persisting across most seasons. Intensity trends are more complex: while shorter-duration events show decreasing intensity, a closer look at smaller-scale shorter-duration higher-intensity events indicates an increase in intensity. No significant changes in the shape parameter of extreme event distributions are detected over the study period.
The analysis also finds strong correlations between event duration and area, and between intensity and both duration and dew point temperature, with these relationships evolving over time. This work provides valuable insights into the dynamics of rainfall events in the Netherlands and lays a foundation for future research on refining intensity metrics, distinguishing rainfall types, and improving flood risk assessments. ...
The study reveals significant increases in the spatial extent and duration of rainfall events, with these trends persisting across most seasons. Intensity trends are more complex: while shorter-duration events show decreasing intensity, a closer look at smaller-scale shorter-duration higher-intensity events indicates an increase in intensity. No significant changes in the shape parameter of extreme event distributions are detected over the study period.
The analysis also finds strong correlations between event duration and area, and between intensity and both duration and dew point temperature, with these relationships evolving over time. This work provides valuable insights into the dynamics of rainfall events in the Netherlands and lays a foundation for future research on refining intensity metrics, distinguishing rainfall types, and improving flood risk assessments.
Operator Learning for Loss Parameter Estimation in Dredging Operations
To optimize the suction production on Trailing Suction Hopper Dredgers
Due to the nature of a lagging density sensor, we integrate a real-time rolling mean error correction mechanism. This addresses training biases for refined predictions, as well as offering an anomaly detection mechanism. The model is trained and validated on real-world vessel data, including synthetic simulations of vacuum processes, and evaluated using trip-wise and global metrics. Experimental results show that the proposed architecture significantly outperforms the rolling mean baseline setups and the classical DeepONet across accuracy metrics such as the root mean square error (RMSE).
This work demonstrates the value of combining domain knowledge with operator learning techniques in maritime engineering. The proposed framework offers a scalable framework, allowing application across entire fleets for real-time suction production estimation and anomaly detection, contributing to efficient dredging operations. ...
Due to the nature of a lagging density sensor, we integrate a real-time rolling mean error correction mechanism. This addresses training biases for refined predictions, as well as offering an anomaly detection mechanism. The model is trained and validated on real-world vessel data, including synthetic simulations of vacuum processes, and evaluated using trip-wise and global metrics. Experimental results show that the proposed architecture significantly outperforms the rolling mean baseline setups and the classical DeepONet across accuracy metrics such as the root mean square error (RMSE).
This work demonstrates the value of combining domain knowledge with operator learning techniques in maritime engineering. The proposed framework offers a scalable framework, allowing application across entire fleets for real-time suction production estimation and anomaly detection, contributing to efficient dredging operations.
Advancing Gaussian Process Bandit Optimization for Time-Varying Functions
Online Learning in the Continuous Time-Varying Setting
A Novel Optimal Execution Strategy
Using data-driven methods and stochastic modeling, with application in the FX Spot Market
It begins by proposing a new measure to evaluate the limit order book volume imbalance, which considers multiple price levels and their weighted impact on market predictions.
Then the research employs a combination of convolutional neural networks and long short-term memory models to analyze the limit order book data and its imbalances, i.e. the previously introduced limit order book volume imbalance and the order flow imbalance, which takes into consideration their time evolution. This methodology allows for the exploration of price movements and the identification of optimal execution strategies by predicting future mid-price movements, which are embedded in the drift term of the stochastic model. The findings indicate that the developed models outperform traditional strategies by adapting more effectively to market dynamics.
Further, this work develops a backtesting environment that simulates market conditions to empirically validate the effectiveness of the proposed strategies against historical data. The results demonstrate a superior performance in terms of profitability and cost-efficiency compared to traditional models that do not utilize the drift term from predictive analytics in their stochastic model of the mid-price.
Future work may extend these methodologies to other financial markets and explore prediction models that include the influence of multiple assets. ...
It begins by proposing a new measure to evaluate the limit order book volume imbalance, which considers multiple price levels and their weighted impact on market predictions.
Then the research employs a combination of convolutional neural networks and long short-term memory models to analyze the limit order book data and its imbalances, i.e. the previously introduced limit order book volume imbalance and the order flow imbalance, which takes into consideration their time evolution. This methodology allows for the exploration of price movements and the identification of optimal execution strategies by predicting future mid-price movements, which are embedded in the drift term of the stochastic model. The findings indicate that the developed models outperform traditional strategies by adapting more effectively to market dynamics.
Further, this work develops a backtesting environment that simulates market conditions to empirically validate the effectiveness of the proposed strategies against historical data. The results demonstrate a superior performance in terms of profitability and cost-efficiency compared to traditional models that do not utilize the drift term from predictive analytics in their stochastic model of the mid-price.
Future work may extend these methodologies to other financial markets and explore prediction models that include the influence of multiple assets.
The results demonstrate superior performance of isotonic regression over parametric approaches, especially in terms of detecting gradual changes and subtle anomalies. However, issues like model misspecification and computational inefficiency remain, prompting further optimization efforts. We also recommend expanding NSP methods to other renewable energy sectors, such as solar energy, to broaden the applicability of these models. ...
The results demonstrate superior performance of isotonic regression over parametric approaches, especially in terms of detecting gradual changes and subtle anomalies. However, issues like model misspecification and computational inefficiency remain, prompting further optimization efforts. We also recommend expanding NSP methods to other renewable energy sectors, such as solar energy, to broaden the applicability of these models.
In this thesis, the Bayesian approach will be used to apply a multinomial logistic regression model to data concerning students’ study habits and beliefs. The data is provided by a research group called PRIME and they focus on mathematics education at the TU Delft. Multinomial logistic regression is used to find predictions of the choices expressed in probabilities. Bayesian statistics is not only useful in a sense that it offers the possibility to specify the prior knowledge, but also because the Bayesian way of thinking can be incorporated in evaluating results. This can be done by constructing credible intervals for the predicted probabilities. Overlap between intervals can then give insight on prediction quality.
In this project, the models are coded in R and here two packages are used: the UPG and the BRMS package. The priors that are compared are the Gaussian and Cauchy distributions. Other than that there are also default priors used in the packages, which can be compared to the Gaussian and Cauchy priors. In the end, a conclusion can be drawn about the performance of each model based on the prediction accuracy. It can be concluded that the BRMS package outperforms the UPG package in terms of accuracy both using default priors and overall using default priors gives more accurate results than specifying the prior. However, the difference in the accuracy of the model using the BRMS package is not significantly higher than the accuracy obtained from the UPG model and the running time is a lot higher for the BRMS package. From the models with a specified prior, the model with the Cauchy distribution as prior performed better. ...
In this thesis, the Bayesian approach will be used to apply a multinomial logistic regression model to data concerning students’ study habits and beliefs. The data is provided by a research group called PRIME and they focus on mathematics education at the TU Delft. Multinomial logistic regression is used to find predictions of the choices expressed in probabilities. Bayesian statistics is not only useful in a sense that it offers the possibility to specify the prior knowledge, but also because the Bayesian way of thinking can be incorporated in evaluating results. This can be done by constructing credible intervals for the predicted probabilities. Overlap between intervals can then give insight on prediction quality.
In this project, the models are coded in R and here two packages are used: the UPG and the BRMS package. The priors that are compared are the Gaussian and Cauchy distributions. Other than that there are also default priors used in the packages, which can be compared to the Gaussian and Cauchy priors. In the end, a conclusion can be drawn about the performance of each model based on the prediction accuracy. It can be concluded that the BRMS package outperforms the UPG package in terms of accuracy both using default priors and overall using default priors gives more accurate results than specifying the prior. However, the difference in the accuracy of the model using the BRMS package is not significantly higher than the accuracy obtained from the UPG model and the running time is a lot higher for the BRMS package. From the models with a specified prior, the model with the Cauchy distribution as prior performed better.
Evaluating Constant Failure Rates in Storm Surge Barriers
A Statistical Framework Applied to Censored Component Lifetimes of the Oosterscheldekering
Vanzelfsprekend zijn er voor verzamelingen met kardinaliteit alef-nul talloze mooie stellingen geformuleerd en bewezen. Deze stellingen kunnen eenvoudig worden uitgebreid naar verzamelingen met kardinaliteit alef-één, door de term 'eindig' in 'oneindig' te veranderen en 'aftelbaar' in 'overaftelbaar'. Het valt echter op dat sommige stellingen die gelden voor verzamelingen met kardinaliteit alef-nul niet meer gelden nadat ze zijn uitgebreid naar verzamelingen met kardinaliteit alef-één. Het kan ook gebeuren dat een stelling juist wel in het overaftelbare geval geldt, maar niet in het aftelbare geval. In dit verslag zullen een aantal dergelijke stellingen aan bod komen.
...
Vanzelfsprekend zijn er voor verzamelingen met kardinaliteit alef-nul talloze mooie stellingen geformuleerd en bewezen. Deze stellingen kunnen eenvoudig worden uitgebreid naar verzamelingen met kardinaliteit alef-één, door de term 'eindig' in 'oneindig' te veranderen en 'aftelbaar' in 'overaftelbaar'. Het valt echter op dat sommige stellingen die gelden voor verzamelingen met kardinaliteit alef-nul niet meer gelden nadat ze zijn uitgebreid naar verzamelingen met kardinaliteit alef-één. Het kan ook gebeuren dat een stelling juist wel in het overaftelbare geval geldt, maar niet in het aftelbare geval. In dit verslag zullen een aantal dergelijke stellingen aan bod komen.
Restoration of Missing Data using a Human Adaptive Framework
The Cleansing Algorithm
Improving data quality is of the utmost importance for any data-driven company, as data quality is unmistakably tied to business analytics and processes. One method to improve upon data quality is to restore missing and wrong data entries.
The goal of this research is construct an algorithm such that it is possible to restore missing and wrong data entries, while making use of a human adaptive framework. This algorithm has been constructed in a modular fashion and consists of three main modules: Data Transformation, Data Structure Analysis and Model Selection. Data Transformation has concerned itself with conversion of raw data to data types and forms the other modules can use.
Data Structure Analysis has been designed to deal with correctly missing data and dichotomy in the target feature by making use of three clustering algorithms: DBSCAN, K-Means and Diffusion Maps. DBSCAN is used to determine the necessity of clustering as well as the initialisation of the K-Means algorithm. K-Means and Diffusion Maps have been used as clustering methods in the one-dimensional target feature and the two-dimensional input-target feature pairs, respectively. Data Structure Analysis has further been designed to perform feature selection through three filter methods: CorrCoef, FCBF and Treelet.
Model Selection has proposed a novel approach to selection of the best model of a candidate set through the optimisation of a conditional model ranking strategy based on the prior construction of theoretical testing. Our candidate set consisted of Expectation Maximisation, K-Means, Multi-Layer Perceptron, Nearest Neighbor, Random Forest, Linear Regression, Polynomial Regression, ElasticNet Regression.
In terms of restorability, it was shown that the optimal configuration of the Cleansing Algorithm for the restoration of missing data, was provided by opting not to use clustering, using a custom alteration to the Treelet algorithm for feature selection and making use of the model selection strategy. This not only lead to the greatest restorability of 56.90% on Aegon data sets, which was an improvement of 44.83% when compared to not using the Cleansing Algorithm, but also to the reduction of computation time by over 400%. A more realistic restorability due to the presence of correctly missing data, was given by the same configuration making use of one-dimensional output clustering. This resulted in a restorability on Aegon data sets of 43.10%. As such it was deemed possible to restore missing data on Aegon data sets.
With respect to the human adaptive framework, it was determined that the construction of the algorithm be modular in the sense that any alternate feature selection or clustering approach can be implemented with ease. Furthermore, the model selection module allows us to customize the theoretical testing and choice of regression or classification models for the restoration of missing data. In doing so, the algorithm has laid the foundations for human adaptivity of the Cleansing Algorithm. ...
Improving data quality is of the utmost importance for any data-driven company, as data quality is unmistakably tied to business analytics and processes. One method to improve upon data quality is to restore missing and wrong data entries.
The goal of this research is construct an algorithm such that it is possible to restore missing and wrong data entries, while making use of a human adaptive framework. This algorithm has been constructed in a modular fashion and consists of three main modules: Data Transformation, Data Structure Analysis and Model Selection. Data Transformation has concerned itself with conversion of raw data to data types and forms the other modules can use.
Data Structure Analysis has been designed to deal with correctly missing data and dichotomy in the target feature by making use of three clustering algorithms: DBSCAN, K-Means and Diffusion Maps. DBSCAN is used to determine the necessity of clustering as well as the initialisation of the K-Means algorithm. K-Means and Diffusion Maps have been used as clustering methods in the one-dimensional target feature and the two-dimensional input-target feature pairs, respectively. Data Structure Analysis has further been designed to perform feature selection through three filter methods: CorrCoef, FCBF and Treelet.
Model Selection has proposed a novel approach to selection of the best model of a candidate set through the optimisation of a conditional model ranking strategy based on the prior construction of theoretical testing. Our candidate set consisted of Expectation Maximisation, K-Means, Multi-Layer Perceptron, Nearest Neighbor, Random Forest, Linear Regression, Polynomial Regression, ElasticNet Regression.
In terms of restorability, it was shown that the optimal configuration of the Cleansing Algorithm for the restoration of missing data, was provided by opting not to use clustering, using a custom alteration to the Treelet algorithm for feature selection and making use of the model selection strategy. This not only lead to the greatest restorability of 56.90% on Aegon data sets, which was an improvement of 44.83% when compared to not using the Cleansing Algorithm, but also to the reduction of computation time by over 400%. A more realistic restorability due to the presence of correctly missing data, was given by the same configuration making use of one-dimensional output clustering. This resulted in a restorability on Aegon data sets of 43.10%. As such it was deemed possible to restore missing data on Aegon data sets.
With respect to the human adaptive framework, it was determined that the construction of the algorithm be modular in the sense that any alternate feature selection or clustering approach can be implemented with ease. Furthermore, the model selection module allows us to customize the theoretical testing and choice of regression or classification models for the restoration of missing data. In doing so, the algorithm has laid the foundations for human adaptivity of the Cleansing Algorithm.
Classification in football
Activity classification using sensor data in football
Forensic speaker recognition
Based on text analysis of transcribed speech fragments
Web-Based Economic Activity Classification
Comparing semi-supervised text classification methods to deal with noisy labels
...