dci 0.3.0

DCI-Closed, a frequent closed itemset mining algorithm, implemented in Rust
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 std::collections::HashSet;

use lazy_static::lazy_static;

use crate::{
	DataSet,
	Support
};
use super::{dataset, itemset};


/// Generic type for a test dataset.
pub struct TestDataSet<D: DataSet> {
	pub dataset: D,
	pub result: HashSet<(D::ItemSet, Support)>,
	pub min_sup: usize,
}


lazy_static! {
	pub static ref TOY: TestDataSet<dataset::Matrix::<itemset::ItemSet8>> = TestDataSet {
		dataset: {
			let mut dataset = dataset::Matrix::new(5, 6);

			dataset[(0, 0)] = true;
			dataset[(0, 3)] = true;
			dataset[(0, 5)] = true;

			dataset[(1, 1)] = true;
			dataset[(1, 4)] = true;

			dataset[(2, 0)] = true;
			dataset[(2, 1)] = true;
			dataset[(2, 2)] = true;
			dataset[(2, 4)] = true;
			dataset[(2, 5)] = true;

			dataset[(3, 0)] = true;
			dataset[(3, 3)] = true;

			dataset
		},

		result: [
			([0, 2].iter().copied().into(), 2),
			([0, 3].iter().copied().into(), 2),
			([1, 2].iter().copied().into(), 2),
			([0].iter().copied().into(), 3),
			([2].iter().copied().into(), 5),
			([].iter().copied().into(), 6),
		]
			.iter()
			.cloned()
			.collect(),

		min_sup: 2,
	};
}