Sciweavers

97 search results - page 10 / 20
» Frequent free tree discovery in graph data
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
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 29 days ago
Key semantics extraction by dependency tree mining
We propose a new text mining system which extracts characteristic contents from given documents. We define Key semantics as characteristic sub-structures of syntactic dependencie...
Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, ...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 7 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
ICDM
2002
IEEE
91views Data Mining» more  ICDM 2002»
14 years 13 days ago
Mining Molecular Fragments: Finding Relevant Substructures of Molecules
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instea...
Christian Borgelt, Michael R. Berthold
PKDD
2000
Springer
151views Data Mining» more  PKDD 2000»
13 years 11 months ago
Discovery of Characteristic subgraph Patterns Using Relative Indexing and the Cascade Model
: Relational representation of objects using graphs reveals much information that cannot be obtained by attribute value representations alone. There are already many databases that...
Takashi Okada, Mayumi Oyama