2013
DOI: 10.1007/s11222-013-9404-6
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation and optimization of frequent, closed and maximal association rule based classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
11
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(12 citation statements)
references
References 26 publications
1
11
0
Order By: Relevance
“…On the contrary, the procedure based on ST produces a more stable variables selection which is not in favor to any specific variables criterion. This is in agreement with the claim in [19,25,26], of ST being fair towards handling of multi-valued variables.…”
Section: Comparing Symmetrical Tau (St) With Mutual Information (Mi)supporting
confidence: 91%
“…On the contrary, the procedure based on ST produces a more stable variables selection which is not in favor to any specific variables criterion. This is in agreement with the claim in [19,25,26], of ST being fair towards handling of multi-valued variables.…”
Section: Comparing Symmetrical Tau (St) With Mutual Information (Mi)supporting
confidence: 91%
“…The experimental results have demonstrated that the proposed framework managed to reduce a large number of non-significant and redundant rules while simultaneously preserving a relatively high level of accuracy. As part of the ongoing works (Shaharanee and Hadzic, 2013), the proposed framework is intended to be used to evaluate the differences between frequent, maximal and close patterns when used for classification tasks, and the effect of the confidence threshold.…”
Section: Discussionmentioning
confidence: 99%
“…Park et al [25] proposed symmetrically balanced cross-entropy by considering the advantages of a symmetric J measure and balanced cross-entropy in association rule evaluation. Shaharani et al [26] presented a systematic evaluation of the rules of association identified on the basis of frequent, closed, and maximum detailed exploration algorithms by combining general measures of data mining and statistical interest and described the appropriate sequence of usage. This method can also remove redundant association rules.…”
Section: Evaluation Methods and Framework Of Association Rulesmentioning
confidence: 99%