Correlativity Measure and Incremental Computation of Support and Confidence
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [12]
  • |
  • Related [20]
  • |
  • Cited by [5]
  • | |
  • Comments
    Abstract:

    By defining the correlativity measure, the problem of incremental discovering association rule is discussed in theory, and the mining association rule and the mining classification rule are combined to research, which establishes the theoretical foundations for researching the problem in detail. The correlativity measure depicts the numeral character of given relation and mutuality set. The conception, the definition and the properties of the proposed correlativity measure, and the relation between support and confidence are analyzed and discussed in detail. The new definition, methods, methods of computing support, and the confidence based on mutuality set are proposed. The incremental computing formulas of support and confidence are given, and incremental theorems of support and confidence are also proved. On the side, the influences of incremental data upon association rules and the confidence are analyzed in detail. The problem of pruning candidate frequent item set based on new support is also discussed. The correlativity measure and its idea proposed in this paper provide a new valuable way for studying a unification method for mining classification rules and associte rules from database.

    Reference
    [1] Agrawal, R., Imielinski, T., Swami, A. Mining association rules between sets of items in large databases. In: Buneman, P., Jajodia, S., eds. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. ACM Press, 1993. 207~216.
    [2] Agrawal, R., Srikant, R. Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C., eds. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94). Santiago: Morgan Kaufmann, 1994. 487~499.
    [3] Park, J.S., Chen, M.S., Yu, P.S. An effective hash based algorithm for mining association rules. In: Carey, M.J., Schneider, D.A., eds. Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data. San Jose, 1995. 175~186.
    [4] Savasere, A., Omiecinski, E., Navathe, S. An effective algorithm for mining association rules in large databases. In: Dayal, U., Gray, P.M.D., Nishio, Shojiro, eds. Proceedings of 21st International Conference on Very Large Data Bases (VLDB'95). Zurich: Morgan Kaufmann, 1995. 432~443.
    [5] Cheung, D.W., Han, J., Ng, V., et al. Maintenance of discovered association rules in large databases: an incremental updating technique. In: Su, S.Y.W., ed. Proceedings of the 12th International Conference on Data Engineering. New Orleans: IEEE Computer Society, 1996. 106~114.
    [6] Feng, Yu-cai, Feng, Jian-lin. Incremental updating algorithm for mining association rules. Journal of Software, 1998,9(4):301~306 (in Chinese).冯玉才,冯剑琳.关联规则的增量式更新算法.软件学报,1998,9(4):301~306.
    [7] Yang, Xue-bing, Gao, Jun-bo, Cai, Qing-sheng. Incremental updating association rule mining algorithm. Mini Micro Systems, 2000,21(6):611~613 (in Chinese).杨学兵,高俊波,蔡庆生.可增量更新的关联规则挖掘算法.小型微型计算机系统,2000,21(6):611~613.
    [8] Zhou, Bin, Wu, Quan-yuan, Gao, Hong-kui. Designing incremental mining algorithms of sequential patterns. Journal of Computer Research and Development, 2000,37(10):1160~1165 (in Chinese).周斌,吴泉源,高洪奎.序列模式挖掘的增量式算法的设计原则.计算机研究与发展,2000,37(10):1160~1165.
    [9] Wang, Xiao-feng, Yin, Dan-na, Cheng, Shihchuan. Mutuality sets. Journal of Shenyang Institute of Chemical Technology, 1999,13(3):67~76.
    [10] Wang, Xiao-feng, Yin, Dan-na, Cheng, Shihchuan. Mutuality sets and its applications in reduct of knowledge system. Journal of Tsinghua University, 1998,38(S2):6~9 (in Chinese).王晓峰,尹丹娜,郑诗诠.相关集合及其在知识库化简中的应用.清华大学学报,1998,38(S2):6~9.
    [11] Wang, Xiao-feng, Tang, Zhong, Zhao, Yue. The application of mutuality sets for knowledge discovered from database. Journal of Nanjing University, 2000,36(11):52~57 (in Chinese).王晓峰,唐忠,赵越.相关集合数据库知识发现中的应用.南京大学学报,2000,36(11):52~57.
    [12] Pawlak, Z. Rough sets theoretical aspects of reasoning about data. Kluwer Academic Publishers, 1991.
Get Citation

王晓峰,王天然.相关测度与增量式支持度和信任度的计算.软件学报,2002,13(11):2208-2214

Copy
Share
Article Metrics
  • Abstract:3644
  • PDF: 5293
  • HTML: 0
  • Cited by: 0
History
  • Received:February 06,2001
  • Revised:April 18,2001
You are the first2033403Visitors
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