873 search results - page 12 / 175 » Reducing the Frequent Pattern Set |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
DAWAK
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
DAWAK
2009
Springer
13 years 11 months ago
2009
Springer
Since transaction identifiers (ids) are unique and would not usually be frequent, mining frequent patterns with transaction ids, showing records they occurred in, provides an effic...