873 search results - page 3 / 175 » Reducing the Frequent Pattern Set |
147
Voted
KDD
2005
ACM
16 years 3 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...
141
Voted
KDD
2004
ACM
16 years 3 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 ...
200
Voted
IDA
2011
Springer
14 years 9 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...
92
Voted
ICCS
2005
Springer
15 years 8 months ago
2005
Springer
115
Voted
DAWAK
2010
Springer
15 years 3 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 ...