| Biorithm
    1.1
    | 
This class takes an input stream of a matrix data file and analyzes the the independence of the columns It uses the lattice class to only count the "all positive" bitpatterns. More...
#include <TopKMiner.h>
 
  
 | Public Member Functions | |
| TopKMiner (float balance=0.5, float support=1.0, unsigned int k=1, unsigned int size=100, unsigned int buffer_size=1000, bool positive=false, BinaryMatrix *tm=NULL, int mode=MODE_TOPK_NULL) | |
| TopKMiner (const TopKMiner &src) | |
| virtual | ~TopKMiner () | 
| virtual TopKMiner & | operator= (const TopKMiner &rhs) | 
| Protected Member Functions | |
| virtual void | analyzeHelper () | 
| virtual unsigned int | analyzeLevel (unsigned int level) | 
| virtual void | handlePrinting (unsigned int level) | 
| virtual void | analyzeTopKNull () | 
| virtual void | analyzeTopKNormal () | 
| Protected Attributes | |
| BSEvaluator * | bse | 
| unsigned int | k | 
| unsigned int | size | 
| int | mode | 
This class takes an input stream of a matrix data file and analyzes the the independence of the columns It uses the lattice class to only count the "all positive" bitpatterns.
| TopKMiner::TopKMiner | ( | float | balance = 0.5, | 
| float | support = 1.0, | ||
| unsigned int | k = 1, | ||
| unsigned int | size = 100, | ||
| unsigned int | buffer_size = 1000, | ||
| bool | positive = false, | ||
| BinaryMatrix * | bm = NULL, | ||
| int | mode = MODE_TOPK_NULL | ||
| ) | 
The Miner that uses the lattice data structure this lets it only count the positive itemsets
------------------------------- Parameters ------------------------------- float balance The minimum fraction of rows that must comprise a bitpattern float support The fraction of bitpatterns that have to succeed at each level unsigned int buffer_size the amount of combinations allowed to sit in the queue at once
| TopKMiner::TopKMiner | ( | const TopKMiner & | src | ) | 
| TopKMiner::~TopKMiner | ( | ) |  [virtual] | 
Destructor
| void TopKMiner::analyzeHelper | ( | ) |  [protected, virtual] | 
Analyzes the matrix, one level at a time
--------------------------------- Return --------------------------------- An error message
Implements Miner.
| unsigned int TopKMiner::analyzeLevel | ( | unsigned int | level | ) |  [protected, virtual] | 
Analyzes a single level
------------------------------- Parameters ------------------------------- unsigned int level The current level
--------------------------------- Return --------------------------------- Whether or not we should continue (whether or not any matches were found)
| void TopKMiner::analyzeTopKNormal | ( | ) |  [protected, virtual] | 
Analyzes with paying attention to how many are at each level
| void TopKMiner::analyzeTopKNull | ( | ) |  [protected, virtual] | 
Analyzes without paying attention to how many are at each level
| void TopKMiner::handlePrinting | ( | unsigned int | prevlevel | ) |  [protected, virtual] | 
Handle printing
------------------------------- Parameters ------------------------------- unsigned int prevlevel The previous level
 1.7.6.1
 1.7.6.1