%0 Journal Article
%T Efficient mining probabilistic frequent itemset in uncertain databases<br>一种有效的不确定数据概率频繁项集挖掘算法
%A LIU Li-xin
%A ZHANG Xiao-lin
%A MAO Yi-min
%A <br>刘立新
%A 张晓琳
%A 毛伊敏
%J 计算机应用研究
%D 2012
%I 
%X The way to calculate the frequentness probability in PFIM limited its applications, it needed to scan the database for many times and generated a large number of candidate sets. This paper proposed a new algorithm named EPFIM. First, the new method of calculating the frequentness probability made it easier to update frequentness probability of itemset, and could be adapted in more situations. Second, it used uncertain probability matrix to store the database in order to scan database less. In addition, the sequence of items and deleting unwanted transactions gradually improved efficiency of mining. Theoretical analysis and experimental results show EPFIM performances better.
%K uncertain databases
%K possible word
%K expected support
%K probabilistic frequent itemset<br>不确定数据
%K 可能世界
%K 期望支持度
%K 概率频繁项集
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=F950C016BC33E90125A12D04BF0CB2C6&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=38B194292C032A66&sid=2EA35D7E5C9A6E66&eid=85C7135C065B9251&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=10