848 search results - page 3 / 170 » A New Framework For Itemset Generation |
KAIS
2008
13 years 6 months ago
2008
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
SBACPAD
2003
IEEE
13 years 11 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
ICDE
2007
IEEE
14 years 14 days ago
2007
IEEE
Recently there is much need of discovering useful knowledge from massive log-data which are generated by Webbased information systems. Such log-data have multiple attributes about...
AI
2001
Springer
13 years 10 months ago
2001
Springer
As new transactions update data sources and subsequently the data warehouse, the previously discovered association rules in the old database may no longer be interesting rules in ...
ICTAI
2003
IEEE
13 years 11 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...