You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The following utilities often involve performing some combinatoric trick between [`Itemset`](@ref)s and [`ARule`](@ref)s, and might be useful to avoid reinventing the wheel.
8
-
9
-
## Items and Itemsets
10
-
11
-
```@docs
12
-
combine_items
13
-
grow_prune
14
-
```
15
-
16
7
## Mining Policies
17
8
18
9
It is possible to limit the action of the mining, to force an [`AbstractMiner`](@ref) to only consider a subset of the available data.
To ensure the mining process is *fair* when dealing with modal operators, we must ensure that the miner is compliant with *anchored semantics constraints*.
43
+
44
+
```@docs
45
+
isanchored_miner
46
+
anchored_apriori
47
+
anchored_fpgrowth
48
+
anchored_eclat
49
+
```
50
+
51
+
Each algorithm above is simply a small wrapper around [`anchored_semantics`](@ref):
52
+
53
+
```@docs
54
+
anchored_semantics
55
+
```
56
+
57
+
## Utilities
58
+
59
+
The following utilities often involve performing some combinatoric trick between [`Itemset`](@ref)s and [`ARule`](@ref)s, and might be useful to avoid reinventing the wheel.
0 commit comments