• DocumentCode
    605857
  • Title

    Applying correlation threshold on Apriori algorithm

  • Author

    Anand, H.S. ; Vinodchandra, S.S.

  • Author_Institution
    Dept. of Comput. Sci., Coll. of Eng., Trivandrum, India
  • fYear
    2013
  • fDate
    25-26 March 2013
  • Firstpage
    432
  • Lastpage
    435
  • Abstract
    Ever growing size of information and database has always demanded the scientific world for very efficient rule mining algorithm. This paper gives an extension to the Apriori algorithm, a classical rule mining algorithm. Apriori finds its application in areas of data mining, finding association between attributes and in prediction systems. Even though Apriori suits in various applications it possesses various disadvantages. To increase the efficiency of the present Apriori algorithm a method for incorporating a new correlation factor (threshold) is being introduced. First part of the paper provides a quick summary of basic Apriori algorithm and second half details the implementation of correlation threshold. Performance of the redesigned algorithm is evaluated and is compared with the traditional Apriori algorithm. The evaluation shows a peak improvement in the mining result. We reduce the time complexity of the newly designed algorithm into O (n). In an application level, qualitative content analysis of water was also conducted to affirm the results.
  • Keywords
    data mining; database management systems; apriori algorithm; correlation threshold; data mining; database; qualitative content analysis; rule mining algorithm; water; Algorithm design and analysis; Correlation; Data mining; Itemsets; Prediction algorithms; Time complexity; apriori algorithm; association rule mining; correlation threshold; datamining; itemsets; machine learning algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Emerging Trends in Computing, Communication and Nanotechnology (ICE-CCN), 2013 International Conference on
  • Conference_Location
    Tirunelveli
  • Print_ISBN
    978-1-4673-5037-2
  • Type

    conf

  • DOI
    10.1109/ICE-CCN.2013.6528537
  • Filename
    6528537