Optimized multi-resolution indexing and retrieval scheme of time series

Muhammad Marwan Muhammad Fuad

doi:10.1007/978-3-319-23485-4_61

Optimized multi-resolution indexing and retrieval scheme of time series

Muhammad Marwan Muhammad Fuad

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding › peer-review

1 Citation (Scopus)

Abstract

Multi-resolution representation has been successfully used for indexing and retrieval of time series. In a previous work we presented Tight-MIR, a multi-resolution representation method which speeds up the similarity search by using distances pre-computed at indexing time. At query time Tight-MIR applies two pruning conditions to filter out non-qualifying time series. Tight-MIR has the disadvantage of storing all the distances corresponding to all resolution levels, even those whose pruning power is low. At query time Tight-MIR also processes all stored resolution levels. In this paper we optimize the Tight-MIR algorithm by enabling it to store and process only the resolution levels with the maximum pruning power. The experiments we conducted on the new optimized version show that it does not only require less storage space, but it is also faster than the original algorithm.

Original language	English
Title of host publication	Progress in Artificial Intelligence - 17th Portuguese Conference on Artificial Intelligence, EPIA 2015, Proceedings
Editors	Francisco Pereira, Penousal Machado, Ernesto Costa, Amílcar Cardoso
Publisher	Springer-Verlag Italia
Pages	603-608
Number of pages	6
ISBN (Electronic)	9783319234854
ISBN (Print)	9783319234847
DOIs	https://doi.org/10.1007/978-3-319-23485-4_61
Publication status	Published - Sept 2015
Externally published	Yes
Event	17th Portuguese Conference on Artificial Intelligence - Coimbra, Portugal Duration: 8 Sept 2015 → 11 Sept 2015 Conference number: 17th

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9273
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	17th Portuguese Conference on Artificial Intelligence
Abbreviated title	EPIA 2015
Country/Territory	Portugal
City	Coimbra
Period	8/09/15 → 11/09/15

Keywords

Multi-resolution indexing and retrieval
Optimization
Tight-MIR
Time series

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-23485-4_61

Cite this

Muhammad Fuad, M. M. (2015). Optimized multi-resolution indexing and retrieval scheme of time series. In F. Pereira, P. Machado, E. Costa, & A. Cardoso (Eds.), Progress in Artificial Intelligence - 17th Portuguese Conference on Artificial Intelligence, EPIA 2015, Proceedings (pp. 603-608). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9273). Springer-Verlag Italia. https://doi.org/10.1007/978-3-319-23485-4_61

Optimized multi-resolution indexing and retrieval scheme of time series. / Muhammad Fuad, Muhammad Marwan.
Progress in Artificial Intelligence - 17th Portuguese Conference on Artificial Intelligence, EPIA 2015, Proceedings. ed. / Francisco Pereira; Penousal Machado; Ernesto Costa; Amílcar Cardoso. Springer-Verlag Italia, 2015. p. 603-608 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9273).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding › peer-review

Muhammad Fuad, MM 2015, Optimized multi-resolution indexing and retrieval scheme of time series. in F Pereira, P Machado, E Costa & A Cardoso (eds), Progress in Artificial Intelligence - 17th Portuguese Conference on Artificial Intelligence, EPIA 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9273, Springer-Verlag Italia, pp. 603-608, 17th Portuguese Conference on Artificial Intelligence, Coimbra, Portugal, 8/09/15. https://doi.org/10.1007/978-3-319-23485-4_61

Muhammad Fuad MM. Optimized multi-resolution indexing and retrieval scheme of time series. In Pereira F, Machado P, Costa E, Cardoso A, editors, Progress in Artificial Intelligence - 17th Portuguese Conference on Artificial Intelligence, EPIA 2015, Proceedings. Springer-Verlag Italia. 2015. p. 603-608. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Epub 2015 Aug 25. doi: 10.1007/978-3-319-23485-4_61

Muhammad Fuad, Muhammad Marwan. / Optimized multi-resolution indexing and retrieval scheme of time series. Progress in Artificial Intelligence - 17th Portuguese Conference on Artificial Intelligence, EPIA 2015, Proceedings. editor / Francisco Pereira ; Penousal Machado ; Ernesto Costa ; Amílcar Cardoso. Springer-Verlag Italia, 2015. pp. 603-608 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b96e8296c89d43b095b20d5a2e8a92e7,

