873 search results - page 20 / 175 » Reducing the Frequent Pattern Set |
GLVLSI
1998
IEEE
14 years 4 days ago
1998
IEEE
With the increased clock frequency of modern, high-performance processors over 500 MHz, in some cases, limiting the power dissipation has become the most stringent design target. ...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we devise a method for the estimation of the true support of itemsets on data streams, with the objective to maximize one chosen criterion among {precision, recall}...
PKDD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...