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

mod dataset;
mod itemset;
mod datasets;

use std::{
	collections::HashSet,
	fmt::Debug,
	hash::Hash
};


use crate::{DataSet, Support};
use self::datasets::TestDataSet;


/// Test the sequential implementation with the given test dataset.
fn test_sequential<D>(dataset: &TestDataSet<D>)
where
	D: DataSet,
	D::ItemSet: Debug + Eq + Hash,
	for<'b> &'b D::ItemSet: IntoIterator<Item = usize>,
{
	let result: HashSet<(D::ItemSet, Support)> = crate::sequential
		::closed(&dataset.dataset, dataset.min_sup)
		.into_vec() // Boxed slice has no owned iterator.
		.into_iter()
		.collect();

	assert_eq!(result, dataset.result)
}


/// Test the parallel implementation with the given test dataset.
fn test_parallel<D>(dataset: &TestDataSet<D>)
where
	D: DataSet + Sync,
	D::ItemSet: Debug + Eq + Hash + Send + Sync,
	for<'b> &'b D::ItemSet: IntoIterator<Item = usize>,
{
	let result: HashSet<(D::ItemSet, Support)> = crate::parallel
		::closed(&dataset.dataset, dataset.min_sup)
		.into_vec() // Boxed slice has no owned iterator.
		.into_iter()
		.collect();

	assert_eq!(result, dataset.result)
}


#[test]
fn test_toy() {
	let dataset = &datasets::TOY;

	test_sequential(dataset);
	test_parallel(dataset);
}