计算机科学 ›› 2017, Vol. 44 ›› Issue (12): 211-215.doi: 10.11896/j.issn.1002-137X.2017.12.038

• 人工智能 • 上一篇    下一篇

基于命题逻辑的关联规则挖掘算法L-Eclat

徐卫,李晓粉,刘端阳   

  1. 浙江工业大学计算机科学与技术学院 杭州310023,浙江工业大学计算机科学与技术学院 杭州310023,浙江工业大学计算机科学与技术学院 杭州310023
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受浙江省自然科学基金(LY14F020018)资助

Propositional Logic-based Association-rule Mining Algorithm L-Eclat

XU Wei, LI Xiao-fen and LIU Duan-yang   

  • Online:2018-12-01 Published:2018-12-01

摘要: 关联规则挖掘是数据挖掘领域非常重要的课题,在很多领域被广泛应用。关联规则挖掘算法都需要设置最小支持度和最小置信度。很多国内外学者研究的挖掘算法在这两方面都存在着一些问题,不仅需要大量的领域知识来设置合适的最小支持度,而且其结果集庞大、用户不容易理解。针对关联规则挖掘算法存在的问题,将命题逻辑融合到关联规则算法Eclat中,设计出了基于命题逻辑思想的挖掘算法L-Eclat。实验结果表明,L-Eclat算法压缩了挖掘的规则集,减小了算法的时间消耗,且即使是非常小的支持度也可以得到高质量的关联规则,这在一定程度上解决了支持度设置的问题。

关键词: 关联规则,命题逻辑,支持度,置信度

Abstract: Association rule mining is an important topic in the field of data mining,and it has been widely used in lots of practical applications.Generally,association rule mining algorithms have to set the minimal support threshold and the minimal confidence threshold.But it is hard for most mining algorithms to set these two values.Not only is tremendous related knowledge needed to select the support threshold,but also the mining results are too large and difficult to understand.To solve these problems,the idea of propositional logic was introduced into Eclat,which is one of the classical association rule mining algorithms.We proposed logic-based association rule mining algorithm called L-Eclat.Then,we compared L-Eclat with Eclat.The results show that L-Eclat can optimize and compress the result rule sets at certain degree,and it results in less time consumption and high-quality association rules.Furthermore,L-Eclat can run with a smaller support threshold,and it decreases the dependence on the support threshold and avoids spending much time on choosing a suitable support threshold.

Key words: Association rule,Propositional logic,Support threshold,Confidence threshold

[1] HAN J,KAMBER M.数据挖掘概念与技术[M].范明,孟小峰,译.北京:机械工业出版社,2006:1-27.
[2] RAKESH A,SRIKANT R.Fast Algorithms for Mining Asso-ciation Rules[C]∥Proceedings of International Conference on Very Large DataBases.Santiago,Chile:ACM Press,1994:21-30.
[3] 李锦泽,叶晓俊.关联规则挖掘算法研究现状[C]∥计算机技术与应用进展——全国计算机技术与应用.安徽:中国科学技术大学出版社,2007:9-14.
[4] CUI L,GUO J,WU L D.Algorithm for Mining AssociationRules Based on Dynamic Hashing and Transaction Reduction[J].Computer Science,2015,42(9):41-44.(in Chinese) 崔亮,郭静,吴玲达.一种基于动态散列和事务压缩的关联规则挖掘算法[J].计算机科学,2015,42(9):41-44.
[5] XIE Z P,LIU Z T.Concept Lattice and Association Rule Disco-very [J].Journal of Computer Research & Development,2000,37(12):1415-1421.(in Chinese) 谢志鹏,刘宗田.概念格与关联规则发现[J].计算机研究与发展,2000,37(12):1415-1421.
[6] LI Y,LI T,CAI J J,et al.Extracting Succinct Association Rules Based on Concept Lattice[J].Journal of Nanjing University of Posts and Telecommunications (Natural Science),2007,27(3):44-47.(in Chinese) 李云,李拓,蔡俊杰,等.基于概念格提取简洁关联规则[J].南京邮电大学学报(自然科学版),2007,27(3):44-47.
[7] OUYANG J H,WANG Z J,LIU D Y.An Improved Association Rule Algorithm with Dynamically Weighted Characteristic[J].Journal of Jilin University (Science Edition),2005,43(3):314-319.(in Chinese) 欧阳继红,王仲佳,刘大有.具有动态加权特性的关联规则算法[J].吉林大学学报(理学版),2005,43(3):314-319.
[8] DUAN J,DAI J F.Algorithm of Mining Weighted AssociationRules Based on Multiple Supports[J].Journal of Tianjin University,2006,39(1):114-118.(in Chinese) 段军,戴居丰.基于多支持度的挖掘加权关联规则算法[J].天津大学学报,2006,39(1):114-118.
[9] LI J,CERCONE N.A Rough Set Based Model to Rank the Importance of Association Rules [C]∥Proceedings of Rough Sets,Fuzzy Sets,Data Mining,and Granular Computing.Berlin Heidelberg:Springer Press,2005:109-118.
[10] HU K,LU Y,ZHOU L,et al.Integrating Classification and Association Rule Mining:A Concept Lattice Framework[C]∥Proceedings of New Directions in Rough Sets,Data Mining,and Granular-Soft Computing.Berlin Heidelberg:Springer Press,2003:443-447.
[11] SIM A,INDRAWAN M,ZUTSHI S,et al.Logic-Based Pattern Discovery [J].IEEE Transactions on Knowledge and Data Engineering,2010,22(6):798-811.
[12] ZAKI M.Scalable Algorithms for Association Mining[J].IEEE Transactions on Knowledge and Data Engineering,2000,12(3):372-390.
[13] ZAKI M,GOUDA K.Fast Vertical Mining using Diffsets [C]∥Proceedings of International Conference on Knowledge Disco-very and Data Mining.Washington DC:ACM Press,2003:326-335.
[14] CHEN C H,LAN G C,HONG T P,et al.Mining High Cohe-rent Association Rules with Consideration of Support Measure [J].Expert Systems with Applications,2013,40(16):6531-6537.
[15] AN J R,WANG H P,ZHANG L B,et al.A Compression Matrix Algorithm for Mining Association Rules Based on Mapreduce[J].Journal of Chongqing University of Technology(Natural Science),2016,0(2):95-100.(in Chinese) 安建瑞,王海鹏,张龙波,等.一种基于MapReduce的压缩矩阵关联规则挖掘算法[J].重庆理工大学学报(自然科学版),2016,0(2):95-100.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!