The Longest Common Subsequence Distance using a Complexity Factor

Octavian Lucian Hasna; Rodica Potolea

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

The Longest Common Subsequence Distance using a Complexity Factor

Topics: Clustering and Classification Methods; Software Development

In Proceedings of the 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 0IC3K, 336-343, 2016 , Porto, Portugal

Authors: Octavian Lucian Hasna and Rodica Potolea

Affiliation: Technical University of Cluj-Napoca, Romania

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

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

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 (IC3K 2016) - KDIR; ISBN 978-989-758-203-5; ISSN 2184-3228, SciTePress, 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 (IC3K 2016) - KDIR},
year={2016},
pages={336-343},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006067603360343},
isbn={978-989-758-203-5},
issn={2184-3228},
}

TY - CONF

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