3791 search results - page 109 / 759 » Packing sets of patterns |
147
click to vote
EDBT
2011
ACM
14 years 6 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...
135
click to vote
TSP
2008
15 years 2 months ago
2008
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
116
click to vote
KDD
2002
ACM
16 years 3 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
122
click to vote
SSDBM
2003
IEEE
15 years 8 months ago
2003
IEEE
Life science researchers frequently need to query large protein data sets in a variety of different ways. Protein data sets have a rich structure that includes its primary structu...
152
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...