276 search results - page 4 / 56 » Frequent Submap Discovery |
ICDM
2009
IEEE
13 years 7 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
KDD
2001
ACM
14 years 10 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
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 ...
ICDM
2009
IEEE
13 years 7 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...