• DocumentCode
    2159214
  • Title

    Discovering interesting rules from biological data using parallel genetic algorithm

  • Author

    Dash, S.R. ; Dehuri, S. ; Rayaguru, S.

  • Author_Institution
    Sch. of Comput. Applic., KIIT Univ., Bhubaneswar, India
  • fYear
    2013
  • fDate
    22-23 Feb. 2013
  • Firstpage
    631
  • Lastpage
    636
  • Abstract
    In this paper, a parallel genetic based association rule mining method is proposed to discover interesting rules from a large biological database. Apriori algorithms and its variants for association rule mining rely on two user specified threshold parameters such as minimum support and minimum confidence which is obviously an issue to be resolved. In addition, there are other issues like large search space and local optimality attracts many researchers to use heuristic mechanism. In the presence of large biological databases and with an aim to circumvent these problems, genetic algorithm may be taken as a suitable tool, but its computational cost is the main bottle-neck. Therefore, we choose parallel genetic algorithms to get relief from the pain of computational cost. The experimental result is promising and encouraging to do further research especially in the domain of biological science.
  • Keywords
    bioinformatics; data mining; genetic algorithms; parallel algorithms; search problems; apriori algorithms; biological data; biological science; computational cost; heuristic mechanism; large biological database; local optimality; parallel genetic algorithm; parallel genetic based association rule mining method; rule discovery; search space; threshold parameters; Association rules; Biological cells; Databases; Genetic algorithms; Sociology; Statistics; Apriori algorithm; Association rule mining; Data mining; Genetic algorithm; Parallel genetic algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advance Computing Conference (IACC), 2013 IEEE 3rd International
  • Conference_Location
    Ghaziabad
  • Print_ISBN
    978-1-4673-4527-9
  • Type

    conf

  • DOI
    10.1109/IAdCC.2013.6514300
  • Filename
    6514300