263 search results - page 2 / 53 » kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets |
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
SGAI
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we describe the concept of Meta ARM in the context of its objectives and challenges and go on to describe and analyse a number of potential solutions. Meta ARM is de...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
IJAR
2011
12 years 11 months ago
2011
Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns in time se...