2019
DOI: 10.3233/fi-2019-1791
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Heuristics for Optimization of Association Rules

Abstract: In this paper, seven greedy heuristics for construction of association rules are compared from the point of view of the length and coverage of constructed rules. The obtained rules are compared also with optimal ones constructed by dynamic programming algorithms. The average relative difference between length of rules constructed by the best heuristic and minimum length of rules is at most 4%. The same situation is with coverage.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 22 publications
0
7
0
Order By: Relevance
“…Normally, pathology cases are seriously scarce in clinical practice. While the traditional Apriori algorithms [ 21 , 22 ] in ARA can not achieve the infrequent association rules and the improved method based on increasing the weight of minority would produce biased results as well [ 6 , 23 ]. Therefore we designed an algorithm of forward-stepwise-selection association rule to maximize the accuracy of association rules.…”
Section: Methodsmentioning
confidence: 99%
“…Normally, pathology cases are seriously scarce in clinical practice. While the traditional Apriori algorithms [ 21 , 22 ] in ARA can not achieve the infrequent association rules and the improved method based on increasing the weight of minority would produce biased results as well [ 6 , 23 ]. Therefore we designed an algorithm of forward-stepwise-selection association rule to maximize the accuracy of association rules.…”
Section: Methodsmentioning
confidence: 99%
“…e knowledge point set composed of knowledge points Q 1 and Q 2 is obtained by formula (8), and the similarity between them is calculated by formula (8):…”
Section: Association Between Learning Resources and Knowledge Pointsmentioning
confidence: 99%
“…This paper is mainly based on the theory of association rules. Association rules can not only reflect whether there is association between resources, but also describe the degree of association between resources [ 1 , 8 ]. Understand the relationship between different educational resources, clarify the attributes of various types of resources, and then mine the resources to collect online educational resources.…”
Section: Personalized Recommendation Algorithm For Online Education R...mentioning
confidence: 99%
“…is very difficult and complicated. Different methods can be used to solve it, mainly heuristic methods [27,28]. We have used the imbuilt into AnyLogic® the OptQuest optimizer, which is a combination of heuristics, neural networks and mathematical optimization.…”
Section: Advances In Economics Business and Management Research Volmentioning
confidence: 99%