As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Probabilistic frequent itemset mining over uncertain databases is a challenging problem. The state-of-the-art algorithm uses O(nlog 2n) time complexity to conduct the mining. We focus on this problem and design a framework, which can discover the probabilistic frequent itemsets with traditional exact frequent itemset mining methods; thus, the time complexity can be reduced to O(n). In this framework, we supply a minimum confidence to convert the uncertain database to exact database; furthermore, a sampling method is used to find the reasonable minimum confidence so that the accuracy is guaranteed. Our experiments show our method can significantly outperform the existing algorithm.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.