1. Repository Universitas Mulawarman
  2. Akuntabel
  3. J - Computer Sciences and Information Technology
Please use this identifier to cite or link to this item: http://repository.unmul.ac.id/handle/123456789/3898
Title: Time Complexity Of A Priori And Evolutionary Algorithm For Numerical Association Rule Mining Optimization
Authors: Tahyudin, Imam
Haviluddin, Haviluddin
Nambo, Hidetaka
Keywords: time complexity; numerical association rule mining; a priori; evolutionary algorithm
Issue Date: 8-Nov-2019
Publisher: IJST
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.
URI: http://repository.unmul.ac.id/handle/123456789/3898
ISSN: 2277-8616
Appears in Collections:J - Computer Sciences and Information Technology

Files in This Item:
File Description SizeFormat 
5. IJSTRvol8i11-Time-Complexity-Of-A-Priori-And-Evolutionary-Algorithm-For-Numerical-Association-Rule-Mining-Optimization.pdf372.67 kBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.