arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1703.02662cs.LGstat.ML
收藏

基于图模型提升的结构数据识别

Structural Data Recognition with Graph Model Boosting

Tohoku University(东北大学)

Tomo Miyazaki, Shinichiro Omachi

摘要:

本文提出了一种利用大量图模型进行结构化数据识别的新方法。一般来说,结构数据识别的流行方法有两个缺点:1)只有一个单一的模型被用来捕捉结构变化。2)使用朴素的识别方法,例如最近邻方法。在本文中,我们建议加强这些模型的识别性能以及它们捕获结构变化的能力。该方法构造了大量的图模型,并使用这些模型训练决策树。本文有两个主要贡献。第一个是一个新的图模型,可以快速执行计算,这使我们能够在可行的时间内构建多个模型。第二个贡献是一种新的方法来结构化数据识别:图模型提升。综合的结构变化可以通过在boosting框架中构建的大量图模型来捕获,并且可以通过聚合决策树来形成复杂的分类器。从而可以对复杂的结构变化进行具有强大识别能力的结构数据识别。实验结果表明,该方法取得了令人印象深刻的结果,并优于现有的方法对IAM图数据库存储库的数据集。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