Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
This work discusses the problem of generating association rules from a set of transactions in a relational database, taking performance and accuracy of found results as the essent...
The interest in a further pruning of the set of frequent patterns that can be drawn from real-life datasets is growing up. In fact, it is a quite survival reflex towards providing...
Tarek Hamrouni, Islem Denden, Sadok Ben Yahia, Eng...
Discovering frequent patterns from huge amounts of data is one of the most studied problems in data mining. However, some sensitive patterns with security policies may cause a thr...
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
In this paper, we study the maintenance of frequent patterns in the context of the generator representation. The generator representation is a concise and lossless representation o...
Object search in a visual scene is a highly challenging and computationally intensive task. Most of the current object detection techniques extract features from images for classi...
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
This poster paper summarizes our solution for mining max frequent generalized itemsets (g-itemsets), a compact representation for frequent patterns in the generalized environment....
Mining frequent patterns in transaction databases has been studied extensively in data mining research. However, most of the existing frequent pattern mining algorithms do not con...