Listar DIAN-Artículos, capítulos... por autor "1a254a6c-19fe-4d71-8264-beff4a934d90"

Mostrando ítems 1-6 de 6

    • A new approach for optimal offline time-series segmentation with error bound guarantee 

      Carmona Poyato, Ángel; Fernández García, Nicolás Luis; Madrid-Cuevas, F.J.; Durán Rosal, Antonio Manuel (Elsevier, 2021)
      This paper proposes a new optimal approach, called OSFS, based on feasible space (FS) Liu et al. (2008)[, that minimizes the number of segments of the approximation and guarantees the error bound using the L∞-norm. On the ...

    • A new approach for optimal time-series segmentation 

      Carmona Poyato, Ángel; Fernández García, Nicolás Luis; Madrid-Cuevas, F.J.; Durán Rosal, Antonio Manuel (Elsevier, 2020)
      This paper proposes a new optimal approach, called OSTS, to improve the segmentation of time series. The proposed method is based on A* algorithm and it uses an improved version of the well-known Salotti method for obtaining ...

    • A new thresholding approach for automatic generation of polygonal approximations 

      Fernández García, Nicolás Luis; Moral Martínez, Luis del; Carmona Poyato, Ángel; Medina-Carnicer, R.; Madrid-Cuevas, F.J. (Elsevier, 2016)
      The present paper proposes a new algorithm for automatic generation of polygonal approximations of 2D closed contours based on a new thresholding method. The new proposal computes the signi cance level of the contour points ...

    • Assessing polygonal approximations: A new measurement and a comparative study 

      Fernández García, Nicolás Luis; Moral Martínez, Luis del; Carmona Poyato, Ángel; Madrid-Cuevas, F.J.; Medina-Carnicer, R. (Elsevier, 2023)
      Two proposals related to the evaluation of polygonal approximations are presented in this document. First, a new measurement, called normalized compression ratio and adjustment error (NCA), to provide a fair evaluation of ...

    • Optimal online time-series segmentation 

      Carmona Poyato, Ángel; Fernández García, Nicolás Luis; Madrid-Cuevas, F.J.; Muñoz-Salinas, Rafael; Romero Ramírez, Francisco J. (Springer, 2024)
      When time series are processed, the difficulty increases with the size of the series. This fact is aggravated when time series are processed online, since their size increases indefinitely. Therefore, reducing their number ...

    • Unsupervised generation of polygonal approximations based on the convex hull 

      Fernández García, Nicolás Luis; Moral Martínez, Luis del; Carmona Poyato, Ángel; Madrid-Cuevas, F.J.; Medina-Carnicer, R. (Elsevier, 2020)
      The present paper proposes a new non-optimal but unsupervised algorithm, called ICT-RDP, for generation of polygonal approximations based on the convex hull. Firstly, the new algorithm takes into account the convex hull ...