• DocumentCode
    3220695
  • Title

    Association rule mining using multi-objective evolutionary algorithms: Strengths and challenges

  • Author

    Anand, Rajul ; Vaid, Abhishek ; Singh, Pramod Kumar

  • Author_Institution
    ABV-IIITM, Gwalior, India
  • fYear
    2009
  • fDate
    9-11 Dec. 2009
  • Firstpage
    385
  • Lastpage
    390
  • Abstract
    Association rule mining based on support and confidence generates a large number of rules. However, post analysis is required to obtain interesting rules as many of the generated rules are useless. We pose mining association rules as multi-objective optimization problem where objective functions are rule interestingness measures and use NSGA-II, a well known multi-objective evolutionary algorithm (MOEA), to solve the problem. We compare our results vis-a¿-vis results obtained by a traditional rule mining algorithm - Apriori and contrary to the other works reported in the literature clearly highlight the quality of obtained rules and challenges while using MOEAs for mining association rules. Though none of the algorithm emerged as clear winner, some of the rules obtained by MOEA could not be obtained by traditional data mining algorithm. We treat the whole process from data mining perspective and discuss the pitfalls responsible for relatively poor performance of the MOEA which has been shown as a good performer in other paradigms.
  • Keywords
    data mining; evolutionary computation; NSGA-II; association rule mining; data mining; multiobjective evolutionary algorithm; Association rules; Data mining; Decision making; Evolutionary computation; Frequency; Genetic algorithms; Itemsets; Iterative algorithms; Noise generators; Transaction databases; Association Rule Mining; Genetic Algorithms; Interestingness measures; Multi-objective Optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on
  • Conference_Location
    Coimbatore
  • Print_ISBN
    978-1-4244-5053-4
  • Type

    conf

  • DOI
    10.1109/NABIC.2009.5393878
  • Filename
    5393878