873 search results - page 25 / 175 » Reducing the Frequent Pattern Set |
ITC
2002
IEEE
14 years 25 days ago
2002
IEEE
Efficient production testing is frequently hampered because current digital circuits require test sets which are too large. These test sets can be reduced significantly by means...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
The discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to...
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
SBACPAD
2003
IEEE
14 years 1 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...
KDD
2010
ACM
13 years 11 months ago
2010
ACM
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...