155 search results - page 7 / 31 » A parallel, distributed algorithm for relational frequent pa... |
ICDCS
2000
IEEE
13 years 12 months ago
2000
IEEE
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
AUSAI
2003
Springer
14 years 21 days ago
2003
Springer
There are many methods for finding association rules in very large data. However it is well known that most general association rule discovery methods find too many rules, which...
KDD
2002
ACM
14 years 7 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 ...
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...
WWW
2010
ACM
14 years 2 months ago
2010
ACM
The World-Wide Web consists not only of a huge number of unstructured texts, but also a vast amount of valuable structured data. Web tables [2] are a typical type of structured in...