39 search results - page 4 / 8 » On Minimal Infrequent Itemset Mining |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
PKDD
2004
Springer
14 years 21 days ago
2004
Springer
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
CIDM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In this paper we have proposed an improved approach to extract rare association rules. Rare association rules are the association rules containing rare items. Rare items...
KDD
2009
ACM
14 years 2 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
IJFCS
2008
13 years 7 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...