Volume 66, Number 1-2, 2005

• 
  Takashi Washio, Luc De Raedt, Joost N. Kok: Advances in Mining Graphs, Trees and Sequences.
• 
  Sébastien Ferré, Ross D. King: A Dichotomic Search Algorithm for Mining and Learning in Domain-Specific Logics. 1-32
• 
  Mohammed Javeed Zaki: Efficiently Mining Frequent Embedded Unordered Trees. 33-52
• 
  Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda: A General Framework for Mining Frequent Subgraphs from Labeled Graphs. 53-82
• 
  Lawrence B. Holder, Diane J. Cook, Jeffrey Coble, Maitrayee Mukherjee: Graph-based Relational Learning with Application to Security. 83-101
• 
  Amaury Habrard, Marc Bernard, Marc Sebban: Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data. 103-130
• 
  Warodom Geamsakul, Tetsuya Yoshida, Kouzou Ohara, Hiroshi Motoda, Hideto Yokoi, Katsuhiko Takabayashi: Constructing a Decision Tree for Graph-Structured Data and its Applications. 131-160
• 
  Yun Chi, Richard R. Muntz, Siegfried Nijssen, Joost N. Kok: Frequent Subtree Mining - An Overview. 161-198

Volume 66, Number 3, 2005

• 
  Tomasz Borzyszkowski: Generalized Interpolation in First Order Logic. 199-219
• 
  Raymond R. Devillers, Hanna Klaudel: Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets. 221-257
• 
  Ernst-Erich Doberkat: Tracing Relations Probabilistically. 259-275
• 
  Olivier Finkel: On Winning Conditions of High Borel Complexity in Pushdown Games. 277-298
• 
  Albina Moshkova: On Effective Methods for Diagnosis of Retaining Faults in Circuits. 299-313

Volume 66, Number 4, 2005

• 
  Alberto Pettorossi, Maurizio Proietti: Program Transformation: Theoretical Foundations and Basic Techniques. Part 1.
• 
  Alcino Cunha, Jorge Sousa Pinto: Point-free Program Transformation. 315-352
• 
  Jeremy Gibbons, Graham Hutton: Proof Methods for Corecursive Programs. 353-366
• 
  Robert Glück, Masahiko Kawabe: A Method for Automatic Program Inversion Based on LR(0) Parsing. 367-395
• 
  Olivier Danvy, Mayer Goldberg: There and Back Again. 397-413
• 
  Björn Lisper: Infinite Unfolding and Transformations of Nondeterministic Programs. 415-439

last updated on Sat May 18 06:08:40 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page