title = "Optimized multi-resolution indexing and retrieval scheme of time series",

abstract = "Multi-resolution representation has been successfully used for indexing and retrieval of time series. In a previous work we presented Tight-MIR, a multi-resolution representation method which speeds up the similarity search by using distances pre-computed at indexing time. At query time Tight-MIR applies two pruning conditions to filter out non-qualifying time series. Tight-MIR has the disadvantage of storing all the distances corresponding to all resolution levels, even those whose pruning power is low. At query time Tight-MIR also processes all stored resolution levels. In this paper we optimize the Tight-MIR algorithm by enabling it to store and process only the resolution levels with the maximum pruning power. The experiments we conducted on the new optimized version show that it does not only require less storage space, but it is also faster than the original algorithm.",

keywords = "Multi-resolution indexing and retrieval, Optimization, Tight-MIR, Time series",

author = "{Muhammad Fuad}, {Muhammad Marwan}",

year = "2015",

month = sep,

doi = "10.1007/978-3-319-23485-4_61",

language = "English",

isbn = "9783319234847",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag Italia",

pages = "603--608",

editor = "Francisco Pereira and Penousal Machado and Ernesto Costa and Am{\'i}lcar Cardoso",

booktitle = "Progress in Artificial Intelligence - 17th Portuguese Conference on Artificial Intelligence, EPIA 2015, Proceedings",

address = "Italy",

note = "17th Portuguese Conference on Artificial Intelligence, EPIA 2015 ; Conference date: 08-09-2015 Through 11-09-2015",

}

TY - GEN

T1 - Optimized multi-resolution indexing and retrieval scheme of time series

AU - Muhammad Fuad, Muhammad Marwan

N1 - Conference code: 17th

PY - 2015/9

Y1 - 2015/9

N2 - Multi-resolution representation has been successfully used for indexing and retrieval of time series. In a previous work we presented Tight-MIR, a multi-resolution representation method which speeds up the similarity search by using distances pre-computed at indexing time. At query time Tight-MIR applies two pruning conditions to filter out non-qualifying time series. Tight-MIR has the disadvantage of storing all the distances corresponding to all resolution levels, even those whose pruning power is low. At query time Tight-MIR also processes all stored resolution levels. In this paper we optimize the Tight-MIR algorithm by enabling it to store and process only the resolution levels with the maximum pruning power. The experiments we conducted on the new optimized version show that it does not only require less storage space, but it is also faster than the original algorithm.

AB - Multi-resolution representation has been successfully used for indexing and retrieval of time series. In a previous work we presented Tight-MIR, a multi-resolution representation method which speeds up the similarity search by using distances pre-computed at indexing time. At query time Tight-MIR applies two pruning conditions to filter out non-qualifying time series. Tight-MIR has the disadvantage of storing all the distances corresponding to all resolution levels, even those whose pruning power is low. At query time Tight-MIR also processes all stored resolution levels. In this paper we optimize the Tight-MIR algorithm by enabling it to store and process only the resolution levels with the maximum pruning power. The experiments we conducted on the new optimized version show that it does not only require less storage space, but it is also faster than the original algorithm.

KW - Multi-resolution indexing and retrieval

KW - Optimization

KW - Tight-MIR

KW - Time series

UR - http://www.scopus.com/inward/record.url?scp=84945941379&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-23485-4_61

DO - 10.1007/978-3-319-23485-4_61

M3 - Conference proceeding

AN - SCOPUS:84945941379

SN - 9783319234847

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 603

EP - 608

BT - Progress in Artificial Intelligence - 17th Portuguese Conference on Artificial Intelligence, EPIA 2015, Proceedings

A2 - Pereira, Francisco

A2 - Machado, Penousal

A2 - Costa, Ernesto

A2 - Cardoso, Amílcar

PB - Springer-Verlag Italia

T2 - 17th Portuguese Conference on Artificial Intelligence

Y2 - 8 September 2015 through 11 September 2015

ER -

Optimized multi-resolution indexing and retrieval scheme of time series

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this