Udvidet returret til d. 31. januar 2025

Association Rules Optimization using Particle Swarm Optimization Algor

Association Rules Optimization using Particle Swarm Optimization Algoraf Manuj Mishra
Bag om Association Rules Optimization using Particle Swarm Optimization Algor

In data mining, Association rule mining is one of the popular and simple method to find the frequent item sets from a large data set. While generating frequent item sets from a large data set using association rule mining, computer takes too much time. This can be improved by using artificial bee colony algorithm (ABC). The Artificial bee colony algorithm is an optimization algorithm based on the foraging behavior of artificial honey bees. In this paper, artificial bee colony algorithm is used to generate high quality association rules for finding frequent item sets from large data sets.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9786139898336
  • Indbinding:
  • Paperback
  • Sideantal:
  • 60
  • Udgivet:
  • 26. september 2018
  • Størrelse:
  • 150x4x220 mm.
  • Vægt:
  • 107 g.
  • BLACK WEEK
Leveringstid: 2-3 uger
Forventet levering: 14. december 2024

Beskrivelse af Association Rules Optimization using Particle Swarm Optimization Algor

In data mining, Association rule mining is one of the popular and simple method to find the frequent item sets from a large data set. While generating frequent item sets from a large data set using association rule mining, computer takes too much time. This can be improved by using artificial bee colony algorithm (ABC). The Artificial bee colony algorithm is an optimization algorithm based on the foraging behavior of artificial honey bees. In this paper, artificial bee colony algorithm is used to generate high quality association rules for finding frequent item sets from large data sets.

Brugerbedømmelser af Association Rules Optimization using Particle Swarm Optimization Algor



Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.