Revista y Edición

Volumen 12 (2022): Edición 3 (July 2022)

Volumen 12 (2022): Edición 2 (April 2022)

Volumen 12 (2022): Edición 1 (January 2022)

Volumen 11 (2021): Edición 4 (October 2021)

Volumen 11 (2021): Edición 3 (July 2021)

Volumen 11 (2021): Edición 2 (April 2021)

Volumen 11 (2021): Edición 1 (January 2021)

Volumen 10 (2020): Edición 4 (October 2020)

Volumen 10 (2020): Edición 3 (July 2020)

Volumen 10 (2020): Edición 2 (April 2020)

Volumen 10 (2020): Edición 1 (January 2020)

Volumen 9 (2019): Edición 4 (October 2019)

Volumen 9 (2019): Edición 3 (July 2019)

Volumen 9 (2019): Edición 2 (April 2019)

Volumen 9 (2019): Edición 1 (January 2019)

Volumen 8 (2018): Edición 4 (October 2018)

Volumen 8 (2018): Edición 3 (July 2018)

Volumen 8 (2018): Edición 2 (April 2018)

Volumen 8 (2018): Edición 1 (January 2018)

Volumen 7 (2017): Edición 4 (October 2017)

Volumen 7 (2017): Edición 3 (July 2017)

Volumen 7 (2017): Edición 2 (April 2017)

Volumen 7 (2017): Edición 1 (January 2017)

Volumen 6 (2016): Edición 4 (October 2016)

Volumen 6 (2016): Edición 3 (July 2016)

Volumen 6 (2016): Edición 2 (April 2016)

Volumen 6 (2016): Edición 1 (January 2016)

Volumen 5 (2015): Edición 4 (October 2015)

Volumen 5 (2015): Edición 3 (July 2015)

Volumen 5 (2015): Edición 2 (April 2015)

Volumen 5 (2015): Edición 1 (January 2015)

Volumen 4 (2014): Edición 4 (October 2014)

Volumen 4 (2014): Edición 3 (July 2014)

Volumen 4 (2014): Edición 2 (April 2014)

Volumen 4 (2014): Edición 1 (January 2014)

Volumen 3 (2013): Edición 4 (October 2013)

Volumen 3 (2013): Edición 3 (July 2013)

Volumen 3 (2013): Edición 2 (April 2013)

Volumen 3 (2013): Edición 1 (January 2013)

Detalles de la revista
Formato
Revista
eISSN
2449-6499
Publicado por primera vez
30 Dec 2014
Periodo de publicación
4 veces al año
Idiomas
Inglés

Buscar

Volumen 10 (2020): Edición 3 (July 2020)

Detalles de la revista
Formato
Revista
eISSN
2449-6499
Publicado por primera vez
30 Dec 2014
Periodo de publicación
4 veces al año
Idiomas
Inglés

Buscar

5 Artículos
Acceso abierto

Evolutionary Algorithm with a Configurable Search Mechanism

Publicado en línea: 23 May 2020
Páginas: 151 - 171

Resumen

Abstract

In this paper, we propose a new population-based evolutionary algorithm that automatically configures the used search mechanism during its operation, which consists in choosing for each individual of the population a single evolutionary operator from the pool. The pool of operators comes from various evolutionary algorithms. With this idea, a flexible balance between exploration and exploitation of the problem domain can be achieved. The approach proposed in this paper might offer an inspirational alternative in creating evolutionary algorithms and their modifications. Moreover, different strategies for mutating those parts of individuals that encode the used search operators are also taken into account. The effectiveness of the proposed algorithm has been tested using typical benchmarks used to test evolutionary algorithms.

Palabras clave

  • evolutionary algorithm
  • population-based algorithm
  • optimization
  • operator pool
  • operator selection
  • individual selection
Acceso abierto

An Algorithm for the Evolutionary-Fuzzy Generation of on-Line Signature Hybrid Descriptors

Publicado en línea: 23 May 2020
Páginas: 173 - 187

Resumen

Abstract

