Essays about: "neurala grafnätverk"
Found 4 essays containing the words neurala grafnätverk.
-
1. Traffic Prediction From Temporal Graphs Using Representation Learning
University essay from KTH/Matematisk statistikAbstract : With the arrival of 5G networks, telecommunication systems are becoming more intelligent, integrated, and broadly used. This thesis focuses on predicting the upcoming traffic to efficiently promote resource allocation, guarantee stability and reliability of the network. READ MORE
-
2. Money Laundering Detection using Tree Boosting and Graph Learning Algorithms
University essay from KTH/Matematisk statistikAbstract : In this masters thesis we focused on using machine learning methods for detecting money laundering in financial transaction networks, in order to demonstrate that it can be used as a complement or instead of the more commonly used rule based systems. The graph learning method graph convolutional networks (GCN) has been a hot topic in the field since they were shown to scale well with data size back in 2018. READ MORE
-
3. Gamma-ray tracking using graph neural networks
University essay from KTH/FysikAbstract : While there are existing methods of gamma ray-track reconstruction in specialized detectors such as AGATA, including backtracking and clustering, it is naturally of interest to diversify the portfolio of available tools to provide us viable alternatives. In this study some possibilities found in the field of machine learning were investigated, more specifically within the field of graph neural networks. READ MORE
-
4. Using Graph Neural Networks for Track Classification and Time Determination of Primary Vertices in the ATLAS Experiment
University essay from KTH/Matematisk statistikAbstract : Starting in 2027, the high-luminosity Large Hadron Collider (HL-LHC) will begin operation and allow higher-precision measurements and searches for new physics processes between elementary particles. One central problem that arises in the ATLAS detector when reconstructing event information is to separate the rare and interesting hard scatter (HS) interactions from uninteresting pileup (PU) interactions in a spatially compact environment. READ MORE