Sökning: "spektral inbäddning"

Hittade 2 uppsatser innehållade orden spektral inbäddning.

1. 1. Traffic Prediction From Temporal Graphs Using Representation Learning

   Master-uppsats, KTH/Matematisk statistik

   Författare :Andreas Movin; [2021]
   Nyckelord :Dynamic time warping DTW ; embedding; graph convolutional networks GCN ; graph neural networks GNN ; persistent homology; spectral graph theory; temporal graphs; topological data analysis TDA ; Dynamisk time warping DTW ; inbäddning; convolutional grafnätverk GCN ; neurala grafnätverk GNN ; persistent homologi; spektral graf teori; dynamisk graf; topologisk dataanalys TDA ;

   Sammanfattning : 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. LÄS MER

3. 2. A graph representation of event intervals for efficient clustering and classification

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Zed Heeje Lee; [2020]
   Nyckelord :event intervals; bipartite graph; spectral embedding; clustering; classification; händelsesintervall; bipartitgraf; spektral inbäddning; klustering; klassificering;

   Sammanfattning : Sequences of event intervals occur in several application domains, while their inherent complexity hinders scalable solutions to tasks such as clustering and classification. In this thesis, we propose a novel spectral embedding representation of event interval sequences that relies on bipartite graphs. LÄS MER