In biometrics, methods which are able to precisely adapt to the biometric features of users are much sought after. They use various methods of artificial intelligence, in particular methods from the group of soft computing. In this paper, we focus on on-line signature verification. Such signatures are complex objects described not only by the shape but also by the dynamics of the signing process. In standard devices used for signature acquisition (with an LCD touch screen) this dynamics may include pen velocity, but sometimes other types of signals are also available, e.g. pen pressure on the screen surface (e.g. in graphic tablets), the angle between the pen and the screen surface, etc. The precision of the on-line signature dynamics processing has been a motivational springboard for developing methods that use signature partitioning. Partitioning uses a well-known principle of decomposing the problem into smaller ones. In this paper, we propose a new partitioning algorithm that uses capabilities of the algorithms based on populations and fuzzy systems. Evolutionary-fuzzy partitioning eliminates the need to average dynamic waveforms in created partitions because it replaces them. Evolutionary separation of partitions results in a better matching of partitions with reference signatures, eliminates dispro-portions between the number of points describing dynamics in partitions, eliminates the impact of random values, separates partitions related to the signing stage and its dynamics (e.g. high and low velocity of signing, where high and low are imprecise-fuzzy concepts). The operation of the presented algorithm has been tested using the well-known BioSecure DS2 database of real dynamic signatures.

Palabras clave

  • biometrics
  • on-line signature
  • dynamic signature
  • dynamic signature verification
  • evolutionary-fuzzy signature partitioning
  • horizontal and vertical partitioning
Acceso abierto

Multi Agent Deep Learning with Cooperative Communication

Publicado en línea: 23 May 2020
Páginas: 189 - 207

Resumen

Abstract

We consider the problem of multi agents cooperating in a partially-observable environment. Agents must learn to coordinate and share relevant information to solve the tasks successfully. This article describes Asynchronous Advantage Actor-Critic with Communication (A3C2), an end-to-end differentiable approach where agents learn policies and communication protocols simultaneously. A3C2 uses a centralized learning, distributed execution paradigm, supports independent agents, dynamic team sizes, partially-observable environments, and noisy communications. We compare and show that A3C2 outperforms other state-of-the-art proposals in multiple environments.

Palabras clave

  • multi-agent systems
  • deep reinforcement learning
  • centralized learning
Acceso abierto

A New Method for Automatic Determining of the DBSCAN Parameters

Publicado en línea: 23 May 2020
Páginas: 209 - 221

Resumen

Abstract

Clustering is an attractive technique used in many fields in order to deal with large scale data. Many clustering algorithms have been proposed so far. The most popular algorithms include density-based approaches. These kinds of algorithms can identify clusters of arbitrary shapes in datasets. The most common of them is the Density-Based Spatial Clustering of Applications with Noise (DBSCAN). The original DBSCAN algorithm has been widely applied in various applications and has many different modifications. However, there is a fundamental issue of the right choice of its two input parameters, i.e the eps radius and the MinPts density threshold. The choice of these parameters is especially difficult when the density variation within clusters is significant. In this paper, a new method that determines the right values of the parameters for different kinds of clusters is proposed. This method uses detection of sharp distance increases generated by a function which computes a distance between each element of a dataset and its k-th nearest neighbor. Experimental results have been obtained for several different datasets and they confirm a very good performance of the newly proposed method.

Palabras clave

  • clustering algorithms
  • DBSCAN
  • data mining
Acceso abierto

Detecting Visual Objects by Edge Crawling

Publicado en línea: 23 May 2020
Páginas: 223 - 237

Resumen

Abstract

Content-based image retrieval methods develop rapidly with a growing scale of image repositories. They are usually based on comparing and indexing some image features. We developed a new algorithm for finding objects in images by traversing their edges. Moreover, we describe the objects by histograms of local features and angles. We use such a description to retrieve similar images fast. We performed extensive experiments on three established image datasets proving the effectiveness of the proposed method.

Palabras clave

  • content-based image retrieval
  • crawler
  • edge detection
  • image descriptor
  • object extraction
5 Artículos
Acceso abierto

Evolutionary Algorithm with a Configurable Search Mechanism

Publicado en línea: 23 May 2020
Páginas: 151 - 171

Resumen

Abstract

In this paper, we propose a new population-based evolutionary algorithm that automatically configures the used search mechanism during its operation, which consists in choosing for each individual of the population a single evolutionary operator from the pool. The pool of operators comes from various evolutionary algorithms. With this idea, a flexible balance between exploration and exploitation of the problem domain can be achieved. The approach proposed in this paper might offer an inspirational alternative in creating evolutionary algorithms and their modifications. Moreover, different strategies for mutating those parts of individuals that encode the used search operators are also taken into account. The effectiveness of the proposed algorithm has been tested using typical benchmarks used to test evolutionary algorithms.

