Characterizing activity sequences using profile Hidden Markov Models

被引:42
|
作者
Liu, Feng [1 ]
Janssens, Davy [1 ]
Cui, JianXun [2 ]
Wets, Geert [1 ]
Cools, Mario [3 ]
机构
[1] Hasselt Univ, Transportat Res Inst IMOB, B-3590 Diepenbeek, Belgium
[2] Harbin Inst Technol, Dept Transport Engn, Harbin 1500, Peoples R China
[3] Univ Liege, LEMA, B-4000 Liege, Belgium
关键词
Profile Hidden Markov Models (pHMMs); Sequence Alignment Methods (SAM); Multiple sequence alignments; Activity sequences; Activity-travel diaries; Mobile phone data; OPTIMAL MATCHING ANALYSIS; ACTIVITY PATTERNS; TIME-USE; ALIGNMENT; SPACE; RECOGNITION; SYSTEM; CLASSIFICATION; IDENTIFICATION; SERVICES;
D O I
10.1016/j.eswa.2015.02.057
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In literature, activity sequences, generated from activity-travel diaries, have been analyzed and classified into clusters based on the composition and ordering of the activities using Sequence Alignment Methods (SAM). However, using these methods, only the frequent activities in each cluster are extracted and qualitatively described; the infrequent activities and their related travel episodes are disregarded. Thus, to quantify the occurrence probabilities of all the daily activities as well as their sequential orders, we develop a novel process to build multiple alignments of the sequences and subsequently derive profile Hidden Markov Models (pHMMs). This process consists of 4 major steps. First, activity sequences are clustered based on a pre-defined scheme. The frequent activities along with their sequential orders are then identified in each cluster, and they are subsequently used as a template to guide the construction of a multiple alignment of the cluster of sequences. Finally, a pHMM is employed to convert the multiple alignment into a position-specific scoring system, representing the probability of each frequent activity at each important position of the alignment as well as the probabilities of both insertion and deletion of infrequent activities. By applying the derived pHMMs to a set of activity-travel diaries collected in Belgium as well as a group of mobile phone call location data recorded in Switzerland, the potemial and effectiveness of the models in capturing the sequential features of each cluster and distinguishing them from those of other clusters, are demonstrated. The proposed method can also be utilized to improve activity-based transportation model validation and travel survey designs. Furthermore, it offers a wide application in characterizing a group of any related sequences, particularly sequences varying in length and with a high frequency of short sequences that are typically present in human behavior. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:5705 / 5722
页数:18
相关论文
共 50 条
  • [21] Training Hidden Markov Models on Incomplete Sequences
    Popov, Alexander A.
    Gultyaeva, Tatyana A.
    Uvarov, Vadim E.
    2016 13TH INTERNATIONAL SCIENTIFIC-TECHNICAL CONFERENCE ON ACTUAL PROBLEMS OF ELECTRONIC INSTRUMENT ENGINEERING (APEIE), VOL 2, 2016, : 317 - 320
  • [22] Quasi-consensus-based comparison of profile hidden Markov models for protein sequences
    Kahsay, RY
    Wang, GL
    Gao, G
    Liao, L
    Dunbrack, R
    BIOINFORMATICS, 2005, 21 (10) : 2287 - 2293
  • [23] On the Search for Retrotransposons: Alternative Protocols to Obtain Sequences to Learn Profile Hidden Markov Models
    Fischer, Carlos N.
    Campos, Victor De A.
    Barella, Victor H.
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2018, 25 (05) : 517 - 527
  • [24] Similarity-based clustering of sequences using hidden Markov models
    Bicego, M
    Murino, V
    Figueiredo, MAT
    MACHINE LEARNING AND DATA MINING IN PATTERN RECOGNITION, PROCEEDINGS, 2003, 2734 : 86 - 95
  • [25] Detecting homogeneous segments in DNA sequences by using hidden Markov models
    Boys, RJ
    Henderson, DA
    Wilkinson, DJ
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES C-APPLIED STATISTICS, 2000, 49 : 269 - 285
  • [26] Similarity-based classification of sequences using hidden Markov models
    Bicego, M
    Murino, V
    Figueiredo, MAT
    PATTERN RECOGNITION, 2004, 37 (12) : 2281 - 2291
  • [27] Recognition of incomplete sequences using Fisher scores and hidden Markov models
    Uvarov, V. E.
    Popov, A. A.
    Gultyaeva, T. A.
    XI INTERNATIONAL SCIENTIFIC AND TECHNICAL CONFERENCE - APPLIED MECHANICS AND DYNAMICS SYSTEMS, 2018, 944
  • [28] Characterizing the Effectiveness of Tutorial Dialogue with Hidden Markov Models
    Boyer, Kristy Elizabeth
    Phillips, Robert
    Ingram, Amy
    Ha, Eun Young
    Wallis, Michael
    Vouk, Mladen
    Lester, James
    INTELLIGENT TUTORING SYSTEMS, PT 1, PROCEEDINGS, 2010, 6094 : 55 - +
  • [29] A Framework for Characterizing the Value of Information in Hidden Markov Models
    Wang, Zijing
    Badiu, Mihai-Alin
    Coon, Justin P.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) : 5203 - 5216
  • [30] Characterizing an outbreak of vancomycin-resistant enterococci using hidden Markov models
    McBryde, E. S.
    Pettitt, A. N.
    Cooper, B. S.
    McElwain, D. L. S.
    JOURNAL OF THE ROYAL SOCIETY INTERFACE, 2007, 4 (15) : 745 - 754