873 search results - page 3 / 175 » Reducing the Frequent Pattern Set |
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Regardless of the frequent patterns to discover, either the full frequent patterns or the condensed ones, either closed or maximal, the strategy always includes the traversal of t...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
IDA
2011
Springer
13 years 2 months ago
2011
Springer
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
DAWAK
2010
Springer
13 years 9 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...