43 search results - page 2 / 9 » Fast Frequent Itemset Mining using Compressed Data Represent... |
AUSDM
2007
Springer
14 years 1 months ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
JIIS
2007
13 years 6 months ago
2007
Mining frequent patterns on streaming data is a new challenging problem for the data mining community since data arrives sequentially in the form of continuous rapid streams. In t...
ICDM
2005
IEEE
14 years 18 days ago
2005
IEEE
In this paper, we formulate the problem of summarization of a dataset of transactions with categorical attributes as an optimization problem involving two objective functions - co...
SAC
2006
ACM
14 years 29 days ago
2006
ACM
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
DKE
2007
13 years 7 months ago
2007
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...