资源分类
》 资源 》论文》Activity Recognition with Finite State Machines Wesley Kerr and Anh Tran and Paul Cohen

Activity Recognition with Finite State Machines Wesley Kerr and Anh Tran and Paul Cohen

2019-11-12 | |  40 |   31 |   0
Abstract This paper shows how to learn general, Finite State Machine representations of activities that function as recognizers of previously unseen instances of activities. The central problem is to tell which differences between instances of activities are unimportant and may be safely ignored for the purpose of learning generalized representations of activities. We develop a novel way to ?nd the “essential parts” of activities by a greedy kind of multiple sequence alignment, and a method to transform the resulting alignments into Finite State Machine that will accept novel instances of activities with high accuracy.

上一篇：Discerning Linkage-Based Algorithms Among Hierarchical Clustering Methods

下一篇：Agent-Oriented Incremental Team and Activity Recognition

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...