-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathACloseMiner.h
70 lines (55 loc) · 2.35 KB
/
ACloseMiner.h
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
Copyright 2010, 2011, 2012 Erich A. Peterson
This file is part of PFCIM.
PFCIM is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
PFCIM is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with PFCIM. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef ACLOSEMINER_H_
#define ACLOSEMINER_H_
#include <vector>
#include <math.h>
#include <iomanip>
#include "Global.h"
#include "Commandline.h"
#include "Database.h"
using namespace std;
//----------------------------------------------------------------------
// Class:
// Mine
//
// Used to mine the actual database for closed frequent probabilistic
// itemsets---using the A-Close algorithm.
//----------------------------------------------------------------------
class ACloseMiner {
unsigned int numObjects; // A copy of the number of objects in the database
unsigned int largestItem; // A copy of the largest item found in the database
vector<itemset> L; // Temporary storage vector for frequent prob. itemsets,
// that might me closed.
vector<itemset> Lprime; // Stores the current iterations frequent prob. itemsets.
vector<itemset> C; // A copy of the unique itemsets in the database.
FP ** P; // A pointer to P, from a Database object.
vector<itemset> Cprime; // Used during the apriori generation step. A place to
// store valid itemset candidates.
unsigned int numFound; // The number of closed prob. freq. itemsets found
double * poiMinsup;
public:
void aprioriGen(vector<itemset> &, bool);
unsigned int ExactPoiBiMaxProbSupp(itemset &, vector<itemset>&);
unsigned int ExactPoiBiMaxProbSupp(itemset &);
unsigned int PoiApproxMaxProbSupp(itemset &, vector<itemset>&);
unsigned int PoiApproxMaxProbSupp(itemset & x);
unsigned int indexPrefixX(vector<itemset> &, itemset&);
Bitmap * aprioriGenPower(unsigned int);
ACloseMiner(Database&);
void StartMining();
unsigned int getNumFound();
};
#endif // ACLOSEMINER_H_