A Fast and Memory-Efficient Algorithm for Learning and Retrieval of Phenotypic Dynamics in Multivariate Cohort Time Series

被引:0
|
作者
Nemati, Shamim [1 ]
Ghassemi, Mohammad M. [2 ]
机构
[1] Harvard Sch Engn & Appl Sci, 33 Oxford St, Cambridge, MA 02138 USA
[2] MIT, Cambridge, MA 02139 USA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Robust navigation and mining of physiologic time series databases often requires finding similar temporal patterns of physiological responses. Detection of these complex physiological patterns not only enables demarcation of important clinical events but can also elucidate hidden dynamical structures that may be suggestive of disease processes. Some specific examples where this physiological signal search may be useful include real-time detection of cardiac arrhythmias, sleep staging or detection of seizure onset. In all these cases, being able to identify a cohort of patients who exhibit similar physiological dynamics could be useful in prognosis and informing treatment strategies. However, pattern recognition for physiological time series is complicated by changes between operating regimes and measurement artifacts. Here we briefly describe an approach we have developed for distributed identification of dynamical patterns in physiological time series using a switching linear dynamical system (SLDS). We present a fast and memory-efficient algorithm for learning and retrieval of phenotypic dynamics in large clinical time series databases. Through simulation we show that the proposed algorithm is at least an order of magnitude faster that the state of the art, and provide encouraging preliminary results based on real recordings of vital sign time series from the Multiparameter Intelligent Monitoring in Intensive Care (MIMIC-II) database.
引用
收藏
页数:4
相关论文
共 50 条
  • [1] Fast Memory-efficient Extreme Events Prediction in Complex Time series
    Wambura, Stephen
    Li, He
    Nigussie, Alemu
    PROCEEDINGS OF 2020 3RD INTERNATIONAL CONFERENCE ON ROBOT SYSTEMS AND APPLICATIONS, ICRSA2020, 2020, : 60 - 69
  • [2] A memory-efficient and fast Huffman decoding algorithm
    Chen, HC
    Wang, YL
    Lan, YF
    INFORMATION PROCESSING LETTERS, 1999, 69 (03) : 119 - 122
  • [3] A Fast and Memory-Efficient Hierarchical Graph Clustering Algorithm
    Szilagyi, Laszlo
    Szilagyi, Sandor Miklos
    Hirsbrunner, Beat
    NEURAL INFORMATION PROCESSING (ICONIP 2014), PT I, 2014, 8834 : 247 - 254
  • [4] A FAST AND MEMORY-EFFICIENT ALGORITHM FOR ROBUST PCA (MEROP)
    Narayanamurthy, Praneeth
    Vaswani, Namrata
    2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2018, : 4684 - 4688
  • [5] A fast and memory-efficient hierarchical graph clustering algorithm
    Szilágyi, László
    Szilágyi, Sándor Miklós
    Hirsbrunner, Béat
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8834 : 247 - 254
  • [6] Memory-efficient Centroid Decomposition for Long Time Series
    Khayati, Mourad
    Boehlen, Michael
    Gamper, Johann
    2014 IEEE 30TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2014, : 100 - 111
  • [7] A fast, memory-efficient and parallelizable arc/circle segmentation algorithm
    Wang, Fei
    Yuan, Zejian
    Zheng, Nanning
    Liu, Yuehu
    APPLIED MATHEMATICS AND COMPUTATION, 2008, 205 (02) : 841 - 848
  • [8] An Efficient Clustering Algorithm for Multivariate Time Series
    Zhou, Da-Zhuo
    Zhang, Bo
    EBM 2010: INTERNATIONAL CONFERENCE ON ENGINEERING AND BUSINESS MANAGEMENT, VOLS 1-8, 2010, : 5190 - 5193
  • [9] ELOF: fast and memory-efficient anomaly detection algorithm in data streams
    Yang, Yun
    Chen, Liang
    Fan, ChongJun
    SOFT COMPUTING, 2021, 25 (06) : 4283 - 4294
  • [10] A MEMORY-EFFICIENT FAST FOURIER TRANSFORMATION ALGORITHM FOR CRYSTALLOGRAPHIC REFINEMENT ON SUPERCOMPUTERS
    BRUNGER, AT
    ACTA CRYSTALLOGRAPHICA SECTION A, 1989, 45 : 42 - 50