[1]吉根林,韦素云.分布式环境下约束性关联规则的快速更新[J].东南大学学报(自然科学版),2006,36(1):34-38.[doi:10.3969/j.issn.1001-0505.2006.01.007]
 Ji Genlin,Wei Suyun.Fast updating of constrained association rules in distributed databases[J].Journal of Southeast University (Natural Science Edition),2006,36(1):34-38.[doi:10.3969/j.issn.1001-0505.2006.01.007]
点击复制

分布式环境下约束性关联规则的快速更新()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
36
期数:
2006年第1期
页码:
34-38
栏目:
计算机科学与工程
出版日期:
2006-01-20

文章信息/Info

Title:
Fast updating of constrained association rules in distributed databases
作者:
吉根林 韦素云
南京师范大学计算机科学系, 南京 210097; 苏州大学江苏省计算机信息处理技术重点实验室, 苏州 215006
Author(s):
Ji Genlin Wei Suyun
Department of Computer Science, Nanjing Normal University, Nanjing 210097, China
Jiangsu Province Key Laboratory of Computer Information Processing, Suzhou University, Suzhou 215006, China
关键词:
关联规则 项约束 约束性频繁项目集 频繁项目集更新 分布式数据挖掘
Keywords:
association rule item constraints frequent itemsets with item constraints frequent itemsets updating distributed data mining
分类号:
TP311
DOI:
10.3969/j.issn.1001-0505.2006.01.007
摘要:
研究分布式环境下约束性关联规则更新问题,包括数据库中事务增加和删除2种情况.引入向导集的概念,提出基于全局-局部模式的约束性关联规则增量式更新算法DUCAR,其中包括局部约束性频繁项目集更新算法ULFC和全局约束性频繁项目集更新算法UGFC.该算法充分利用原先的挖掘结果提高更新效率,首先从最高维的频繁n项目集进行更新,在更新过程中考虑约束条件,结合剪枝算法,生成较少数量的满足约束条件的候选项目集.将该算法用Java加以实现,采用多组数据对此算法的性能进行测试,并与其他算法作对比实验,实验结果表明,该算法是高效可行的.
Abstract:
A fast incremental updating technique is presented for maintaining the constrained association rules discovered in the cases including insertion and deletion of transactions in the distributed databases.The concept of induced set is introduced. The efficient algorithm DUCAR(distributed updating of constrained association rules), which includes algorithms ULFC(updating of local frequent constrained itemsets)and UGFC(updating of global frequent constrained-itemsets), is proposed to update constrained association rules in distributed databases. The algorithm makes full use of the previous mining result to cut down the cost of updating frequent itemsets with item constraints in the distributed databases. The algorithm starts by computing the highest n level frequent itemsets in the original databases, and generate a small number of candidate itemsets by exploring pruning technique. Finally, algorithm DUCAR is implemented by Java and a group of dataset is applied to test the performance of algorithm and the experiment result is compared with other algorithm. The experiment results show that the algorithm is effective and efficient.

参考文献/References:

[1] Cheung D W,Ng V T,Fu A W.Efficient mining of association rules in distributed databases[J].IEEE Transactions on Knowledge and Data Engineering,1996,8(6):911-922.
[2] Schuster A,Wollf R.Communication efficient distributed mining of association rules[C] // Walid G Aref,ed.Proc of 2001 ACM-SIGMOD Int Conf on Management of Data.Santa Barbara:ACM Press,2001:473-484.
[3] Srikant R,Vu Q,Agrawal R.Mining association rules with item constraints[C] //Proc of 1997 Int Conf on Knowledge Discovery in Databases and Data Mining.Newport Beach:AAAI Press,1997:67-73.
[4] 崔立新,苑森淼,赵春喜.约束性关联规则发现方法及算法[J].计算机学报,2000,23(2):216-220.
  Cui Lixin,Yuan Senmiao,Zhao Chunxi.Algorithms for mining constrained association rules[J]. Chinese Journal of Computers,2000,23(2):216-220.(in Chinese)
[5] Wang Chunhua,Huang Houkuan.A fast distributed mining algorithm for association rules with item constraints[C] // IEEE International Conference on Systems,Man and Cybernetics.Nashville,TN,2000:1900-1905.
[6] 李宏,陈松乔.分布式环境下挖掘约束性关联规则的算法研究[J].计算机工程与应用,2003,39(33):8-10.
  Li Hong,Chen Songqiao.An algorithm research for distributed association rules mining with item constraints [J]. Computer Engineering and Applications,2003,39(33):8-10.(in Chinese)
[7] 寇育敬,王春花,黄厚宽.约束关联规则的增量式维护算法[J].计算机研究与发展,2001,32(8):947-951.
  Kou Yujing,Wang Chunhua,Huang Houkuan.An incremental algorithm for maintaining constrained association rules[J].Journal of Computer Research & Development,2001,32(8):947-951.(in Chinese)
[8] 吉根林,杨明,赵斌,等.基于DDMINER分布式数据库系统中频繁项目集的更新[J].计算机学报,2003,26(10):1387-1392.
  Ji Genlin,Yang Ming,Zhao Bin,et al.Updating technique for frequent itemsets in distributed database systems based on DDMINER[J]. Chinese Journal of Computers,2003,26(10):1387-1392.(in Chinese)
[9] Agrawal R,Srikant R.Fast algorithms for mining association rules in large databases[C] //Jorge B B,Matthias J,Carlo Z,eds.Proc of the 20th Int Conf on Very Large Data Base.Santiago,Chile:Morgan Kaufmann,1994:487-499.
[10] Newman D J,Hettich S,Blake C L.UCI respository of machine learning databases [EB/OL].(2000-02-22)[2005-05-19].http://www.ics.uci.edu/~mleran/MLRepository.html.

备注/Memo

备注/Memo:
基金项目: 国家自然科学基金资助项目(70371015)、江苏省重点实验室开放基金资助项目(KJS03064).
作者简介: 吉根林(1964—),男,博士,教授,glji@njnu.edu.cn.
更新日期/Last Update: 2006-01-20