scientific article; zbMATH DE number 5033832
From MaRDI portal
Publication:5472871
zbMath1096.68044MaRDI QIDQ5472871
Richard R. Muntz, Siegfried Nijssen, Joost N. Kok, Yun Chi
Publication date: 19 June 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Information storage and retrieval of data (68P20)
Related Items (15)
Probabilistic frequent subtrees for efficient graph classification and retrieval ⋮ Tree inclusions in windows and slices ⋮ Genetic programming for anticancer therapeutic response prediction using the NCI-60 dataset ⋮ Using trees to mine multirelational databases ⋮ Efficient mining for structurally diverse subgraph patterns in large molecular databases ⋮ Probabilistic and exact frequent subtree mining in graphs beyond forests ⋮ Tree inclusion problems ⋮ Mining frequent closed rooted trees ⋮ Inclusion problems in trace monoids ⋮ Mining rooted ordered trees under subtree homeomorphism ⋮ Frequent Submap Discovery ⋮ Ordered subtree mining via transactional mapping using a structure-preserving tree database schema ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ Efficient frequent connected subgraph mining in graphs of bounded tree-width ⋮ Learning grammars for architecture-specific facade parsing
This page was built for publication:
