10 search results - page 1 / 2 » Parallel Mining of Frequent Closed Patterns: Harnessing Mode... |
ICDM
2007
IEEE
14 years 5 months ago
2007
IEEE
Inspired by emerging multi-core computer architectures, in this paper we present MT CLOSED, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of ou...
IEEEHPCS
2010
13 years 9 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...
IPPS
2008
IEEE
14 years 5 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
SBACPAD
2003
IEEE
14 years 4 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
2007
ACM
14 years 5 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...