Structural Data Recognition with Graph Model Boosting

by   Tomo Miyazaki, et al.

This paper presents a novel method for structural data recognition using a large number of graph models. In general, prevalent methods for structural data recognition have two shortcomings: 1) Only a single model is used to capture structural variation. 2) Naive recognition methods are used, such as the nearest neighbor method. In this paper, we propose strengthening the recognition performance of these models as well as their ability to capture structural variation. The proposed method constructs a large number of graph models and trains decision trees using the models. This paper makes two main contributions. The first is a novel graph model that can quickly perform calculations, which allows us to construct several models in a feasible amount of time. The second contribution is a novel approach to structural data recognition: graph model boosting. Comprehensive structural variations can be captured with a large number of graph models constructed in a boosting framework, and a sophisticated classifier can be formed by aggregating the decision trees. Consequently, we can carry out structural data recognition with powerful recognition capability in the face of comprehensive structural variation. The experiments shows that the proposed method achieves impressive results and outperforms existing methods on datasets of IAM graph database repository.


page 1

page 2

page 3

page 4


Improving Data Quality with Training Dynamics of Gradient Boosting Decision Trees

Real world datasets contain incorrectly labeled instances that hamper th...

Popular Ensemble Methods: An Empirical Study

An ensemble consists of a set of individually trained classifiers (such ...

To Boost or not to Boost: On the Limits of Boosted Neural Networks

Boosting is a method for finding a highly accurate hypothesis by linearl...

Multi-font Multi-size Kannada Numeral Recognition Based on Structural Features

In this paper a fast and novel method is proposed for multi-font multi-s...

Provably Robust Boosted Decision Stumps and Trees against Adversarial Attacks

The problem of adversarial samples has been studied extensively for neur...

Expertise Trees Resolve Knowledge Limitations in Collective Decision-Making

Experts advising decision-makers are likely to display expertise which v...

Please sign up or login with your details

Forgot password? Click here to reset