Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2011 Nov 12:2011:358-365.
doi: 10.1109/BIBM.2011.39.

A Pattern Mining Approach for Classifying Multivariate Temporal Data

Affiliations

A Pattern Mining Approach for Classifying Multivariate Temporal Data

Iyad Batal et al. Proceedings (IEEE Int Conf Bioinformatics Biomed). .

Abstract

We study the problem of learning classification models from complex multivariate temporal data encountered in electronic health record systems. The challenge is to define a good set of features that are able to represent well the temporal aspect of the data. Our method relies on temporal abstractions and temporal pattern mining to extract the classification features. Temporal pattern mining usually returns a large number of temporal patterns, most of which may be irrelevant to the classification task. To address this problem, we present the minimal predictive temporal patterns framework to generate a small set of predictive and non-spurious patterns. We apply our approach to the real-world clinical task of predicting patients who are at risk of developing heparin induced thrombocytopenia. The results demonstrate the benefit of our approach in learning accurate classifiers, which is a key step for developing intelligent clinical monitoring systems.

PubMed Disclaimer

Figures

Figure 1
Figure 1
An example illustrating the trend and value abstractions. The dashed lines represent the 25th and 75th percentiles and the solid lines represent the 5th and 95th percentiles.
Figure 2
Figure 2
A temporal pattern with states 〈A1, B2, C3, A2〉 and temporal relations R1,2 = c, R1,3 = b, R1,4 = b, R2,3 = c, R2,4 = b and R3,4 = c.
Figure 3
Figure 3
A high-level description of candidate generation. The algorithm takes as input the frequent k-patterns (Fk) and returns the candidate (k+1)-patterns (Cand) together with their pid-lists.
Figure 4
Figure 4
The number of patterns return by TP_all, TP_chi, MPTP and A-MPTP for different minimum supports.
Figure 5
Figure 5
The running time of TP_Apriori, TP_id-lists, MPTP and A-MPTP for different minimum supports.

References

    1. Weng X, Shen J. Classification of multivariate time series using two-dimensional singular value decomposition. Knowledge-Based Systems. 2008;21:535–539.
    1. Li L, Prakash BA, Faloutsos C. Parsimonious linear fingerprinting for time series. PVLDB; 2010.
    1. Batal I, Hauskrecht M. A supervised time series feature extraction technique using dct and dwt. ICMLA; 2009.
    1. Shahar Y. A Framework for Knowledge-Based Temporal Abstraction. Artificial Intelligence. 1997;90:79–133. - PubMed
    1. Allen F. Towards a general theory of action and time. Artificial Intelligence. 1984;23:123–154.

LinkOut - more resources