• DocumentCode
    596586
  • Title

    Sampling learning based association rules mining algorithm

  • Author

    Xiaoying Xie ; Ying Zhang ; Yingtao Xu

  • Author_Institution
    Sch. of Stat. & Math., Zhejiang Gongshang Univ., Hangzhou, China
  • fYear
    2012
  • fDate
    18-20 Oct. 2012
  • Firstpage
    281
  • Lastpage
    283
  • Abstract
    The view that sampling technology could improve the efficiency of data mining significantly has been widely accepted by the research community. The key to sample in data mining is how to design a sampling strategy to get a favorable sample to execute the mining algorithm at minor cost of accuracy. In this article we propose a progressive sampling algorithm based on confusion matrix to determine the optimal sample size. The novelty of this algorithm is that it can find the appropriate sample very quickly and very accurately without executing the data mining.
  • Keywords
    data mining; learning (artificial intelligence); matrix algebra; sampling methods; confusion matrix-based progressive sampling algorithm; optimal sample size; research community; sampling learning-based association rules mining algorithm; sampling technology; Accuracy; Algorithm design and analysis; Approximation algorithms; Association rules; Databases; Educational institutions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advanced Computational Intelligence (ICACI), 2012 IEEE Fifth International Conference on
  • Conference_Location
    Nanjing
  • Print_ISBN
    978-1-4673-1743-6
  • Type

    conf

  • DOI
    10.1109/ICACI.2012.6463168
  • Filename
    6463168