2014
DOI: 10.1504/ijbic.2014.064990
|View full text |Cite
|
Sign up to set email alerts
|

Bees swarm optimisation using multiple strategies for association rule mining

Abstract: International audienceAssociation rules mining has been largely studied by the data mining community. ARM aims to extract the interesting rules from any given transactional database. This problem is well known to be time consuming in general. This paper deals with association rules mining algorithms to cope with very large databases and especially for those existing on the web. Many polynomial exact algorithms already proposed in literature have shown their efficiency when dealing with small and medium dataset… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
37
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
4

Relationship

3
5

Authors

Journals

citations
Cited by 65 publications
(41 citation statements)
references
References 19 publications
0
37
0
Order By: Relevance
“…To deal with a huge transactional database in a reasonable time, many metaheuristics have already been applied to ARM. Some of these methods are based on evolutionary algorithms [31,42,48], and other ones on swarm intelligence [11,20,23,34].…”
Section: Introductionmentioning
confidence: 99%
“…To deal with a huge transactional database in a reasonable time, many metaheuristics have already been applied to ARM. Some of these methods are based on evolutionary algorithms [31,42,48], and other ones on swarm intelligence [11,20,23,34].…”
Section: Introductionmentioning
confidence: 99%
“…The results of this approach show that BSO-ARM performs better than all genetic algorithms. As extension to their work, the authors present an amelioration to BSO-ARM in [11], where three strategies to determine the search area of each bee are proposed (modulo, next, syntactic). These improvements yield quality to the rules extracted by BSO-ARM, but unfortunately, the algorithm takes more CPU time.…”
Section: Related Work On Armmentioning
confidence: 99%
“…Furthermore, traditional algorithms developed to solve ARM issue, such as Apriori [1,2], FPgrowth [21], needs a huge processing time to handle big databases. To overcome this drawback and deal with huge databases within reasonable time, studies use intelligent heuristic algorithms, which are already used to solve many NP-Complete problems, to discover association rules such as genetic algorithm [13,20], particle swarm optimization [29,37], Bee swarm algorithm [11] and recently, Bat algorithm [22,23]. Generally, Intelligent algorithms make individuals moving in an n-dimensional space to search the optimum solutions for an n-variable function optimization problem.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…To reduce the computation time of such algorithms, a second category, meta-heuristics based approaches, have been proposed. Examples of such approaches include ARMGA [10] and G3PARM [11] for evolutionary algorithms, PSO-ARM [12], ACO R [13] and BSO-ARM [14] for swarm intelligence. Authors in [15] have presented a survey on swarm intelligence (SI) approaches used for automatic programming.…”
Section: Introductionmentioning
confidence: 99%