2015
DOI: 10.1016/j.knosys.2015.07.016
|View full text |Cite
|
Sign up to set email alerts
|

Rare-PEARs: A new multi objective evolutionary algorithm to mine rare and non-redundant quantitative association rules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(6 citation statements)
references
References 54 publications
0
5
0
1
Order By: Relevance
“…At the beginning of the iteration, it is often expected that the evolution can be accelerated. Hence, relatively high crossover probability and low variation probability are required [ 19 , 20 ]. As the number of iterations increases, the similarity between individuals of the population will become higher, which can cause the genetic algorithm to fall into the local solution.…”
Section: Methodology and Algorithmmentioning
confidence: 99%
“…At the beginning of the iteration, it is often expected that the evolution can be accelerated. Hence, relatively high crossover probability and low variation probability are required [ 19 , 20 ]. As the number of iterations increases, the similarity between individuals of the population will become higher, which can cause the genetic algorithm to fall into the local solution.…”
Section: Methodology and Algorithmmentioning
confidence: 99%
“…Yöntemin diğer yöntemlerden ayrılan özelliği, iki önemli amaç olarak ilginçliğe ve gereksizliğe dikkat etmiş olmalarıdır. Rare-PEAR algoritması ilginç, nadir veya nadir ve ilginç kurallar bulmuştur [15]. Kahvazadeh ve Abadeh, nicel verilerde birliktelik kurallarını çıkarmak için MOCANAR isimli meta sezgisel bir algoritma önermişlerdir.…”
Section: öLçütler (Measures)unclassified
“…Problem solving in numerical data association analysis is generally performed using several approaches, including discretization, distribution and optimization. That the discretization is performed using partitioning and combining, clustering [11], [12] and fuzzy [8] methods, and the optimization approach is solved using the optimized association rule [13], differential evolution [14], GA [3], [7] and PSO [4], [15] as shown in Figure 1.…”
Section: Issn: 2088-8708mentioning
confidence: 99%