Grammatical inference of directed acyclic graph languages with polynomial time complexity

被引:2
|
作者
Gallego, Antonio-Javier [1 ]
Lopez, Damian [2 ]
Calera-Rubio, Jorge [1 ]
机构
[1] Univ Alicante, Dept Software & Comp Syst, Pattern Recognit & Artificial Intelligence Grp, Alicante 03690, Spain
[2] Univ Politecn Valencia, Dept Sistemas Informat & Computac, E-46022 Valencia, Spain
关键词
Graph languages; Graph automata; Grammatical inference; k-Testable languages; CONTEXT-FREE GRAMMARS; TESTABLE TREE-LANGUAGES; IDENTIFICATION; RECOGNITION; AUTOMATA; INFORMATION; PREDICTION; LIMIT;
D O I
10.1016/j.jcss.2017.12.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we study the learning of graph languages. We extend the well-known classes of k-testability and k-testability in the strict sense languages to directed graph languages. We propose a grammatical inference algorithm to learn the class of directed acyclic k-testable in the strict sense graph languages. The algorithm runs in polynomial time and identifies this class of languages from positive data. We study its efficiency under several criteria, and perform a comprehensive experimentation with four datasets to show the validity of the method. Many fields, from pattern recognition to data compression, can take advantage of these results. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:19 / 34
页数:16
相关论文
共 50 条
  • [21] USE OF GRAMMATICAL INFERENCE FOR DESIGNING PROGRAMMING LANGUAGES
    CRESPIREGHIZZI, S
    MELKANOFF, MA
    LICHTEN, L
    COMMUNICATIONS OF THE ACM, 1973, 16 (02) : 83 - 90
  • [22] Languages as hyperplanes:: Grammatical inference with string kernels
    Clark, Alexander
    Florencio, Christophe Costa
    Watkins, Chris
    MACHINE LEARNING: ECML 2006, PROCEEDINGS, 2006, 4212 : 90 - 101
  • [23] Languages as hyperplanes: grammatical inference with string kernels
    Alexander Clark
    Christophe Costa Florêncio
    Chris Watkins
    Machine Learning, 2011, 82 : 351 - 373
  • [24] FLUENT APHASIA AND GRAMMATICAL COMPLEXITY IN 3 LANGUAGES
    EDWARDS, S
    BASTIAANSE, R
    KISS, K
    BRAIN AND LANGUAGE, 1994, 47 (03) : 414 - 416
  • [25] Learning directed acyclic graph SPNs in sub-quadratic time
    Ghose, Amur
    Jaini, Priyank
    Poupart, Pascal
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2020, 120 : 48 - 73
  • [26] COMPLEXITY OF GRAMMATICAL DESCRIPTION OF CONTEXTUALLY FREE LANGUAGES
    ILYUSHKI.VA
    DOKLADY AKADEMII NAUK SSSR, 1972, 203 (06): : 1244 - &
  • [27] POLYNOMIAL-TIME INFERENCE OF UNIONS OF 2 TREE PATTERN LANGUAGES
    ARIMURA, H
    SHINOHARA, T
    OTSUKI, S
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1992, E75D (04) : 426 - 434
  • [28] Analyzing directed acyclic graph recombination
    Cotta, C
    Troya, JM
    COMPUTATIONAL INTELLIGENCE: THEORY AND APPLICATIONS, PROCEEDINGS, 2001, 2206 : 739 - 748
  • [29] Implementation of directed acyclic word graph
    Balík, M
    KYBERNETIKA, 2002, 38 (01) : 91 - 103
  • [30] Hierarchical directed acyclic graph kernel
    NIT Communication Science Laboratories, NTT Corporation, Kyoto, 619-0237, Japan
    不详
    不详
    Syst Comput Jpn, 2006, 10 (58-68):