scirs2-transform 0.3.4

Data transformation module for SciRS2 (scirs2-transform)
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
//! Benchmarks for scirs2-transform comparing with scikit-learn performance
//!
//! Run with: cargo bench --bench transform_bench

use criterion::{criterion_group, criterion_main, BenchmarkId, Criterion, Throughput};
use scirs2_core::ndarray::RandomExt;
use scirs2_core::ndarray::{Array2, ArrayBase, Axis, Data, Ix2};
use scirs2_core::random::prelude::*;
use scirs2_core::random::OptimizedArrayRandom;
use scirs2_transform::*;
use std::hint::black_box;

const SAMPLE_SIZES: &[usize] = &[100, 1000, 10_000];
const FEATURE_SIZES: &[usize] = &[10, 50, 100];

/// Benchmark normalization operations
#[allow(dead_code)]
fn bench_normalization(c: &mut Criterion) {
    let mut group = c.benchmark_group("Normalization");

    for &n_samples in SAMPLE_SIZES {
        for &n_features in FEATURE_SIZES {
            let mut rng = thread_rng();
            let data = Array2::random_bulk(
                Ix2(n_samples, n_features),
                Uniform::new(-100.0, 100.0).expect("Operation failed"),
                &mut rng,
            );

            // MinMax normalization
            group.throughput(Throughput::Elements((n_samples * n_features) as u64));
            group.bench_with_input(
                BenchmarkId::new("MinMax", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    b.iter(|| {
                        let _result =
                            normalize_array(black_box(data), NormalizationMethod::MinMax, 0);
                    });
                },
            );

            // Z-score normalization
            group.bench_with_input(
                BenchmarkId::new("ZScore", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    b.iter(|| {
                        let _result =
                            normalize_array(black_box(data), NormalizationMethod::ZScore, 0);
                    });
                },
            );

            // L2 normalization
            group.bench_with_input(
                BenchmarkId::new("L2", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    b.iter(|| {
                        let _result = normalize_array(black_box(data), NormalizationMethod::L2, 1);
                    });
                },
            );

            // Robust normalization
            group.bench_with_input(
                BenchmarkId::new("Robust", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    b.iter(|| {
                        let _result =
                            normalize_array(black_box(data), NormalizationMethod::Robust, 0);
                    });
                },
            );
        }
    }

    group.finish();
}

/// Benchmark SIMD-accelerated normalization operations
#[cfg(feature = "simd")]
#[allow(dead_code)]
fn bench_simd_normalization(c: &mut Criterion) {
    use scirs2_transform::normalize_simd::*;

    let mut group = c.benchmark_group("SIMD_Normalization");

    for &n_samples in SAMPLE_SIZES {
        for &n_features in FEATURE_SIZES {
            let mut rng = thread_rng();
            let data = Array2::random_bulk(
                Ix2(n_samples, n_features),
                Uniform::new(-100.0, 100.0).expect("Operation failed"),
                &mut rng,
            );

            // SIMD MinMax normalization
            group.throughput(Throughput::Elements((n_samples * n_features) as u64));
            group.bench_with_input(
                BenchmarkId::new("SIMD_MinMax", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    b.iter(|| {
                        let _result =
                            simd_normalizearray(black_box(data), NormalizationMethod::MinMax, 0);
                    });
                },
            );

            // SIMD Z-score normalization
            group.bench_with_input(
                BenchmarkId::new("SIMD_ZScore", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    b.iter(|| {
                        let _result =
                            simd_normalizearray(black_box(data), NormalizationMethod::ZScore, 0);
                    });
                },
            );
        }
    }

    group.finish();
}

