loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Octavian Lucian Hasna and Rodica Potolea

Affiliation: Technical University of Cluj-Napoca, Romania

ISBN: 978-989-758-203-5

Keyword(s): Time Series, Classification, Longest Common Subsequence, Discretize, Complexity.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Clustering and Classification Methods ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Software Development ; Symbolic Systems

Abstract: In this paper we study the classic longest common subsequence problem and we use the length of the longest common subsequence as a similarity measure between two time series. We propose an original algorithm for computing the approximate length of the LCSS that uses a discretization step, a complexity invariant factor and a dynamic threshold used for skipping the computation.

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.233.226.151

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:
Hasna, O. and Potolea, R. (2016). The Longest Common Subsequence Distance using a Complexity Factor.In Proceedings of the 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2016) ISBN 978-989-758-203-5, pages 336-343. DOI: 10.5220/0006067603360343

@conference{kdir16,
author={Octavian Lucian Hasna. and Rodica Potolea.},
title={The Longest Common Subsequence Distance using a Complexity Factor},
booktitle={Proceedings of the 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2016)},
year={2016},
pages={336-343},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006067603360343},
isbn={978-989-758-203-5},
}

TY - CONF

JO - Proceedings of the 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2016)
TI - The Longest Common Subsequence Distance using a Complexity Factor
SN - 978-989-758-203-5
AU - Hasna, O.
AU - Potolea, R.
PY - 2016
SP - 336
EP - 343
DO - 10.5220/0006067603360343

Login or register to post comments.

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