资源论文Probabilistic Models for Concurrent Chatting Activity Recognition

Probabilistic Models for Concurrent Chatting Activity Recognition

2019-11-15 | |  44 |   39 |   0

Abstract Recognition of chatting activities in social interactions is useful for constructing human social networks. However, the existence of multiple people involved in multiple dialogues presents special challenges. To model the conversational dynamics of concurrent chatting behaviors, this paper advocates Factorial Conditional Random Fields (FCRFs) as a model to accommodate co-temporal relationships among multiple activity states. In addition, to avoid the use of ineffificient Loopy Belief Propagation (LBP) algorithm, we propose using Iterative Classifification Algorithm (ICA) as the inference method for FCRFs. We designed experiments to compare our FCRFs model with two dynamic probabilistic models, Parallel Condition Random Fields (PCRFs) and Hidden Markov Models (HMMs), in learning and decoding based on auditory data. The experimental results show that FCRFs outperform PCRFs and HMM-like models. We also discover that FCRFs using the ICA inference approach not only improves the recognition accuracy but also takes signifificantly less time than the LBP inference method

上一篇:Exploiting Multi-Modal Interactions: A Unified Framework

下一篇:Drosophila Gene Expression Pattern Annotation through Multi-Instance Multi-Label Learning

用户评价
全部评价

热门资源

  • 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...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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