%0 Journal Article
%T Research of algorithm based on uncertain data for constrained frequent sets<br>基于约束的不确定数据频繁项集挖掘算法研究
%A LIU Wei-ming
%A YANG Jian
%A MAO yi-min
%A <br>刘卫明
%A 杨　健
%A 毛伊敏
%J 计算机应用研究
%D 2012
%I 
%X 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.
%K frequent item
%K uncertain data
%K item constrain
%K anti-monotone constrain
%K lattices<br>频繁项
%K 不确定数据
%K 项目约束
%K 反单调约束
%K 概念格
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=38AAB79AD8A56B536E17312EDCBF665A&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=F3090AE9B60B7ED1&sid=75524817BDE8621F&eid=D7EF5505AFCF8406&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11