Sciweavers

21 search results - page 4 / 5
» Discovering frequent geometric subgraphs
Sort
View
IDA
2007
Springer
13 years 7 months ago
Inference of node replacement graph grammars
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
EDBT
2012
ACM
257views Database» more  EDBT 2012»
11 years 9 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
ICDM
2002
IEEE
178views Data Mining» more  ICDM 2002»
14 years 12 days ago
gSpan: Graph-Based Substructure Pattern Mining
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
Xifeng Yan, Jiawei Han
AAAI
2006
13 years 8 months ago
Cross-Domain Knowledge Transfer Using Structured Representations
Previous work in knowledge transfer in machine learning has been restricted to tasks in a single domain. However, evidence from psychology and neuroscience suggests that humans ar...
Samarth Swarup, Sylvian R. Ray
EDBT
2008
ACM
160views Database» more  EDBT 2008»
13 years 9 months ago
Taxonomy-superimposed graph mining
New graph structures where node labels are members of hierarchically organized ontologies or taxonomies have become commonplace in different domains, e.g., life sciences. It is a ...
Ali Cakmak, Gultekin Özsoyoglu