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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78

use crate::data_manager::DatasetStats;
use crate::data_store::edge::Edge;
use crate::data_store::node::IndependentNode;
use crate::parameters::Parameters;
use crate::training::edge_estimation::EdgeEstimator;
use crate::training::Training;
use crate::SyncInterface;
use ndarray::arr1;
use std::ops::Deref;

fn test_edge_estimation(nodes: Vec<IndependentNode>, expected_edges: Vec<Edge>) {
    let parameters = Parameters::default();
    let mut training = Training::init(parameters);

    training.dataset_stats = Some(DatasetStats::new(
        arr1(&[0_f32]),
        arr1(&[0_f32]),
        arr1(&[0_f32]),
        nodes.len(),
    ));

    for node in nodes {
        training.data_store.add_independent_node(node)
    }
    training.connect_nodes();

    for (i, expected_edge) in expected_edges.into_iter().enumerate() {
        assert!(training
            .data_store
            .get_edge(i)
            .unwrap()
            .deref()
            .eq(&expected_edge));
    }
}

#[test]
fn test_edge_estimation_ordered() {
    let nodes = vec![
        IndependentNode::new(0, 0, 0),
        IndependentNode::new(1, 0, 1),
        IndependentNode::new(2, 1, 1),
    ];

    let expected_edges = vec![
        Edge::new(
            IndependentNode::new(0, 0, 0).into_ref(),
            IndependentNode::new(1, 0, 1).into_ref(),
        ),
        Edge::new(
            IndependentNode::new(1, 0, 1).into_ref(),
            IndependentNode::new(2, 1, 1).into_ref(),
        ),
    ];

    test_edge_estimation(nodes, expected_edges);
}

#[test]
fn test_edge_estimation_transition_over_0() {
    let nodes = vec![
        IndependentNode::new(98, 0, 0),
        IndependentNode::new(0, 0, 1),
        IndependentNode::new(99, 1, 1),
    ];
    let expected_edges = vec![
        Edge::new(
            IndependentNode::new(98, 0, 0).into_ref(),
            IndependentNode::new(99, 1, 1).into_ref(),
        ),
        Edge::new(
            IndependentNode::new(99, 1, 1).into_ref(),
            IndependentNode::new(0, 0, 1).into_ref(),
        ),
    ];

    test_edge_estimation(nodes, expected_edges);
}