mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Discovering Key Sequences in Time Series Data for Pattern Classification
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0002-5562-1424
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0001-9857-4317
2006 (English)In: Advances in Data Mining. Applications in Medicine, Web Mining, Marketing, Image and Signal Mining: 6th Industrial Conference on Data Mining, ICDM 2006, Leipzig, Germany, July 14-15, 2006. Proceedings, 2006, p. 492-505Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
2006. p. 492-505
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4065
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:mdh:diva-6925DOI: 10.1007/11790853_38ISI: 000239623700038Scopus ID: 2-s2.0-33746468591ISBN: 978-3-540-36036-0 (print)OAI: oai:DiVA.org:mdh-6925DiVA, id: diva2:236935
Conference
6th Industrial Conference on Data Mining, ICDM 2006, Leipzig, Germany, July 14-15, 2006.
Available from: 2009-09-25 Created: 2009-09-25 Last updated: 2018-08-21Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Funk, PeterXiong, Ning

Search in DiVA

By author/editor
Funk, PeterXiong, Ning
By organisation
Department of Computer Science and Electronics
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 20 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf