Incremental Updating Algorithms for Mining Association Rules
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [1]
  • |
  • Related [20]
  • |
  • Cited by [184]
  • | |
  • Comments
    Abstract:

    Mining association rules is an important data mining problem. There have been many algorithms proposed for efficient discovery of association rules in large databases. However, very little work has been done on maintenance of discovered association rules. When users interactively mine association rules, they may have to continually tune two thresholds, minimum support and minimum confidence, which describe the users' special interestingness. In this paper, two incremental updating algorithms——IUA and PIUA are presented for such efficient maintenance problem of association rules.

    Reference
    1  Agrawal R et al. Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD Conference on Management of Data, Washington, DC, May 1993. 207~216 2  Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Databases, Santiago, Chile, September 1994. 487~499 3  Agrawal R, Srikant R. Fast algorithms for mining association rules. IBM Research Report RJ9839, 1994 4  Agrawal R, Shafer J C. Parallel mining of association rules: design, implementation, and experience. IBM Research Report RJ 10004, 1996 5  Srikant R, Agrawal R. Mining generalized association rules. In: Proceedings of the 21st International Conference on Very Large Databases, Zurich, Switzerland, September 1994. 407~419 6  Park J S et al. An effective hash based algorithm for mining of association rules. In: Proceedings of ACM SIGMOD Conference on Management of Data, San Jose, California, May 1995. 175~186 7  Savasere A. An efficient algorithms for mining association rules in large databases. In: Proceedings of the 21st International Conference on Very Large Databases, Zurich, Switzerland, September 1995. 432~444 8  Houtsma M, Swami A. Set-oriented mining association rules. In: Proceedings of the 11st International Conference on Data Engineering, Taipei, March 1995. 25~33 9  Toivonen H. Sampling large databases for association rules. In: Proceedings of the 22th International Conference on Very Large Databases, Bombay, India, 1996. 1~12 10  Cheung D W et al. Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the 12th International Conference on Data Engineering, New Orleans, Louisana, 1996. 106~114 11  http://www.almaden.ibm.com/cs/quest/data/assoc.gen.tar.Z 12  Agrawal R, Srikant R. Mining sequential patterns. In: Proceedings of the 11st International Conference on Data Engineering, Taipei, March 1995. 3~14
    Comments
    Comments
    分享到微博
    Submit
Get Citation

冯玉才,冯剑琳.关联规则的增量式更新算法.软件学报,1998,9(4):301-306

Copy
Share
Article Metrics
  • Abstract:9341
  • PDF: 6980
  • HTML: 0
  • Cited by: 0
History
  • Received:April 22,1997
  • Revised:July 18,1997
You are the first2032654Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063