Association rule mining with modal logic
New building blocks
ModalAssociationRules.WorldMask
— Typeconst WorldMask = Vector{Int64}
Vector whose i-th position stores how many times a certain MeaningfulnessMeasure
applied on a specific Itemset
s is true on the i-th world of multiple instances.
If a single instance is considered, then this acts as a bit mask.
For example, if we consider 5 instances, each of which containing 3 worlds, then the worlds mask of an itemset could be [5,2,0], meaning that the itemset is always true on the first world of every instance. If we consider the second world, the same itemset is true on it only on two instances. If we consider the third world, then the itemset is never true.
See also Itemset
, MeaningfulnessMeasure
.
ModalAssociationRules.EnhancedItemset
— Typeconst EnhancedItemset = Tuple{Itemset,Int64}
ModalAssociationRules.ConditionalPatternBase
— Typeconst ConditionalPatternBase = Vector{EnhancedItemset}
Collection of EnhancedItemset
. This is useful to manipulate certain data structures when looking for frequent Itemset
s, such as FPTree
.
This is used to implement fpgrowth
algorithm as described here.
See also EnhancedItemset
, fpgrowth
, FPTree
.
Modal logic in action
Missing docstring for Contributors
. Check Documenter's build log for details.
Missing docstring for contributors
. Check Documenter's build log for details.
Missing docstring for contributors!
. Check Documenter's build log for details.
Missing docstring for initpowerups(::typeof(fpgrowth), ::AbstractDataset)
. Check Documenter's build log for details.