252 search results - page 19 / 51 » Mining Frequent Patterns without Candidate Generation |
FIMI
2004
13 years 9 months ago
2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
IDEAS
2005
IEEE
14 years 1 months ago
2005
IEEE
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
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...