s2gpp 1.0.2

Algorithm for Highly Efficient Detection of Correlation Anomalies in Multivariate Time Series
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58

use crate::data_store::edge::MaterializedEdge;
use crate::data_store::node::IndependentNode;
use actix::prelude::*;
use actix_telepathy::prelude::*;
use ndarray::Array1;
use serde::{Deserialize, Serialize};
use serde_with::serde_as;
use std::collections::HashMap;

#[derive(Message)]
#[rtype(Result = "()")]
pub struct ScoreInitDone;

#[derive(Message)]
#[rtype(Result = "()")]
pub(crate) struct ScoringDone;

#[serde_as]
#[derive(RemoteMessage, Serialize, Deserialize, Default, Clone)]
pub(crate) struct NodeDegrees {
    #[serde_as(as = "Vec<(_, _)>")]
    pub degrees: HashMap<IndependentNode, usize>,
}

#[serde_as]
#[derive(RemoteMessage, Serialize, Deserialize, Default, Clone)]
pub(crate) struct EdgeWeights {
    #[serde_as(as = "Vec<(_, _)>")]
    pub weights: HashMap<MaterializedEdge, usize>,
}

#[derive(RemoteMessage, Serialize, Deserialize, Default, Clone)]
pub(crate) struct OverlapRotation {
    pub edges: Vec<MaterializedEdge>,
    pub edges_in_time: Vec<usize>,
}

#[derive(Message)]
#[rtype(Result = "()")]
pub(crate) struct ScoringHelperInstruction {
    pub start: usize,
    pub length: usize,
}

#[derive(Message, Clone)]
#[rtype(Result = "()")]
pub(crate) struct ScoringHelperResponse {
    pub start: usize,
    pub scores: Vec<f32>,
    pub first_empty: bool,
}

#[derive(RemoteMessage, Serialize, Deserialize, Default, Clone)]
pub struct SubScores {
    pub cluster_node_id: usize,
    pub scores: Array1<f32>,
    pub first_empty: bool,
}