57 search results - page 1 / 12 » ORIGAMI: Mining Representative Orthogonal Graph Patterns |
ICDM
2007
IEEE
14 years 2 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...
SADM
2008
13 years 7 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...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
ICCS
2007
Springer
14 years 2 months ago
2007
Springer
We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in te...
ICDM
2009
IEEE
13 years 6 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...