Frequent/Closed itemset discovery routines. More...
#include <GKlib.h>
Go to the source code of this file.
Classes | |
struct | isparams_t |
Functions | |
void | gk_find_frequent_itemsets (int ntrans, ssize_t *tranptr, int *tranind, int minfreq, int maxfreq, int minlen, int maxlen, void(*process_itemset)(void *stateptr, int nitems, int *itemids, int ntrans, int *transids), void *stateptr) |
void | itemsets_find_frequent_itemsets (isparams_t *params, gk_csr_t *mat, int preflen, int *prefix) |
gk_csr_t * | itemsets_project_matrix (isparams_t *param, gk_csr_t *mat, int cid) |
Frequent/Closed itemset discovery routines.
This file contains the code for finding frequent/closed itemests. These routines are implemented using a call-back mechanism to deal with the discovered itemsets.
$Id: itemsets.c 11075 2011-11-11 22:31:52Z karypis $
Definition in file itemsets.c.
void gk_find_frequent_itemsets | ( | int | ntrans, |
ssize_t * | tranptr, | ||
int * | tranind, | ||
int | minfreq, | ||
int | maxfreq, | ||
int | minlen, | ||
int | maxlen, | ||
void(*)(void *stateptr, int nitems, int *itemids, int ntrans, int *transids) | process_itemset, | ||
void * | stateptr | ||
) |
The entry point of the frequent itemset discovery code
Definition at line 47 of file itemsets.c.
void itemsets_find_frequent_itemsets | ( | isparams_t * | params, |
gk_csr_t * | mat, | ||
int | preflen, | ||
int * | prefix | ||
) |
Prototypes for this module
The recursive routine for DFS-based frequent pattern discovery
Definition at line 95 of file itemsets.c.
gk_csr_t * itemsets_project_matrix | ( | isparams_t * | params, |
gk_csr_t * | mat, | ||
int | cid | ||
) |
This function projects a matrix w.r.t. to a particular column. It performs the following steps:
Definition at line 128 of file itemsets.c.