datasynth-graph 2.3.1

Graph/network export for synthetic accounting data - supports PyTorch Geometric, Neo4j, and DGL formats
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
//! Feature aggregation for entity groups.
//!
//! This module provides aggregation functions for computing
//! group-level features from individual node features.

use std::collections::HashMap;

use serde::{Deserialize, Serialize};

use crate::models::{Graph, NodeId};

use super::entity_groups::EntityGroup;

/// Aggregation method for combining features.
#[derive(Debug, Clone, Copy, PartialEq, Eq, Serialize, Deserialize)]
pub enum AggregationType {
    /// Sum of all values.
    Sum,
    /// Arithmetic mean.
    Mean,
    /// Weighted mean (by transaction volume).
    WeightedMean,
    /// Maximum value.
    Max,
    /// Minimum value.
    Min,
    /// Median value.
    Median,
}

/// Aggregated features for an entity group.
#[derive(Debug, Clone, Default, Serialize, Deserialize)]
pub struct AggregatedFeatures {
    /// Total transaction volume within the group.
    pub total_volume: f64,
    /// Average transaction size.
    pub avg_transaction_size: f64,
    /// Combined risk score for the group.
    pub combined_risk_score: f64,
    /// Ratio of internal flows to total.
    pub internal_flow_ratio: f64,
    /// Ratio of external flows to total.
    pub external_flow_ratio: f64,
    /// Number of unique external counterparties.
    pub external_counterparty_count: usize,
    /// Variance in member activity.
    pub activity_variance: f64,
    /// Number of members.
    pub member_count: usize,
}

impl AggregatedFeatures {
    /// Converts to a feature vector.
    pub fn to_features(&self) -> Vec<f64> {
        vec![
            (self.total_volume + 1.0).ln(),
            (self.avg_transaction_size + 1.0).ln(),
            self.combined_risk_score,
            self.internal_flow_ratio,
            self.external_flow_ratio,
            self.external_counterparty_count as f64,
            self.activity_variance,
            self.member_count as f64,
        ]
    }

    /// Returns feature count.
    pub fn feature_count() -> usize {
        8
    }

    /// Returns feature names.
    pub fn feature_names() -> Vec<&'static str> {
        vec![
            "total_volume_log",
            "avg_transaction_size_log",
            "combined_risk_score",
            "internal_flow_ratio",
            "external_flow_ratio",
            "external_counterparty_count",
            "activity_variance",
            "member_count",
        ]
    }
}

/// Aggregates features for a group of nodes.
pub fn aggregate_features(
    group: &EntityGroup,
    graph: &Graph,
    _agg_type: AggregationType,
) -> AggregatedFeatures {
    let member_set: std::collections::HashSet<NodeId> = group.members.iter().copied().collect();

    let mut total_volume = 0.0;
    let mut internal_volume = 0.0;
    let mut external_volume = 0.0;
    let mut transaction_count = 0;
    let mut external_counterparties = std::collections::HashSet::new();
    let mut member_activities = Vec::new();

    // Calculate volumes and counterparties
    for &member in &group.members {
        let mut member_activity = 0.0;

        for edge in graph.outgoing_edges(member) {
            total_volume += edge.weight;
            member_activity += edge.weight;
            transaction_count += 1;

            if member_set.contains(&edge.target) {
                internal_volume += edge.weight;
            } else {
                external_volume += edge.weight;
                external_counterparties.insert(edge.target);
            }
        }

        for edge in graph.incoming_edges(member) {
            if !member_set.contains(&edge.source) {
                external_counterparties.insert(edge.source);
            }
        }

        member_activities.push(member_activity);
    }

    // Calculate averages and ratios
    let avg_transaction_size = if transaction_count > 0 {
        total_volume / transaction_count as f64
    } else {
        0.0
    };

    let total_flow = internal_volume + external_volume;
    let internal_flow_ratio = if total_flow > 0.0 {
        internal_volume / total_flow
    } else {
        0.0
    };
    let external_flow_ratio = if total_flow > 0.0 {
        external_volume / total_flow
    } else {
        0.0
    };

    // Calculate activity variance
    let mean_activity = if !member_activities.is_empty() {
        member_activities.iter().sum::<f64>() / member_activities.len() as f64
    } else {
        0.0
    };

    let activity_variance = if member_activities.len() > 1 {
        let variance: f64 = member_activities
            .iter()
            .map(|&a| (a - mean_activity).powi(2))
            .sum::<f64>()
            / member_activities.len() as f64;
        variance.sqrt() / (mean_activity + 1.0) // Coefficient of variation
    } else {
        0.0
    };

    // Calculate combined risk score
    let anomalous_members = group
        .members
        .iter()
        .filter(|&&n| {
            graph
                .get_node(n)
                .map(|node| node.is_anomaly)
                .unwrap_or(false)
        })
        .count();

    let anomalous_edges = group
        .members
        .iter()
        .flat_map(|&n| {
            graph
                .outgoing_edges(n)
                .into_iter()
                .chain(graph.incoming_edges(n))
        })
        .filter(|e| e.is_anomaly)
        .count();

    let total_edges = group
        .members
        .iter()
        .map(|&n| graph.degree(n))
        .sum::<usize>();

    let member_risk = anomalous_members as f64 / group.members.len().max(1) as f64;
    let edge_risk = anomalous_edges as f64 / total_edges.max(1) as f64;
    let combined_risk_score = (member_risk * 0.6 + edge_risk * 0.4).min(1.0);

    AggregatedFeatures {
        total_volume,
        avg_transaction_size,
        combined_risk_score,
        internal_flow_ratio,
        external_flow_ratio,
        external_counterparty_count: external_counterparties.len(),
        activity_variance,
        member_count: group.members.len(),
    }
}

