Octavian Lucian Hasna
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Octavian Lucian Hasna has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Rodica Potolea
Department of Computer Science Technical University of Cluj-Napoca Cluj-Napoca Romania
4 shared publications Rodica Potolea
Computer Science Department, Technical University of Cluj-Napoca
3 shared publications- Florin Cristian Macicasan
Technical University of Cluj-Napoca
2 shared publications - Mihaela Dînşoreanu
Department of Computer Science, Technical University of Cluj-Napoca, Cluj-Napoca, Romania
2 shared publications Florin Cristian Macicasan
Technical University of Cluj-Napoca, Romania
1 shared publicationMihaela Dinsoreanu
Technical University of Cluj-Napoca, Romania
1 shared publication
Latest Publications
- 18 December 2018
- Published by Springer Nature
- p. 268-278
Analysing a Periodical and Multi-dimensional Time Series
- 18 December 2018
- Published by Springer Nature
- p. 268-278
Analysing a Periodical and Multi-dimensional Time Series
- 14 September 2017
- Published by Computing in Cardiology
Robust Feature Extraction from Noisy ECG for Atrial Fibrillation Detection
- 14 September 2017
- Published by Computing in Cardiology
Robust Feature Extraction from Noisy ECG for Atrial Fibrillation Detection
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 231-238
Time series — A taxonomy based survey
The interest in time-series classification has increased in the last decade. Most of the proposals introduced new algorithms for classification, clustering and prediction. Most of the algorithms are dealing with two major aspects: dimensionality reduction techniques (ex: Piecewise Approximation Aggregation, Symbolic Aggregate Approximation etc.) and similarity measures (ex: Euclidean distance, Dynamic Time Warping etc.). In this article, we give an overview on the advantages and disadvantages of these algorithms.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 231-238
Time series — A taxonomy based survey
The interest in time-series classification has increased in the last decade. Most of the proposals introduced new algorithms for classification, clustering and prediction. Most of the algorithms are dealing with two major aspects: dimensionality reduction techniques (ex: Piecewise Approximation Aggregation, Symbolic Aggregate Approximation etc.) and similarity measures (ex: Euclidean distance, Dynamic Time Warping etc.). In this article, we give an overview on the advantages and disadvantages of these algorithms.
- Open Access
- 1 January 2016
- Published by INSTICC
- p. 336-343
The Longest Common Subsequence Distance using a Complexity Factor
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.
- 1 January 2016
- Published by INSTICC
- p. 336-343
Open AccessThe Longest Common Subsequence Distance using a Complexity Factor
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.
- 28 October 2015
- Published by Springer Nature
- p. 212-227
Modeling Sentiment Polarity with Meta-features to Achieve Domain-Independence
- 28 October 2015
- Published by Springer Nature
- p. 212-227
Modeling Sentiment Polarity with Meta-features to Achieve Domain-Independence
- 1 January 2014
- Published by INSTICC
- p. 126-137
Sentiment Polarity Extension for Context-Sensitive Recommender Systems
- 1 January 2014
- Published by INSTICC
- p. 126-137
Sentiment Polarity Extension for Context-Sensitive Recommender Systems
- 1 January 2012
- Published by INSTICC
- p. 85-94
A Unified Approach for Context-sensitive Recommendations
The SCITEPRESS Digital Library offers online access to all papers presented at INSTICC conferences, as well as a few conferences organized by others.
- 1 January 2012
- Published by INSTICC
- p. 85-94
A Unified Approach for Context-sensitive Recommendations
The SCITEPRESS Digital Library offers online access to all papers presented at INSTICC conferences, as well as a few conferences organized by others.