Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning

DOI10.1016/j.patcog.2005.10.011zbMath1122.68522OpenAlexW2086812254MaRDI QIDQ2369587

Horst Bunke, Peter J. C. Dickinson, Miro Kraetzl, Christophe Irniger

Publication date: 22 May 2006

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2005.10.011

zbMATH Keywords

machine learningdecision tree classifiercomputer network analysisgraph sequence analysisrecovery of missing informationreference pattern matching

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Uses Software

• C4.5

Cites Work

• Matching graphs with unique node labels
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Graph-based representations in pattern recognition. 5th IAPR international workshop, GbRPR 2005, Poitiers, France, April 11--13, 2005. Proceedings.
• The String-to-String Correction Problem
• Data Mining in Time Series Databases
• Graph-Theoretic Techniques for Web Content Mining
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recovery of missing information in graph sequences by means of reference pattern matching and decision tree learning