/// Aggregates a specific feature across multiple values.
pub fn aggregate_values(values: &[f64], agg_type: AggregationType) -> f64 {
    if values.is_empty() {
        return 0.0;
    }

    match agg_type {
        AggregationType::Sum => values.iter().sum(),
        AggregationType::Mean => values.iter().sum::<f64>() / values.len() as f64,
        AggregationType::WeightedMean => {
            // Without weights, defaults to mean
            values.iter().sum::<f64>() / values.len() as f64
        }
        AggregationType::Max => values.iter().cloned().fold(f64::NEG_INFINITY, f64::max),
        AggregationType::Min => values.iter().cloned().fold(f64::INFINITY, f64::min),
        AggregationType::Median => {
            let mut sorted = values.to_vec();
            sorted.sort_by(|a, b| a.partial_cmp(b).unwrap_or(std::cmp::Ordering::Equal));
            let mid = sorted.len() / 2;
            if sorted.len().is_multiple_of(2) {
                (sorted[mid - 1] + sorted[mid]) / 2.0
            } else {
                sorted[mid]
            }
        }
    }
}

/// Aggregates weighted values.
pub fn aggregate_weighted(values: &[f64], weights: &[f64], agg_type: AggregationType) -> f64 {
    if values.is_empty() || weights.is_empty() || values.len() != weights.len() {
        return aggregate_values(values, agg_type);
    }

    match agg_type {
        AggregationType::WeightedMean => {
            let total_weight: f64 = weights.iter().sum();
            if total_weight > 0.0 {
                let weighted_sum: f64 = values.iter().zip(weights.iter()).map(|(v, w)| v * w).sum();
                weighted_sum / total_weight
            } else {
                aggregate_values(values, AggregationType::Mean)
            }
        }
        _ => aggregate_values(values, agg_type),
    }
}

/// Aggregates features for all groups.
pub fn aggregate_all_groups(
    groups: &[EntityGroup],
    graph: &Graph,
    agg_type: AggregationType,
) -> HashMap<u64, AggregatedFeatures> {
    let mut result = HashMap::new();

    for group in groups {
        let features = aggregate_features(group, graph, agg_type);
        result.insert(group.group_id, features);
    }

    result
}

/// Multi-feature aggregation result.
#[derive(Debug, Clone)]
pub struct MultiFeatureAggregation {
    /// Aggregated features per dimension.
    pub features: Vec<f64>,
    /// Feature names.
    pub names: Vec<String>,
}

impl MultiFeatureAggregation {
    /// Creates a new multi-feature aggregation.
    pub fn new(features: Vec<f64>, names: Vec<String>) -> Self {
        Self { features, names }
    }

    /// Returns the feature vector.
    pub fn to_features(&self) -> &[f64] {
        &self.features
    }
}

