136 search results - page 20 / 28 » CloseGraph: mining closed frequent graph patterns |
PAKDD
2004
ACM
14 years 1 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
KDD
2007
ACM
14 years 2 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
BIBE
2007
IEEE
13 years 12 months ago
2007
IEEE
In this paper, we investigate a new approach for literature mining. We use frequent subgraph mining, and its generalization topological structure mining, for finding interesting re...
PODS
2005
ACM
14 years 8 months ago
2005
ACM
We are often interested to test whether a given cause has a given effect. If we cannot specify the nature of the factors involved, such tests are called model-free studies. There ...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...