Struct FPGrowth

pub struct FPGrowth<T> { /* private fields */ }

FPGrowth<T> represents an algorithm instance, it should include the transactions input and minimum support value as the initial config. Once it is created, you could run FPGrowth::find_frequent_patterns() to start the frequent pattern mining.

Implementations

impl<T: ItemType> FPGrowth<T>

pub fn new(transactions: Vec<Vec<T>>, minimum_support: usize) -> FPGrowth<T>

Create a FP-Growth algorithm instance with the given transactions and minimum_support.

Examples found in repository

examples/example_usage.rs (line 18)

fn main() {
    let transactions = vec![
        vec!["e", "c", "a", "b", "f", "h"],
        vec!["a", "c", "g"],
        vec!["e"],
        vec!["e", "c", "a", "g", "d"],
        vec!["a", "c", "e", "g"],
        vec!["e"],
        vec!["a", "c", "e", "b", "f"],
        vec!["a", "c", "d"],
        vec!["g", "c", "e", "a"],
        vec!["a", "c", "e", "g"],
        vec!["i"],
    ];
    let minimum_support = 2;
    let fp_growth_str = FPGrowth::<&str>::new(transactions, minimum_support);

    let result = fp_growth_str.find_frequent_patterns();
    println!("The number of results: {}", result.frequent_patterns_num());
    for (frequent_pattern, support) in result.frequent_patterns().iter() {
        println!("{:?} {}", frequent_pattern, support);
    }
}

pub fn find_frequent_patterns(&self) -> FPResult<T>

Find frequent patterns in the given transactions using FP-Growth.

Examples found in repository

examples/example_usage.rs (line 20)

fn main() {
    let transactions = vec![
        vec!["e", "c", "a", "b", "f", "h"],
        vec!["a", "c", "g"],
        vec!["e"],
        vec!["e", "c", "a", "g", "d"],
        vec!["a", "c", "e", "g"],
        vec!["e"],
        vec!["a", "c", "e", "b", "f"],
        vec!["a", "c", "d"],
        vec!["g", "c", "e", "a"],
        vec!["a", "c", "e", "g"],
        vec!["i"],
    ];
    let minimum_support = 2;
    let fp_growth_str = FPGrowth::<&str>::new(transactions, minimum_support);

    let result = fp_growth_str.find_frequent_patterns();
    println!("The number of results: {}", result.frequent_patterns_num());
    for (frequent_pattern, support) in result.frequent_patterns().iter() {
        println!("{:?} {}", frequent_pattern, support);
    }
}