Avancerad sökning
Visar resultat 1 - 5 av 6078 uppsatser som matchar ovanstående sökkriterier.
1. Feature Selection for Microarray Data via Stochastic Approximation
Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : This thesis explores the challenge of feature selection (FS) in machine learning, which involves reducing the dimensionality of data. The selection of a relevant subset of features from a larger pool has demonstrated its effectiveness in enhancing the performance of various machine learning algorithms. LÄS MER
2. Klusteranalys : Tillämpning av agglomerativ hierarkisk och k-means klustring för att hitta bra kluster bland fotbollsspelare baserat på spelarstatistik.
Kandidat-uppsats, Uppsala universitet/Statistiska institutionenSammanfattning : This work is about how the multivariate analysis tool cluster analysis can be appliedto find meaningfull groups of players based on player statistics. The aim of the work isan attempt to find good clusters among players within the Spanish top football divisionLa Liga for the 2022-2023 season. LÄS MER
3. A space-time shape for easier spatiotemporal visualization in traffic networks
Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Avdelningen för systemteknikSammanfattning : Modern big data systems are enabling new possibilities that never were thought possible in the past. The ability to gather massive data on an individual level has made fields like space-time geography bloom in the latest decennia. The usage of shapes in a 3D space allows us to visualize certain phenomena over time. LÄS MER
4. Robust Object Recognition and Tracking with Drones
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : The Skara Skyddsängel project explores an innovative method of providing illumination for cyclists along a 20km unlit bike lane using drones. Current GNSS approach performs generally well but further improvements are need for better robustness. Consequently, this thesis project is raised to seek a robust solution in the field of computer vision. LÄS MER
5. A Verified QBF Solver
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : Quantified Boolean Formulas (QBFs) extend propositional logic with universal and existential quantification over Boolean variables. A QBF is satisfiable if and only if there is an assignment of Boolean values to the free variables that makes the formula true, and a QBF solver is a software tool determining if a given QBF is satisfiable. LÄS MER
![](http://www.uppsatser.se/graphics/blank.gif)