loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Muhammad Marwan Muhammad Fuad and Pierre-François Marteau

Affiliation: Université Européenne de Bretagne, France

ISBN: 978-989-8425-22-5

Keyword(s): Time Series Information Retrieval, Symbolic Aggregate Approximation, Fast SAX.

Related Ontology Subjects/Areas/Topics: Business Analytics ; Communication and Software Technologies and Architectures ; Data and Information Retrieval ; Data Engineering ; Data Warehouses and Data Mining ; e-Business ; Enterprise Information Systems

Abstract: The similarity search problem is one of the main problems in time series data mining. Traditionally, this problem was tackled by sequentially comparing the given query against all the time series in the database, and returning all the time series that are within a predetermined threshold of that query. But the large size and the high dimensionality of time series databases that are in use nowadays make that scenario inefficient. There are many representation techniques that aim at reducing the dimensionality of time series so that the search can be handled faster at a lower-dimensional space level. The symbolic aggregate approximation (SAX) is one of the most competitive methods in the literature. In this paper we present a new method that improves the performance of SAX by adding to it another exclusion condition that increases the exclusion power. This method is based on using two representations of the time series: one of SAX and the other is based on an optimal approximation of th e time series. Pre-computed distances are calculated and stored offline to be used online to exclude a wide range of the search space using two exclusion conditions. We conduct experiments which show that the new method is faster than SAX. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.214.184.124

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Muhammad Fuad M.; Marteau P. and (2010). TOWARDS A FASTER SYMBOLIC AGGREGATE APPROXIMATION METHOD.In Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-989-8425-22-5, pages 305-310. DOI: 10.5220/0003006703050310

@conference{icsoft10,
author={Muhammad Marwan {Muhammad Fuad} and Pierre{-}Fran\c{C}ois Marteau},
title={TOWARDS A FASTER SYMBOLIC AGGREGATE APPROXIMATION METHOD},
booktitle={Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2010},
pages={305-310},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003006703050310},
isbn={978-989-8425-22-5},
}

TY - CONF

JO - Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - TOWARDS A FASTER SYMBOLIC AGGREGATE APPROXIMATION METHOD
SN - 978-989-8425-22-5
AU - Muhammad Fuad, M.
AU - Marteau, P.
PY - 2010
SP - 305
EP - 310
DO - 10.5220/0003006703050310

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.