Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.itemsetmining |
Algorithms for frequent itemset mining such as APRIORI.
|
de.lmu.ifi.dbs.elki.algorithm.itemsetmining.associationrules |
Association rule mining.
|
de.lmu.ifi.dbs.elki.result |
Result types, representation and handling
|
Modifier and Type | Class and Description |
---|---|
class |
DenseItemset
APRIORI itemset, dense representation.
|
class |
OneItemset
Frequent itemset with one element.
|
class |
SmallDenseItemset
Frequent itemset, dense representation for up to 64 items.
|
class |
SparseItemset
Frequent itemset, sparse representation.
|
Modifier and Type | Method and Description |
---|---|
protected java.util.List<Itemset> |
APRIORI.aprioriGenerate(java.util.List<? extends Itemset> supported,
int length,
int dim)
Prunes a given set of candidates to keep only those BitSets where all
subsets of bits flipping one bit are frequent already.
|
protected java.util.List<? extends Itemset> |
APRIORI.frequentItemsets(java.util.List<? extends Itemset> candidates,
Relation<BitVector> relation,
int needed,
DBIDs ids,
ArrayModifiableDBIDs survivors,
int length)
Returns the frequent BitSets out of the given BitSets with respect to the
given database.
|
Modifier and Type | Method and Description |
---|---|
protected static int |
Itemset.compareLexicographical(Itemset a,
Itemset o)
Robust compare using the iterators, lexicographical only!
|
int |
Itemset.compareTo(Itemset o) |
int |
OneItemset.compareTo(Itemset o) |
int |
DenseItemset.compareTo(Itemset o) |
int |
SparseItemset.compareTo(Itemset o) |
int |
SmallDenseItemset.compareTo(Itemset o) |
static long[] |
Itemset.toBitset(Itemset i,
long[] bits)
Get the items.
|
Modifier and Type | Method and Description |
---|---|
protected java.util.List<Itemset> |
APRIORI.aprioriGenerate(java.util.List<? extends Itemset> supported,
int length,
int dim)
Prunes a given set of candidates to keep only those BitSets where all
subsets of bits flipping one bit are frequent already.
|
private java.lang.StringBuilder |
APRIORI.debugDumpCandidates(java.lang.StringBuilder msg,
java.util.List<? extends Itemset> candidates,
VectorFieldTypeInformation<BitVector> meta)
Debug method: output all itemsets.
|
private void |
Eclat.extractItemsets(DBIDs[] idx,
int start,
int minsupp,
java.util.List<Itemset> solution) |
private void |
Eclat.extractItemsets(DBIDs iset,
DBIDs[] idx,
int[] buf,
int depth,
int start,
int minsupp,
java.util.List<Itemset> solution) |
protected java.util.List<? extends Itemset> |
APRIORI.frequentItemsets(java.util.List<? extends Itemset> candidates,
Relation<BitVector> relation,
int needed,
DBIDs ids,
ArrayModifiableDBIDs survivors,
int length)
Returns the frequent BitSets out of the given BitSets with respect to the
given database.
|
Modifier and Type | Class and Description |
---|---|
protected static class |
AssociationRuleGeneration.PartialItemset
Mutable scatch itemset for finding itemsets, based on
SparseItemset . |
Modifier and Type | Field and Description |
---|---|
private Itemset |
AssociationRule.antecedent
Consequent itemset
|
private Itemset |
AssociationRule.consequent
Consequent itemset
|
private Itemset |
AssociationRule.union
Union of consequent and consequent
|
Modifier and Type | Field and Description |
---|---|
(package private) java.util.List<Itemset> |
AssociationRuleGeneration.ItemsetSearcher.itemsets
Itemsets to search.
|
Modifier and Type | Method and Description |
---|---|
Itemset |
AssociationRule.getAntecedent()
Get the antecedent of the rule.
|
Itemset |
AssociationRule.getConsequent()
Get the consequent of the rule.
|
Itemset |
AssociationRule.getUnion()
Get the union of consequent and consequent of the rule.
|
Itemset |
AssociationRuleGeneration.ItemsetSearcher.search(Itemset c)
Find an itemset, using binary search.
|
Modifier and Type | Method and Description |
---|---|
private void |
AssociationRuleGeneration.Instance.processSubsets(Itemset itemset,
int len,
int cur) |
Itemset |
AssociationRuleGeneration.ItemsetSearcher.search(Itemset c)
Find an itemset, using binary search.
|
Constructor and Description |
---|
AssociationRule(Itemset union,
Itemset consequent,
Itemset antecedent,
double measure)
Constructor.
|
Constructor and Description |
---|
ItemsetSearcher(java.util.List<Itemset> itemsets)
Constructor.
|
Modifier and Type | Field and Description |
---|---|
private java.util.List<Itemset> |
FrequentItemsetsResult.itemsets
The supports of all frequent itemsets.
|
Modifier and Type | Method and Description |
---|---|
java.util.List<Itemset> |
FrequentItemsetsResult.getItemsets()
Returns the frequent item sets.
|
Constructor and Description |
---|
FrequentItemsetsResult(java.lang.String name,
java.lang.String shortname,
java.util.List<Itemset> itemsets,
VectorFieldTypeInformation<BitVector> meta,
int total)
Constructor.
|
Copyright © 2019 ELKI Development Team. License information.