A Probabilistic Finite-State Automata Framework for Monitoring Long-Term Activities of Daily Living

被引:0
|
作者
Li, Mianjun [1 ]
Chen, Peter C. Y. [1 ]
机构
[1] Natl Univ Singapore, Dept Mech Engn, Singapore 117575, Singapore
关键词
D O I
10.1109/CDC49753.2023.10384287
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Aging is an increasingly challenging healthcare issue with long-term sociopolitical implications, requiring more sophisticated management of healthcare services for the elderly. A key element in managing such services is the knowledge about a typical elderly person's Activities of Daily Living (ADLs). However, there is little study on the model-based objective and standardized ADLs assessment. This paper presents the concept of tracking the health status of the elderly by monitoring their individual patterns of ADLs: the specific pattern of the elderly model as probabilistic state-transition structures, and the transition probabilities in such a probabilistic model are considered as a representation of the health status of a typical older person. The typical pattern of ADLs changes with the health status due to changes in the residential environment, progressive aging, or the onset of certain diseases. Such changes are reflected (over time) in the model, and therefore monitoring the transition probabilities to assess ADLs represents a possible way to track the health status of an older person and to alert relevant health service professionals if some change that warrants subsequent careful medical attention.
引用
收藏
页码:1716 / 1723
页数:8
相关论文
共 50 条
  • [1] Computation of moments for probabilistic finite-state automata
    Andreu Sanchez, Joan
    Romero, Veronica
    INFORMATION SCIENCES, 2020, 516 (516) : 388 - 400
  • [2] Long-term Monitoring of Activities of Daily Living in Home Environment
    Kang, Dong Won
    Choi, Jin Seung
    Lee, Kang Hwi
    Kim, Hyung Sik
    Chung, Soon Cheol
    Lee, Jeong Whan
    Tack, Gye Rae
    PROCEEDINGS OF FIRST JOINT INTERNATIONAL PRE-OLYMPIC CONFERENCE OF SPORTS SCIENCE AND SPORTS ENGINEERING, VOL I: COMPUTER SCIENCE IN SPORTS, 2008, : 97 - 102
  • [3] Recurrent Neural Language Models as Probabilistic Finite-state Automata
    Svete, Anej
    Cotterell, Ryan
    2023 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING, EMNLP 2023, 2023, : 8069 - 8086
  • [4] Recognition of Human Activity Based on Probabilistic Finite-State Automata
    Viard, K.
    Fanti, M. P.
    Faraut, G.
    Lesage, J-J
    2017 22ND IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2017,
  • [5] Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
    Huang, Mingzhang
    Fu, Hongfei
    Katoen, Joost-Pieter
    INFORMATION AND COMPUTATION, 2019, 268
  • [6] Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems
    Fu, Hongfei
    Katoen, Joost-Pieter
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 445 - 456
  • [7] Program comprehension using information retrieval and probabilistic finite-state automata
    Chen, Hua
    Wang, Can
    Chen, Chun
    Tang, Wen-Bin
    Qian, Jian-Fei
    Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science), 2008, 42 (12): : 2108 - 2111
  • [8] Human Activity Discovery and Recognition Using Probabilistic Finite-State Automata
    Viard, Kevin
    Fanti, Maria Pia
    Faraut, Gregory
    Lesage, Jean-Jacques
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2020, 17 (04) : 2085 - 2096
  • [9] A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
    Kucera, Antonin
    Mayr, Richard
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2018, 91 : 82 - 103
  • [10] A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
    Kucera, A
    Mayr, R
    EXPLORING NEW FRONTIERS OF THEORETICAL INFORMATICS, 2004, 155 : 395 - 408