#include "StringMap.h"
#include "SeqBitmap.h"
#include "TreeNode.h"
#include "DatasetInfo.h"
#include "Stats.h"
#include <math.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <iostream>
Include dependency graph for Spam.cpp:
Go to the source code of this file.
Functions | |
DatasetInfo * | ReadDataset (bool isBinaryFile, bool isStringFile, char *filename, double minSupPercent, StringMap *&custStrMap, StringMap *&transStrMap, StringMap *&itemStrMap) |
It reads the input file and finds the frequent-1 itemsets. | |
int | compare (const void *arg1, const void *arg2) |
void | LogStdoutSequence (const int c) |
void | LogFileSequence (const int c) |
void | LogSequence (const int c) |
void | CreateOrBitmap (SeqBitmap **f1, int *indexList, int indexLength, SeqBitmap *&orBitmap) |
OR's all of the frequent-1 itemset bitmaps together This is used to create the refBitmap for bitmap compression. | |
void | Compress (SeqBitmap *refBitmap, SeqBitmap *tempAndBitmap, SeqBitmap *&returnBitmap, SeqBitmap **f1, SeqBitmap **newF1, int *indexList, int indexLength) |
Perform compression on a sequence bitmap. | |
void | FindSequentialPatterns (TreeNode *curNode) |
A recursive call that goes down the search lattice to find sequential patterns. | |
void | StartMining (DatasetInfo *info) |
Start the mining algorithm by generating the initial TreeNode to start recursing from. | |
void | PrintError () |
int | main (int argc, char **argv) |
Variables | |
ofstream | summaryFile |
int | minSup |
min sup as a transaction count | |
TreeNode ** | nodeBuff |
node buffer | |
int * | tempIndexList |
stored the result of combining i-list and s-list | |
bool * | indexExists |
for combining i-list and s-list | |
ofstream | outFile |
int ** | sequentialPatterns |
int * | elementSize |
int | sequenceLength |
bool | outputSeq |
bool | stdoutSpecified |
StringMap * | custStrMap |
StringMap * | transStrMap |
StringMap * | itemStrMap |
bool | isStringFile |
int | minCompSize |
no compression will be done if the bitmap size (_sizeShort) is small than this | |
double | emptySpaceRatio |
the ratio at which we compress the bitmaps | |
int | compLevel |
Used to test whether compression should be done at every level. | |
int | totalCust |
int | testCount = 0 |
int | numCompress = 0 |
int | globalLevel |