263 search results - page 20 / 53 » kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets |
103
click to vote
DMIN
2007
14 years 11 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
129
Voted
PKDD
2004
Springer
15 years 3 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
81
Voted
DAWAK
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
77
Voted
FIMI
2003
14 years 11 months ago
2003
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
APWEB
2006
Springer
15 years 1 months ago
2006
Springer
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...