/// Benchmark scaling operations
#[allow(dead_code)]
fn bench_scaling(c: &mut Criterion) {
    let mut group = c.benchmark_group("Scaling");

    for &n_samples in SAMPLE_SIZES {
        for &n_features in FEATURE_SIZES {
            let mut rng = thread_rng();
            let data = Array2::random_bulk(
                Ix2(n_samples, n_features),
                Uniform::new(-100.0, 100.0).expect("Operation failed"),
                &mut rng,
            );

            // MaxAbsScaler
            group.throughput(Throughput::Elements((n_samples * n_features) as u64));
            group.bench_with_input(
                BenchmarkId::new("MaxAbsScaler", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    let mut scaler = MaxAbsScaler::new();
                    scaler.fit(data).expect("Operation failed");

                    b.iter(|| {
                        let _result = scaler.transform(black_box(data));
                    });
                },
            );

            // QuantileTransformer
            group.bench_with_input(
                BenchmarkId::new(
                    "QuantileTransformer",
                    format!("{}x{}", n_samples, n_features),
                ),
                &data,
                |b, data| {
                    let mut transformer =
                        QuantileTransformer::new(100, "uniform", false).expect("Operation failed");
                    transformer.fit(data).expect("Operation failed");

                    b.iter(|| {
                        let _result = transformer.transform(black_box(data));
                    });
                },
            );
        }
    }

    group.finish();
}

/// Benchmark feature engineering operations
#[allow(dead_code)]
fn bench_feature_engineering(c: &mut Criterion) {
    let mut group = c.benchmark_group("Feature_Engineering");

    for &n_samples in &[100, 1000] {
        // Smaller sizes for polynomial features
        for &n_features in &[5, 10, 20] {
            // Fewer features due to polynomial expansion
            let mut rng = thread_rng();
            let data = Array2::random_bulk(
                Ix2(n_samples, n_features),
                Uniform::new(-10.0, 10.0).expect("Operation failed"),
                &mut rng,
            );

            // Polynomial features (degree 2)
            group.throughput(Throughput::Elements((n_samples * n_features) as u64));
            group.bench_with_input(
                BenchmarkId::new(
                    "PolynomialFeatures",
                    format!("{}x{}", n_samples, n_features),
                ),
                &data,
                |b, data| {
                    let poly = PolynomialFeatures::new(2, false, false);

                    b.iter(|| {
                        let _result = poly.transform(black_box(data));
                    });
                },
            );

            // Power transformation
            group.bench_with_input(
                BenchmarkId::new("PowerTransform", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    let mut pt =
                        PowerTransformer::new("yeo-johnson", true).expect("Operation failed");
                    pt.fit(data).expect("Operation failed");

                    b.iter(|| {
                        let _result = pt.transform(black_box(data));
                    });
                },
            );

            // Binarization
            group.bench_with_input(
                BenchmarkId::new("Binarize", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    b.iter(|| {
                        let _result = binarize(black_box(data), 0.0);
                    });
                },
            );
        }
    }

    group.finish();
}

/// Benchmark dimensionality reduction operations
#[allow(dead_code)]
fn bench_dimensionality_reduction(c: &mut Criterion) {
    let mut group = c.benchmark_group("Dimensionality_Reduction");

    for &n_samples in &[100, 500] {
        // Smaller sizes for expensive operations
        for &n_features in &[20, 50] {
            let mut rng = thread_rng();
            let data = Array2::random_bulk(
                Ix2(n_samples, n_features),
                Uniform::new(-10.0, 10.0).expect("Operation failed"),
                &mut rng,
            );
            let n_components = n_features / 2;

            // PCA
            group.throughput(Throughput::Elements((n_samples * n_features) as u64));
            group.bench_with_input(
                BenchmarkId::new("PCA", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    let mut pca = PCA::new(n_components, true, false);
                    pca.fit(data).expect("Operation failed");

                    b.iter(|| {
                        let _result = pca.transform(black_box(data));
                    });
                },
            );

            // TruncatedSVD
            group.bench_with_input(
                BenchmarkId::new("TruncatedSVD", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    let mut svd = TruncatedSVD::new(n_components);
                    svd.fit(data).expect("Operation failed");

                    b.iter(|| {
                        let _result = svd.transform(black_box(data));
                    });
                },
            );
        }
    }

    group.finish();
}

