You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Discovering Key Sequences in Time Series Data for Pattern Classification

Fulltext:


Authors:

Peter Funk, Ning Xiong

Research groups:

Artificial Intelligence and Intelligent Systems
Learning and Optimisation

Publication Type:

Conference/Workshop Paper

Venue:

6th Industrial Conference on Data Mining, ICDM 2006

Publisher:

Springer, LNAI 4065

Abstract

This paper addresses the issue of discovering key sequences from time series data for pattern classification. The aim is to find from a symbolic database all sequences that are both indicative and non-redundant. A sequence as such is called a key sequence in the paper. In order to solve this problem we first we establish criteria to evaluate sequences in terms of the measures of evaluation base and discriminating power. The main idea is to accept those sequences appearing frequently and possessing high co-occurrences with consequents as indicative ones. Then a sequence search algorithm is proposed to locate indicative sequences in the search space. Nodes encountered during the search procedure are handled appropriately to enable completeness of the search results while removing redundancy. We also show that the key sequences identified can later be utilized as strong evidences in probabilistic reasoning to determine to which class a new time series most probably belongs.

Bibtex

@inproceedings{Funk954,
author = {Peter Funk and Ning Xiong},
title = {Discovering Key Sequences in Time Series Data for Pattern Classification},
editor = {Petra Perner},
pages = {492--505},
month = {July},
year = {2006},
booktitle = {6th Industrial Conference on Data Mining, ICDM 2006},
publisher = {Springer, LNAI 4065},
url = {http://www.es.mdu.se/publications/954-}
}