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
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
//! Spambase dataset.
//!
//! This is a collection of 4,601 e-mails, gathered at Hewlett-Packard Labs in
//! 1999. The dataset summarizes each email with 57 hand-crafted frequency
//! statistics, not its raw text. The spam came from a postmaster and from
//! individuals who had filed spam. The non-spam came from filed work and
//! personal e-mail. The task is to predict whether a message is spam from those
//! statistics.
//!
//! **Features (57, all numeric):** 48 `word_freq_WORD` percentages, 6
//! `char_freq_CHAR` percentages, and 3 capital-run-length statistics (average,
//! longest, total). All are non-negative. The frequency columns lie in `0..=100`.
//!
//! **Target:** `class` - one of `ham` or `spam`
//!
//! **Samples:** 4,601 total (2,788 ham, 1,813 spam)
//! **Application:** Binary classification / spam detection
//!
//! **Source:** UCI Machine Learning Repository
//! <https://doi.org/10.24432/C53G6X>
use crateDOWNLOAD_RETRIES;
use crateimpl_ml_dataset;
use ;
use ;
use File;
use ReaderBuilder;
/// The URL for the Spambase dataset.
///
/// This is the UCI static package. It is a ZIP archive that contains
/// `spambase.DOCUMENTATION`, `spambase.data`, and `spambase.names`. The loader
/// uses only the `spambase.data` file.
///
/// # Citation
///
/// M. Hopkins, E. Reeber, G. Forman, and J. Suermondt. "Spambase," UCI Machine
/// Learning Repository, \[Online\]. Available: <https://doi.org/10.24432/C53G6X>
const SPAMBASE_DATA_URL: &str = "https://archive.ics.uci.edu/static/public/94/spambase.zip";
/// The filename for the downloaded ZIP archive inside the temp directory.
const SPAMBASE_ZIP_FILENAME: &str = "spambase.zip";
/// The name of the file inside the archive that holds the records.
const SPAMBASE_SOURCE_FILENAME: &str = "spambase.data";
/// The name of the final cached Spambase dataset file.
const SPAMBASE_FILENAME: &str = "spambase.csv";
/// The SHA256 hash of the Spambase dataset file (`spambase.data`).
const SPAMBASE_SHA256: &str = "b1ef93de71f97714d3d7d4f58fc9f718da7bbc8ac8a150eff2778616a8097b12";
/// The name of the dataset.
const SPAMBASE_DATASET_NAME: &str = "spambase";
/// Number of samples.
const N_SAMPLES: usize = 4601;
/// The number of numeric features per sample (48 word frequencies, 6 char
/// frequencies, and 3 capital-run-length statistics).
const N_FEATURES: usize = 57;
/// The number of columns per CSV record (57 features and 1 label).
const N_COLUMNS: usize = N_FEATURES + 1;
/// Source column index of the label (`class`). The label is the **last** column.
const LABEL_COLUMN: usize = N_FEATURES;
/// Type alias for the Spambase dataset: (features, labels).
type SpambaseData = ;
/// This struct represents the Spambase dataset. It loads data lazily: the dataset
/// does not load until you call a data accessor method. Once loaded, the data
/// stays cached for later accesses.
///
/// # About Dataset
///
/// Mark Hopkins, Erik Reeber, George Forman, and Jaap Suermondt generated the
/// Spambase collection at Hewlett-Packard Labs in June–July 1999. The "spam"
/// concept is diverse: advertisements for products or web sites, make-money-fast
/// schemes, chain letters, and pornography. The spam e-mails came from the lab's
/// postmaster and from individuals who had filed spam. The non-spam e-mails came
/// from filed work and personal e-mail. This is why the word `george` and the
/// area code `650` are strong non-spam indicators here. They are useful for a
/// personalized filter, but a general purpose filter would need to blind them.
///
/// The dataset reduces each e-mail to 57 continuous statistics: how often
/// selected words and characters occur, and how long its runs of capital letters
/// are.
///
/// # Feature columns
///
/// All 57 features are quantitative. They form one `(4601, 57)` `Array2<f64>`
/// matrix. By 0-based column index:
///
/// | Columns | Attributes | Unit |
/// |-----------|---------------------------------------|-----------------------------------|
/// | `0..=47` | `word_freq_WORD` (48 words, below) | percentage of words (`0..=100`) |
/// | `48..=53` | `char_freq_CHAR` (6 chars, below) | percentage of chars (`0..=100`) |
/// | `54` | `capital_run_length_average` | average capital-run length |
/// | `55` | `capital_run_length_longest` | longest capital-run length |
/// | `56` | `capital_run_length_total` | total number of capital letters |
///
/// A `word_freq_WORD` column is `100 * (times WORD appears) / (total words)`. A
/// `char_freq_CHAR` column is `100 * (occurrences of CHAR) / (total characters)`.
/// A "word" is any string of alphanumeric characters bounded by non-alphanumeric
/// characters or the end of the string. The capital-run-length columns measure
/// uninterrupted sequences of capital letters. They report the average, the
/// maximum, and the sum, that is, the total number of capital letters in the
/// e-mail.
///
/// The 48 words of columns `0..=47`, in order:
///
/// `make`, `address`, `all`, `3d`, `our`, `over`, `remove`, `internet`, `order`,
/// `mail`, `receive`, `will`, `people`, `report`, `addresses`, `free`,
/// `business`, `email`, `you`, `credit`, `your`, `font`, `000`, `money`, `hp`,
/// `hpl`, `george`, `650`, `lab`, `labs`, `telnet`, `857`, `data`, `415`, `85`,
/// `technology`, `1999`, `parts`, `pm`, `direct`, `cs`, `meeting`, `original`,
/// `project`, `re`, `edu`, `table`, `conference`.
///
/// The 6 characters of columns `48..=53`, in order: `;`, `(`, `[`, `!`, `$`, `#`.
///
/// # Labels
///
/// - `class` (shape `(4601,)`): the `Array1<&'static str>` maps the source's
/// nominal codes to readable names: `0` → `"ham"` (not spam), `1` → `"spam"`.
///
/// See more information at <https://archive.ics.uci.edu/dataset/94/spambase>.
///
/// # Citation
///
/// M. Hopkins, E. Reeber, G. Forman, and J. Suermondt. "Spambase," UCI Machine
/// Learning Repository, \[Online\]. Available: <https://doi.org/10.24432/C53G6X>
///
/// # Thread Safety
///
/// This struct implements `Send` and `Sync` because all its fields implement them.
/// This makes it safe to share the struct across threads. The internal
/// [`Dataset`] makes lazy initialization thread-safe.
///
/// # Example
/// ```no_run
/// use dataset_ml::spambase::Spambase;
///
/// let download_dir = "./spambase"; // the code creates the directory if it does not exist
///
/// let mut dataset = Spambase::new(download_dir);
/// let features = dataset.features().unwrap();
/// let labels = dataset.labels().unwrap();
///
/// let (features, labels) = dataset.data().unwrap(); // this is also a way to get features and labels
/// assert_eq!(features.shape(), &[4601, 57]);
/// assert_eq!(labels.len(), 4601);
///
/// // `get_data()` borrows the cached arrays without reloading. `get_data_mut()`
/// // edits them in place, with no clone and no reload. The change stays cached.
/// // Prefer this method over `.to_owned()` when you only need to change values.
/// if let Some((features, labels)) = dataset.get_data_mut() {
/// features[[0, 0]] = 0.5;
/// labels[0] = "ham";
/// }
/// assert!(dataset.get_data().is_some());
///
/// // `take_data()` moves owned arrays out with no `to_owned()` clone. It leaves
/// // the instance reusable. The next access reloads data from the cached file.
/// let (owned_features, owned_labels) = dataset.take_data().unwrap();
/// assert_eq!(owned_features.shape(), &[4601, 57]);
/// assert_eq!(owned_labels.len(), 4601);
///
/// // `into_data()` also returns owned arrays with no clone, but consumes the
/// // instance (use it when you are done with the dataset).
/// let (owned_features, owned_labels) = dataset.into_data().unwrap();
/// assert_eq!(owned_features.shape(), &[4601, 57]);
/// assert_eq!(owned_labels.len(), 4601);
/// ```
impl_ml_dataset!;