Based on Multiple Minimum Supports of Association Rules in Data Mining
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    This paper analyzed the limitation of the single minimum support degree of association rule mining. We put forward the model of association rule mining based on multiple minimum support. Our work focus on the multiple minimum support MS -Apriori algorithm the basic idea and points out the advantages and disadvantages of the algorithm with practical examples. Our work found that the method of frequent itemsets, and finally points out the shortage of the algorithm and improved algorithm.

    Reference
    Related
    Cited by
Get Citation

晏杰,亓文娟,郭磊,黄书城.基于多最小支持度的关联规则挖掘.计算机系统应用,2014,23(3):237-239,219

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 28,2013
  • Revised:September 22,2013
  • Adopted:
  • Online: March 26,2014
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063