On mining approximate and exact fault-tolerant frequent itemsets

Knowl. Inf. Syst., Volume 55, Issue 2, 2018, Pages 361-391.

Cited by: 2|Bibtex|Views13|DOI:https://doi.org/10.1007/s10115-017-1079-4
EI
Other Links: dblp.uni-trier.de|link.springer.com|academic.microsoft.com

Abstract:

Robust frequent itemset mining has attracted much attention due to the necessity to find frequent patterns from noisy data in many applications. In this paper, we focus on a variant of robust frequent itemsets in which a small amount of “faults” is allowed in each item and each supporting transaction. This problem is challenging since com...More

Code:

Data:

Your rating :
0

 

Tags
Comments