502 search results - page 29 / 101 » Mining Supplemental Frequent Patterns |
PODS
2003
ACM
14 years 10 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
DAWAK
2010
Springer
13 years 11 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 ...
AUSDM
2007
Springer
14 years 4 months ago
2007
Springer
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
DAWAK
2003
Springer
14 years 3 months ago
2003
Springer
In this paper we present a comprehensive log compression (CLC) method that uses frequent patterns and their condensed representations to identify repetitive information from large ...
ICDE
2005
IEEE
14 years 11 months ago
2005
IEEE
Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been ...