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
Copy file name to clipboardExpand all lines: src/algorithms/sequentialcovering.jl
-4Lines changed: 0 additions & 4 deletions
Original file line number
Diff line number
Diff line change
@@ -47,8 +47,6 @@ This involves iteratively learning a single rule, and removing the newly covered
47
47
* `default_alphabet::Union{Nothing,AbstractAlphabet}=nothing` offers the flexibility to define a tailored alphabet upon which antecedents generation occurs.
48
48
* `discretizedomain::Bool=false`: discretizes continuous variables by identifying optimal cut points
49
49
* `significance_alpha::Union{Real,Nothing}=0.0` is the significant alpha
50
-
* `min_rule_coverage::Union{Nothing,Integer} = 1` specifies the minimum number of instances covered by each rule.
51
-
* `max_rule_length::Union{Nothing,Integer} = nothing` specifies the maximum length allowed for a rule in the search algorithm.
52
50
* `max_rulebase_length::Union{Nothing,Integer}` is the maximum length of the rulebase;
53
51
* `suppress_parity_warning::Bool` if `true`, suppresses parity warnings.
54
52
* Any additional keyword argument will be imputed to the `searchmethod`, replacing its original value.
0 commit comments