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

DOI10.1016/J.PATCOG.2005.10.011zbMATH Open1122.68522OpenAlexW2086812254MaRDI QIDQ2369587FDOQ2369587

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

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

Recommendations

• Graph-Based Representations in Pattern Recognition
• Spectrum of graph recovery algorithms with a moving agent
• Statistical inference on graphs
• Mining Graph Data
• Compressed sensing based missing nodes prediction in temporal communication network

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)

Cites Work

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

Cited In (1)

• Graph-Based Representations in Pattern Recognition

Uses Software

• C4.5

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369587)