30 search results - page 2 / 6 » High Performance Subgraph Mining in Molecular Compounds |
PKDD
2010
Springer
13 years 2 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
SDM
2008
SIAM
13 years 6 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 ...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
Improving predictions of the skin permeability coefficient is a difficult problem. It is also an important issue with the increasing use of skin patches as a means of drug deliv...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
PAMI
2011
12 years 11 months ago
2011
—The field of Action Recognition has seen a large increase in activity in recent years. Much of the progress has been through incorporating ideas from single frame object recogn...