• Contact

  • Newsletter

  • About us

  • Delivery options

  • Prospero Book Market Podcast

  • Association Rules Optimization using ABC Algorithm with Mutation

    Association Rules Optimization using ABC Algorithm with Mutation by Sharma, Pankaj; GERA, UMESH; Gupta, Manish;

      • GET 5% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice EUR 39.90
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        16 548 Ft (15 760 Ft + 5% VAT)
      • Discount 5% (cc. 827 Ft off)
      • Discounted price 15 721 Ft (14 972 Ft + 5% VAT)

    16 548 Ft

    db

    Availability

    Only to order.

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Product details:

    • Publisher LAP Lambert Academic Publishing
    • Date of Publication 1 January 2020
    • Number of Volumes Großformatiges Paperback. Klappenbroschur

    • ISBN 9786202680349
    • Binding Paperback
    • No. of pages76 pages
    • Size 220x150 mm
    • Language English
    • 25

    Categories

    Long description:

    In data mining, association rule mining is one of the popular and simple methods to find frequent itemsets from a large dataset. While generating frequent itemsets from a large dataset using association rule mining, the computer takes too much time. This can be improved by using an 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, an artificial bee colony algorithm with a mutation operator is used to generate high-quality association rules for finding frequent itemsets from large data sets. The mutation operator is used after the scout bee phase in this work. In general, the rule generated by the association rule mining technique does not consider the negative occurrences of attributes in them, but by using an artificial bee colony algorithm (ABC) over these rules the system can predict the rules which contain negative attributes.

    More
    Recently viewed
    previous
    Association Rules Optimization using ABC Algorithm with Mutation

    Design of User Interfaces with a Data Science Approach

    Banubakode, Abhijit Narayanrao; Wahab, Haris Abd; Saad, Mohd Rashid Mohd;(ed.)

    147 651 HUF

    135 839 HUF

    Association Rules Optimization using ABC Algorithm with Mutation

    Association Rules Optimization using ABC Algorithm with Mutation

    Sharma, Pankaj; GERA, UMESH; Gupta, Manish;

    16 548 HUF

    15 721 HUF

    20% %discount
    Association Rules Optimization using ABC Algorithm with Mutation

    Joint Source Channel Coding Using Arithmetic Codes

    Dongsheng, Bi; Sayood, Khalid; Hoffman, Michael

    11 090 HUF

    8 872 HUF

    20% %discount
    Association Rules Optimization using ABC Algorithm with Mutation

    Algorithms and Computation: 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings

    Ng, Kam W.; Raghavan, Prabhakar; Balasubramanian, N.V.; Chin, Francis Y.L.

    44 374 HUF

    35 499 HUF

    next