Sökning: "Bayesian model selection"
Visar resultat 1 - 5 av 27 uppsatser innehållade orden Bayesian model selection.
1. Regularization Methods and High Dimensional Data: A Comparative Study Based on Frequentist and Bayesian Methods
Kandidat-uppsats, Lunds universitet/Statistiska institutionenSammanfattning : As the amount of high dimensional data becomes increasingly accessible and common, the need for reliable methods to combat problems such as overfitting and multicollinearity increases. Models need to be able to manage large data sets where predictor variables often outnumber the amount of observations. LÄS MER
2. Spatio-temporal analysis of COVID-19 in Västra Götaland, Sweden
Master-uppsats, Göteborgs universitet/Institutionen för matematiska vetenskaperSammanfattning : Spatio-temporal analysis of COVID-19 data with the two different statistical approaches is the main objective of this thesis. The first classical approach, the Endemic-Epidemic framework (Held et al., 2005) is a class of multivariate time-series models for the incidence counts, obtained from the surveillance systems. LÄS MER
3. Evaluation of machine learning models for classifying malicious URLs
Uppsats för yrkesexamina på grundnivå, Högskolan i Gävle/DatavetenskapSammanfattning : Millions of new websites are created daily, making it challenging to determine which ones are safe. Cybersecurity involves protecting companies and users from cyberattacks. Cybercriminals exploit various methods, including phishing attacks, to trick users into revealing sensitive information. LÄS MER
4. Dynamic Covariance Modelling Using Generalised Wishart Processes
Master-uppsats, Lunds universitet/Matematisk statistikSammanfattning : Modern portfolio theory was pioneered by Markowitz who formulated the mean-variance problem, without which any discussion on quantitative approaches to portfolio selection would be incomplete. The framework boils down to finding the expected return $\mu$ and covariance $\Sigma$, after which the solution is proportional to $\Sigma^{-1}\mu$. LÄS MER
5. Avoiding local minima with Genetic programming of Behavior Trees
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Behavior Trees (BTs) are a reactive policy representation that has gained popularity in recent years, especially in the robotics domain. Among the learning methods for BTs, Genetic Programming (GP) is an effective method for learning a good BT. One drawback of GP is that it is likely to get stuck in local minima. LÄS MER