214 search results - page 36 / 43 » New Parallel Algorithms for Frequent Itemset Mining in Very ... |
KDD
2004
ACM
14 years 2 days ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
SDM
2009
SIAM
14 years 3 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
ISPASS
2009
IEEE
14 years 1 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
ICTAI
2006
IEEE
14 years 22 days ago
2006
IEEE
The goal of spatial co-location pattern mining is to find subsets of spatial features frequently located together in spatial proximity. Example co-location patterns include servi...