A DISTRIBUTED CONTEXT-FREE GRAMMARS LEARNING ALGORITHM AND ITS APPLICATION IN VIDEO CLASSIFICATION

被引:0
|
作者
Huang, Jing [1 ]
Schonfeld, Dan [1 ]
机构
[1] Univ Illinois, Dept Elect & Comp Engn, Chicago, IL 60680 USA
关键词
Trajectory Classification; Hidden Markov Model; Context-Free Grammars; Context-Sensitive Grammars; Grammatical Learning; HIDDEN MARKOV-MODELS; RECOGNITION;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a novel statistical estimation algorithm to stochastic context-sensitive grammars (SCSGs). First, we show that the SCSGs model can be solved by decomposing it into several causal stochastic context-free grammars (SCFGs) models and each of these SCFGs models can be solved simultaneously using a fully synchronous distributed computing framework. An alternate updating scheme based approximate solution to multiple SCFGs is also provided under the assumption of a realistic sequential computing framework. A series of statistical algorithms are expected to learn SCFGs subsequently. The SGSCs can be then used to represent multiple-trajectory. Experimental results demonstrate the improved performance of our method compared with existing methods for multiple-trajectory classification.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] Generalized context-free grammars and multiple context-free grammars
    Kasami, Tadao
    Seki, Hiroyuki
    Fujii, Mamoru
    Systems and Computers in Japan, 1989, 20 (07): : 43 - 52
  • [2] Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
    Drewes, Frank
    Engelfriett, Joost
    ACTA CYBERNETICA, 2015, 22 (02): : 373 - 392
  • [3] Learning context-free grammars with a simplicity bias
    Langley, P
    Stromsten, S
    MACHINE LEARNING: ECML 2000, 2000, 1810 : 220 - 228
  • [4] Implicit Learning of Recursive Context-Free Grammars
    Rohrmeier, Martin
    Fu, Qiufang
    Dienes, Zoltan
    PLOS ONE, 2012, 7 (10):
  • [5] Learning trees from strings: A strong learning algorithm for some context-free grammars
    Clark, Alexander
    Journal of Machine Learning Research, 2013, 14 : 3537 - 3559
  • [6] A parallel parsing algorithm for arbitrary context-free grammars
    Ra, DY
    Kim, JH
    INFORMATION PROCESSING LETTERS, 1996, 58 (02) : 87 - 96
  • [7] A Fast Filtering Algorithm for Massive Context-free Grammars
    Dohmann, Jeremy
    Deeds, Kyle
    ACMSE 2020: PROCEEDINGS OF THE 2020 ACM SOUTHEAST CONFERENCE, 2020, : 62 - 70
  • [8] A parallel parsing algorithm for arbitrary context-free grammars
    Computer Science Department, Yonsei University, Maeji, Heungup, Wonju-city, KangWon, 220-710, Korea, Republic of
    Inf. Process. Lett., 2 (87-96):
  • [9] Distributional Learning of Simple Context-Free Tree Grammars
    Kasprzik, Anna
    Yoshinaka, Ryo
    ALGORITHMIC LEARNING THEORY, 2011, 6925 : 398 - +
  • [10] Distributional learning of parallel multiple context-free grammars
    Clark, Alexander
    Yoshinaka, Ryo
    MACHINE LEARNING, 2014, 96 (1-2) : 5 - 31