2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)
DOI: 10.1109/icsmc.2004.1400923
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of association rule mining using improved genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0
2

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 46 publications
(24 citation statements)
references
References 3 publications
0
20
0
2
Order By: Relevance
“…An itemset X ⊆ J is frequent if at least a fraction sprt() of the transaction in a database contains X. Frequent itemsets are important because they are the building blocks to obtain association rules with a given confidence and support [1][2].…”
Section: Association Rulementioning
confidence: 99%
See 2 more Smart Citations
“…An itemset X ⊆ J is frequent if at least a fraction sprt() of the transaction in a database contains X. Frequent itemsets are important because they are the building blocks to obtain association rules with a given confidence and support [1][2].…”
Section: Association Rulementioning
confidence: 99%
“…Each instance (world) is associated with the probability that the world is "true". The probabilities reflect the probability distribution of all possible database instances.The approach proposed was the first approach able to solve probabilistic queries efficiently under tuple independency by means of dynamic programming techniques [1][2] and [4].…”
Section: Related Work On Frequent Itemset Miningmentioning
confidence: 99%
See 1 more Smart Citation
“…Manish Saggar et al [12] used the Genetic Algorithms to optimize the rules generated by Association Rule Mining(Apriori method). In general, the rule generated by Association Rule Mining technique do not consider the negative occurrences of attributes in them, but by applying Genetic Algorithms (GAs) over these rules, the system can predict the rules which contains negative attributes.…”
Section: International Journal Of Computer Applications (0975 -8887) mentioning
confidence: 99%
“…Selecting better rules from them may be another problem. After detecting the frequent item-sets in the first phase, the second phase generates the rules using another user defined parameter called minimum confidence [2] and [3][4][5].…”
Section: Introductionmentioning
confidence: 99%