Mining similar temporal patterns in long time-series data and its application to medicine

被引：24

作者：

Hirano, S ^{[1
]}

Tsumoto, S ^{[1
]}

机构：

[1] Shimane Med Univ, Sch Med, Dept Med Informat, Izumo, Shimane 6938501, Japan

来源：

2002 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/ICDM.2002.1183906

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Data mining in time-series medical databases has been receiving considerable attention since it provides a way of revealing useful information hidden in the database; for example relationships between temporal course of examination results and onset time of diseases. This paper presents a new method for finding similar patterns in temporal sequences. The method is a hybridization of phase-constraint multiscale matching and rough clustering. Multiscale matching enables us cross-scale comparison of the sequences, namely, it enable us to compare temporal patterns by partially changing observation scales. Rough clustering enable us to construct interpretable clusters of the sequences even if their similarities are given as relative similarities. We combine these methods and cluster the sequences according to multiscale similarity of patterns. Experimental results on the chronic hepatitis dataset showed that clusters demonstrating interesting temporal patterns were successfully discovered.

引用

页码：219 / 226

页数：8

共 17 条

[1]

Agrawal R., 1993, P 4 INT C FDN DAT OR, V730, P69

[2]

Anderberg M. R., 1973, CLUSTER ANAL APPL, DOI DOI 10.1016/C2013-0-06161-0

[3]

Bezdek J. C., 1981, Pattern recognition with fuzzy objective function algorithms

[4] Efficient time series matching by wavelets [J].

Chan, KP ;

Fu, AWC .

15TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 1999, :126-133

[5] MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].

DEMPSTER, AP ;

LAIRD, NM ;

RUBIN, DB .

JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38

[6]

Guha S., 1998, SIGMOD Record, V27, P73, DOI 10.1145/276305.276312

[7] Indiscernibility degree of objects for evaluating simplicity of knowledge in the clustering procedure [J].

Hirano, S ;

Tsumoto, S .

2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, :211-217

[8] Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases [J].

Eamonn Keogh ;

Kaushik Chakrabarti ;

Michael Pazzani ;

Sharad Mehrotra .

Knowledge and Information Systems, 2001, 3 (3) :263-286

[9]

KORN F, 1997, P ACM SIGMOD INT C M, P289, DOI DOI 10.1145/253260.253332

[10] SCALE-BASED DESCRIPTION AND RECOGNITION OF PLANAR CURVES AND TWO-DIMENSIONAL SHAPES [J].

MOKHTARIAN, F ;

MACKWORTH, A .

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1986, 8 (01) :34-43

← 1 2 →