SADM
2008
13 years 4 months ago
2008
: In this paper, we introduce the concept of -orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are -orthogonal if their similarit...
SIGMOD
1998
ACM
13 years 8 months ago
1998
ACM
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In c...
SAINT
2003
IEEE
13 years 9 months ago
2003
IEEE
The problem of identifying patterns from system call trails of UNIX processes to better model application behavior has been investigated intensively. Most existing approaches focu...
ICPADS
2006
IEEE
13 years 10 months ago
2006
IEEE
When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets d...
ICDM
2007
IEEE
13 years 10 months ago
2007
IEEE
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
KDD
2005
ACM
14 years 4 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...