573 search results - page 12 / 115 » Mining Frequent Itemsets from Uncertain Data |
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, ...
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
Constraints applied on classic frequent patterns are too strict and may cause interesting patterns to be missed. Hence, researchers have proposed to mine a more relaxed version of...
PODS
2003
ACM
14 years 7 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
DKE
2008
13 years 7 months ago
2008
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
ISCI
2008
13 years 7 months ago
2008
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...