TY - GEN
T1 - Enhancing the symbolic aggregate approximation method using updated lookup tables
AU - Muhammad Fuad, Muhammad Marwan
AU - Marteau, Pierre François
PY - 2010/11/23
Y1 - 2010/11/23
N2 - Similarity search in time series data mining is a problem that has attracted increasing attention recently. The high dimensionality and large volume of time series databases make sequential scanning inefficient to tackle this problem. 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. Symbolic representation is one of the promising techniques, since symbolic representation methods try to benefit from the wealth of search algorithms used in bioinformatics and text mining communities. The symbolic aggregate approximation (SAX) is one of the most competitive methods in the literature. SAX utilizes a similarity measure that is easy to compute because it is based on pre-computed distances obtained from lookup tables. In this paper we present a new similarity measure that is almost as easy to compute as the original similarity measure, but it is tighter because it uses updated lookup tables. In addition, the new similarity measure is more intuitive than the original one. We conduct several experiments which show that the new similarity measure gives better results than the original one.
AB - Similarity search in time series data mining is a problem that has attracted increasing attention recently. The high dimensionality and large volume of time series databases make sequential scanning inefficient to tackle this problem. 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. Symbolic representation is one of the promising techniques, since symbolic representation methods try to benefit from the wealth of search algorithms used in bioinformatics and text mining communities. The symbolic aggregate approximation (SAX) is one of the most competitive methods in the literature. SAX utilizes a similarity measure that is easy to compute because it is based on pre-computed distances obtained from lookup tables. In this paper we present a new similarity measure that is almost as easy to compute as the original similarity measure, but it is tighter because it uses updated lookup tables. In addition, the new similarity measure is more intuitive than the original one. We conduct several experiments which show that the new similarity measure gives better results than the original one.
KW - Symbolic Aggregate Approximation
KW - Symbolic Representation
KW - Time Series Data Mining
KW - Updated Minimum Distance
UR - http://www.scopus.com/inward/record.url?scp=78449264705&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15387-7_46
DO - 10.1007/978-3-642-15387-7_46
M3 - Conference proceeding
AN - SCOPUS:78449264705
SN - 978-3-642-15386-0
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 420
EP - 431
BT - Knowledge-Based and Intelligent Information and Engineering Systems - 14th International Conference, KES 2010, Proceedings
PB - Springer
T2 - 14th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2010
Y2 - 8 September 2010 through 10 September 2010
ER -