/// Aggregates multiple node feature vectors into a single vector.
pub fn aggregate_node_features(
    node_ids: &[NodeId],
    graph: &Graph,
    agg_type: AggregationType,
) -> MultiFeatureAggregation {
    if node_ids.is_empty() {
        return MultiFeatureAggregation::new(Vec::new(), Vec::new());
    }

    // Collect features from all nodes
    let node_features: Vec<Vec<f64>> = node_ids
        .iter()
        .filter_map(|&id| graph.get_node(id))
        .map(|n| n.features.clone())
        .filter(|f| !f.is_empty())
        .collect();

    if node_features.is_empty() {
        return MultiFeatureAggregation::new(Vec::new(), Vec::new());
    }

    // Find feature dimension
    let dim = node_features[0].len();

    // Aggregate each dimension
    let aggregated: Vec<f64> = (0..dim)
        .map(|d| {
            let values: Vec<f64> = node_features
                .iter()
                .map(|f| f.get(d).copied().unwrap_or(0.0))
                .collect();
            aggregate_values(&values, agg_type)
        })
        .collect();

    let names: Vec<String> = (0..dim).map(|d| format!("feature_{d}")).collect();

    MultiFeatureAggregation::new(aggregated, names)
}

#[cfg(test)]
#[allow(clippy::unwrap_used)]
mod tests {
    use super::*;
    use crate::test_helpers::create_aggregation_test_graph;

    #[test]
    fn test_aggregate_values_sum() {
        let values = vec![1.0, 2.0, 3.0, 4.0, 5.0];
        assert_eq!(aggregate_values(&values, AggregationType::Sum), 15.0);
    }

    #[test]
    fn test_aggregate_values_mean() {
        let values = vec![1.0, 2.0, 3.0, 4.0, 5.0];
        assert_eq!(aggregate_values(&values, AggregationType::Mean), 3.0);
    }

    #[test]
    fn test_aggregate_values_max() {
        let values = vec![1.0, 5.0, 3.0, 2.0, 4.0];
        assert_eq!(aggregate_values(&values, AggregationType::Max), 5.0);
    }

    #[test]
    fn test_aggregate_values_min() {
        let values = vec![1.0, 5.0, 3.0, 2.0, 4.0];
        assert_eq!(aggregate_values(&values, AggregationType::Min), 1.0);
    }

    #[test]
    fn test_aggregate_values_median_odd() {
        let values = vec![1.0, 2.0, 3.0, 4.0, 5.0];
        assert_eq!(aggregate_values(&values, AggregationType::Median), 3.0);
    }

    #[test]
    fn test_aggregate_values_median_even() {
        let values = vec![1.0, 2.0, 3.0, 4.0];
        assert_eq!(aggregate_values(&values, AggregationType::Median), 2.5);
    }

    #[test]
    fn test_aggregate_weighted() {
        let values = vec![10.0, 20.0, 30.0];
        let weights = vec![1.0, 2.0, 1.0];

        let result = aggregate_weighted(&values, &weights, AggregationType::WeightedMean);
        // (10*1 + 20*2 + 30*1) / 4 = 80/4 = 20
        assert_eq!(result, 20.0);
    }

    #[test]
    fn test_aggregate_features() {
        let graph = create_aggregation_test_graph();
        let group = EntityGroup::new(
            1,
            vec![1, 2, 3],
            super::super::entity_groups::GroupType::TransactionCluster,
        );

        let features = aggregate_features(&group, &graph, AggregationType::Sum);

        assert!(features.total_volume > 0.0);
        assert_eq!(features.member_count, 3);
    }

    #[test]
    fn test_aggregate_node_features() {
        let graph = create_aggregation_test_graph();
        let result = aggregate_node_features(&[1, 2, 3], &graph, AggregationType::Mean);

        assert_eq!(result.features.len(), 3);
        // Mean of [1,4,7], [2,5,8], [3,6,9] = [4, 5, 6]
        assert_eq!(result.features[0], 4.0);
        assert_eq!(result.features[1], 5.0);
        assert_eq!(result.features[2], 6.0);
    }

    #[test]
    fn test_aggregated_features_to_vector() {
        let features = AggregatedFeatures {
            total_volume: 1000.0,
            avg_transaction_size: 100.0,
            combined_risk_score: 0.5,
            internal_flow_ratio: 0.6,
            external_flow_ratio: 0.4,
            external_counterparty_count: 5,
            activity_variance: 0.3,
            member_count: 3,
        };

        let vec = features.to_features();
        assert_eq!(vec.len(), AggregatedFeatures::feature_count());
    }
}