Time Complexity Of A Priori And Evolutionary Algorithm For Numerical Association Rule Mining Optimization
| dc.contributor.author | Tahyudin, Imam | |
| dc.contributor.author | Haviluddin, Haviluddin | |
| dc.contributor.author | Nambo, Hidetaka | |
| dc.date.accessioned | 2020-03-10T00:30:57Z | |
| dc.date.available | 2020-03-10T00:30:57Z | |
| dc.date.issued | 2019-11-08 | |
| dc.identifier.issn | 2277-8616 | |
| dc.identifier.uri | http://repository.unmul.ac.id/handle/123456789/3898 | |
| dc.description.abstract | Some of the solutions for solving numerical Association rule mining problem are by discretization and optimization methods. The popular algorithms of optimization are A priori algorithms, Genetic algorithms (GA) and Particle swarm optimization (PSO). This research has aim to study time complexity of those optimization algorithms. The results show that the time complexity of evolutionary algorithms such as GA and PSO are faster than the time complexity of A priori algorithms. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | IJST | en_US |
| dc.subject | time complexity; numerical association rule mining; a priori; evolutionary algorithm | en_US |
| dc.title | Time Complexity Of A Priori And Evolutionary Algorithm For Numerical Association Rule Mining Optimization | en_US |
| dc.type | Article | en_US |