174 search results - page 16 / 35 » Probabilistic frequent itemset mining in uncertain databases |
CAEPIA
2003
Springer
14 years 27 days ago
2003
Springer
One of the most important tasks for determining association rules consists of calculating all the maximal frequent itemsets. Specifically, some methods to obtain these itemsets hav...
IEEEHPCS
2010
13 years 6 months ago
2010
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
DAWAK
2009
Springer
13 years 11 months ago
2009
Springer
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...
IDEAS
2005
IEEE
14 years 1 months ago
2005
IEEE
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...