item.h

FP-GROWTH算法实现数据挖掘中的关联规则

/*----------------------------------------------------------------------
  File    : item.h
  Contents: itemset management
    Update  : 12/3/2005
  ----------------------------------------------------------------------*/
#include <set>
using namespace std;

class Item;

class Item_
{
 public:
  Item_();
  ~Item_();
  int id;
  int supp;
  set<Item> *children;
  Item_ *parent;
  Item_ *nodelink;
};
class Item
{
 public:
  Item(int s, Item_ *p);
  Item::Item(const Item& i);
  ~Item();
  int getId() const {return item->id;}  
  int getSupport() const {return item->supp;}
  set<Item> *getChildren() const {return item->children;}
  set<Item> *makeChildren() const;
  Item_ *getItem() const {return item;}
  Item_ *getNext() const {return item->nodelink;}
  void setNext(Item_ *i) const {item->nodelink = i;}
  bool isFrequent(int ms) const {return item->supp >= ms;}
  void Increment(int i=1) const {item->supp += i;}
  void removeChildren() const;
  bool operator< (const Item &i) const {return getId() < i.getId();}
 private:
  Item_ *item;
};