388 search results - page 24 / 78 » Mining Frequent Itemsets Using Support Constraints |
FIMI
2004
13 years 9 months ago
2004
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
DATAMINE
1999
13 years 7 months ago
1999
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The ...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
IDA
2008
Springer
13 years 7 months ago
2008
Springer
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...