Uses of Class
wpi.associations.arminer.ARMinerItemset

Packages that use ARMinerItemset
wpi.associations.arminer   
 

Uses of ARMinerItemset in wpi.associations.arminer
 

Fields in wpi.associations.arminer declared as ARMinerItemset
private  ARMinerItemset[] DBReader.attribute_itemset
           
private  ARMinerItemset AprioriRules.is_in_antecedent
           
private  ARMinerItemset AprioriRules.is_in_consequent
           
private  ARMinerItemset AprioriRules.is_ignored
           
 

Methods in wpi.associations.arminer that return ARMinerItemset
 ARMinerItemset DBReader.getFirstRow()
          Function to return the first instance as an ARMinerItemset
 ARMinerItemset DBReader.getNextRow()
          Function to return the instance at current_instance as an ARMinerItemset
 ARMinerItemset DBReader.getAttributeItemset(int i)
          Function to return an ARMinerItemset containing all items in a particular attribute.
 ARMinerItemset DBCacheReader.getFirstItemset()
          Return the first itemset from cache.
 ARMinerItemset DBCacheReader.getNextItemset()
          Return next itemset from cache.
 ARMinerItemset ARMinerItemset.subtract(ARMinerItemset itemset)
          Return a new ARMinerItemset that contains only those items that do not appear in itemset.
 ARMinerItemset ARMinerItemset.add(ARMinerItemset itemset)
          Return a new ARMinerItemset that contains all those items that appear in this ARMinerItemset and in itemset.
 ARMinerItemset ARMinerItemset.combineWith(ARMinerItemset itemset)
          Combine two itemsets into a new one that will contain all the items in the first itemset plus the last item in the second itemset.
 

Methods in wpi.associations.arminer with parameters of type ARMinerItemset
 void SET.insert(ARMinerItemset itemset)
          Insert a new itemset in the SET.
 float SET.getSupport(ARMinerItemset itemset)
          Return the support for a given itemset.
private  void SET.traverseGatherLeaves(SET.HashNode node, ARMinerItemset itemset, java.util.Vector vector)
           
private  void SET.traverseGatherAll(SET.HashNode node, ARMinerItemset itemset, java.util.Vector vector)
           
 void HashTree.update(ARMinerItemset row)
          Update the weights of all indexed Itemsets that are included in row
private  void HashTree.update(HashTree.Node node, ARMinerItemset row, int index, int level)
           
 void HashTree.update(ARMinerItemset row, long[][] counts)
          Update the weights of all indexed Itemsets that are included in row and also update the matrix counts
private  void HashTree.update(HashTree.Node node, ARMinerItemset row, int index, long[][] counts, int level)
           
 long HashTree.countFrequentSubsets(ARMinerItemset itemset, long minWeight)
          Count how many frequent Itemsets (frequent = having weight greater than a specified minimum weight) are included in itemset
private  void HashTree.countFrequentSubsets(HashTree.Node node, ARMinerItemset itemset, int index, long minWeight, int level)
           
 long HashTree.countSubsets(ARMinerItemset itemset)
          Count how many Itemsets are included in itemset
private  void HashTree.countSubsets(HashTree.Node node, ARMinerItemset itemset, int index, int level)
           
 void HashTree.checkLargeness(ARMinerItemset itemset)
          Verifies if any of the indexed Itemsets is not large by checking whether they're included in the frequent itemset itemset.
private  void HashTree.checkLargeness(HashTree.Node node, ARMinerItemset itemset, int index, int level)
           
 void DBWriter.addRow(ARMinerItemset itemset)
          Add a new row to the database.
 void DBCacheWriter.writeItemset(ARMinerItemset is)
          Write an itemset to the cache.
 java.util.Vector AssociationsFinder.findAssociations(DBCacheReader cacheReader, float minSupport, float minConfidence, ARMinerItemset inAntecedent, ARMinerItemset inConsequent, ARMinerItemset ignored, int maxAntecedent, int minConsequent)
          Find association rules in a database, given the set of frequent itemsets and a set of restrictions.
 boolean ARMinerItemset.doesIntersect(ARMinerItemset itemset)
          Return true if this itemset has items in common with itemset.
 ARMinerItemset ARMinerItemset.subtract(ARMinerItemset itemset)
          Return a new ARMinerItemset that contains only those items that do not appear in itemset.
 ARMinerItemset ARMinerItemset.add(ARMinerItemset itemset)
          Return a new ARMinerItemset that contains all those items that appear in this ARMinerItemset and in itemset.
 boolean ARMinerItemset.isEqualTo(ARMinerItemset itemset)
          Checks equality with a given itemset.
 boolean ARMinerItemset.isIncludedIn(ARMinerItemset itemset)
          Checks inclusion in a given itemset.
 boolean ARMinerItemset.canCombineWith(ARMinerItemset itemset)
          Check whether two itemsets can be combined.
 ARMinerItemset ARMinerItemset.combineWith(ARMinerItemset itemset)
          Combine two itemsets into a new one that will contain all the items in the first itemset plus the last item in the second itemset.
private  void AprioriRules.ap_genrules(ARMinerItemset is_frequent, java.util.Vector consequents)
           
 java.util.Vector AprioriRules.findAssociations(DBCacheReader cacheReader, float minSupport, float minConfidence, ARMinerItemset inAntecedent, ARMinerItemset inConsequent, ARMinerItemset ignored, int maxAntecedent, int minConsequent)
          Find association rules in a database, given the set of frequent itemsets and a set of restrictions.
private  void AprioriRules.ap_genrules_constraint(ARMinerItemset is_frequent, java.util.Vector consequents, java.util.Vector antecedentAttributes, java.util.Vector consequentAttributes)
           
private  void AprioriRules.ap_genrules_constraint(ARMinerItemset is_frequent, java.util.Vector consequents)
           
 

Constructors in wpi.associations.arminer with parameters of type ARMinerItemset
AssociationRule(ARMinerItemset antecedent, ARMinerItemset consequent, float support, float confidence)
          Creates a new association rule.
ARMinerItemset(ARMinerItemset itemset)
          Create a new itemset by copying a given one.