Palabras clave

  • evolutionary algorithm
  • population-based algorithm
  • optimization
  • operator pool
  • operator selection
  • individual selection
Acceso abierto

An Algorithm for the Evolutionary-Fuzzy Generation of on-Line Signature Hybrid Descriptors

Publicado en línea: 23 May 2020
Páginas: 173 - 187

Resumen

Abstract

In biometrics, methods which are able to precisely adapt to the biometric features of users are much sought after. They use various methods of artificial intelligence, in particular methods from the group of soft computing. In this paper, we focus on on-line signature verification. Such signatures are complex objects described not only by the shape but also by the dynamics of the signing process. In standard devices used for signature acquisition (with an LCD touch screen) this dynamics may include pen velocity, but sometimes other types of signals are also available, e.g. pen pressure on the screen surface (e.g. in graphic tablets), the angle between the pen and the screen surface, etc. The precision of the on-line signature dynamics processing has been a motivational springboard for developing methods that use signature partitioning. Partitioning uses a well-known principle of decomposing the problem into smaller ones. In this paper, we propose a new partitioning algorithm that uses capabilities of the algorithms based on populations and fuzzy systems. Evolutionary-fuzzy partitioning eliminates the need to average dynamic waveforms in created partitions because it replaces them. Evolutionary separation of partitions results in a better matching of partitions with reference signatures, eliminates dispro-portions between the number of points describing dynamics in partitions, eliminates the impact of random values, separates partitions related to the signing stage and its dynamics (e.g. high and low velocity of signing, where high and low are imprecise-fuzzy concepts). The operation of the presented algorithm has been tested using the well-known BioSecure DS2 database of real dynamic signatures.

Palabras clave

  • biometrics
  • on-line signature
  • dynamic signature
  • dynamic signature verification
  • evolutionary-fuzzy signature partitioning
  • horizontal and vertical partitioning
Acceso abierto

Multi Agent Deep Learning with Cooperative Communication

Publicado en línea: 23 May 2020
Páginas: 189 - 207

Resumen

Abstract

We consider the problem of multi agents cooperating in a partially-observable environment. Agents must learn to coordinate and share relevant information to solve the tasks successfully. This article describes Asynchronous Advantage Actor-Critic with Communication (A3C2), an end-to-end differentiable approach where agents learn policies and communication protocols simultaneously. A3C2 uses a centralized learning, distributed execution paradigm, supports independent agents, dynamic team sizes, partially-observable environments, and noisy communications. We compare and show that A3C2 outperforms other state-of-the-art proposals in multiple environments.

Palabras clave

  • multi-agent systems
  • deep reinforcement learning
  • centralized learning
Acceso abierto

A New Method for Automatic Determining of the DBSCAN Parameters

Publicado en línea: 23 May 2020
Páginas: 209 - 221

Resumen

Abstract

Clustering is an attractive technique used in many fields in order to deal with large scale data. Many clustering algorithms have been proposed so far. The most popular algorithms include density-based approaches. These kinds of algorithms can identify clusters of arbitrary shapes in datasets. The most common of them is the Density-Based Spatial Clustering of Applications with Noise (DBSCAN). The original DBSCAN algorithm has been widely applied in various applications and has many different modifications. However, there is a fundamental issue of the right choice of its two input parameters, i.e the eps radius and the MinPts density threshold. The choice of these parameters is especially difficult when the density variation within clusters is significant. In this paper, a new method that determines the right values of the parameters for different kinds of clusters is proposed. This method uses detection of sharp distance increases generated by a function which computes a distance between each element of a dataset and its k-th nearest neighbor. Experimental results have been obtained for several different datasets and they confirm a very good performance of the newly proposed method.

Palabras clave

  • clustering algorithms
  • DBSCAN
  • data mining
Acceso abierto

Detecting Visual Objects by Edge Crawling

Publicado en línea: 23 May 2020
Páginas: 223 - 237

Resumen

Abstract

Content-based image retrieval methods develop rapidly with a growing scale of image repositories. They are usually based on comparing and indexing some image features. We developed a new algorithm for finding objects in images by traversing their edges. Moreover, we describe the objects by histograms of local features and angles. We use such a description to retrieve similar images fast. We performed extensive experiments on three established image datasets proving the effectiveness of the proposed method.

Palabras clave

  • content-based image retrieval
  • crawler
  • edge detection
  • image descriptor
  • object extraction

Planifique su conferencia remota con Sciendo