/// Benchmark imputation operations
#[allow(dead_code)]
fn bench_imputation(c: &mut Criterion) {
    let mut group = c.benchmark_group("Imputation");

    for &n_samples in SAMPLE_SIZES {
        for &n_features in &[10, 20] {
            // Smaller feature sizes for imputation
            // Create data with missing values
            let mut rng = thread_rng();
            let mut data = Array2::random_bulk(
                Ix2(n_samples, n_features),
                Uniform::new(-10.0, 10.0).expect("Operation failed"),
                &mut rng,
            );
            // Insert NaN values randomly (about 10%)
            for i in 0..n_samples {
                for j in 0..n_features {
                    if thread_rng().random::<f64>() < 0.1 {
                        data[[i, j]] = f64::NAN;
                    }
                }
            }

            // SimpleImputer
            group.throughput(Throughput::Elements((n_samples * n_features) as u64));
            group.bench_with_input(
                BenchmarkId::new("SimpleImputer", format!("{}x{}", n_samples, n_features)),
                &data,
                |b, data| {
                    let mut imputer = SimpleImputer::new(ImputeStrategy::Mean, f64::NAN);
                    imputer.fit(data).expect("Operation failed");

                    b.iter(|| {
                        let _result = imputer.transform(black_box(data));
                    });
                },
            );

            // KNNImputer (only for smaller datasets)
            if n_samples <= 1000 {
                group.bench_with_input(
                    BenchmarkId::new("KNNImputer", format!("{}x{}", n_samples, n_features)),
                    &data,
                    |b, data| {
                        let mut imputer = KNNImputer::new(
                            5,
                            DistanceMetric::Euclidean,
                            WeightingScheme::Distance,
                            f64::NAN,
                        );
                        imputer.fit(data).expect("Operation failed");

                        b.iter(|| {
                            let _result = imputer.transform(black_box(data));
                        });
                    },
                );
            }
        }
    }

    group.finish();
}

/// Benchmark pipeline operations
#[allow(dead_code)]
fn bench_pipeline(c: &mut Criterion) {
    let mut group = c.benchmark_group("Pipeline");

    for &n_samples in &[100, 1000] {
        for &n_features in &[10, 20] {
            let mut rng = thread_rng();
            let data = Array2::random_bulk(
                Ix2(n_samples, n_features),
                Uniform::new(-10.0, 10.0).expect("Operation failed"),
                &mut rng,
            );

            // Simple pipeline: StandardScaler -> PCA
            group.throughput(Throughput::Elements((n_samples * n_features) as u64));
            group.bench_with_input(
                BenchmarkId::new(
                    "StandardScaler_PCA",
                    format!("{}x{}", n_samples, n_features),
                ),
                &data,
                |b, data| {
                    // Create pipeline
                    let normalizer = Normalizer::new(NormalizationMethod::ZScore, 0);
                    let pca = PCA::new(n_features / 2, true, false);

                    // Note: Since we don't have the adapter implementations compiled,
                    // we'll benchmark the operations separately
                    b.iter(|| {
                        let mut norm = normalizer.clone();
                        let normalized = norm
                            .fit_transform(black_box(data))
                            .expect("Operation failed");

                        let mut pca_copy = pca.clone();
                        let _result = pca_copy.fit_transform(&normalized);
                    });
                },
            );
        }
    }

    group.finish();
}

// Configure criterion and add benchmark groups
criterion_group!(
    benches,
    bench_normalization,
    bench_scaling,
    bench_feature_engineering,
    bench_dimensionality_reduction,
    bench_imputation,
    bench_pipeline
);

#[cfg(feature = "simd")]
criterion_group!(simd_benches, bench_simd_normalization);

#[cfg(not(feature = "simd"))]
criterion_main!(benches);

#[cfg(feature = "simd")]
criterion_main!(benches, simd_benches);