全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Research of algorithm based on uncertain data for constrained frequent sets
基于约束的不确定数据频繁项集挖掘算法研究

Keywords: frequent item,uncertain data,item constrain,anti-monotone constrain,lattices
频繁项
,不确定数据,项目约束,反单调约束,概念格

Full-Text   Cite this paper   Add to My Lib

Abstract:

For the shortage of the U-FPSuncertain data mining algorithm based on constraintalgorithm, this paper proposed a new algorithm UC-Eclat, which didn't need build frequent pattern tree but adopt vertical mode database to find intersection, and then improved the mining efficiency.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133