Probabilistic Models for Concurrent Chatting Activity Recognition

doi:10.1145/1889681.1889685

2011-01-24

Jane Yung-jen Hsu *

DOI：10.1145/1889681.1889685

原文链接

查看原文

摘要

En 中文

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 article 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 inefficient Loopy Belief Propagation (LBP) algorithm, we propose using Iterative Classification 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 HMMs-like models. We also discover that FCRFs using the ICA inference approach not only improves the recognition accuracy but also takes significantly less time than the LBP inference method.

Keyword:

Algorithms

Experimentation

Chatting activity recognition

factorial conditional random fields

loopy belief propagation

iterative classification