Pasar al contenido principal

DESARROLLO DE UN SISTEMA DE APRENDIZAJE BASADO EN MINERIA DE DATOS Y VISION ARTIFICIAL PARA ENTORNOS COLABORATIVOS EN FABRICACION

DPI2016-79960-C3-2-P

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D (Excelencia / Generación de Conocimiento)
Año convocatoria 2016
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE LEÓN

Resultados relacionados

Resultados totales (Incluyendo duplicados): 6
Encontrada(s) 1 página(s)

BULERIA. Repositorio Institucional de la Universidad de León
Publicación Artículo científico (JournalArticle)

Robust weighted regression via PAELLA sample weights, Regresión ponderada robusta usando los pesos muestrales de PAELLA

  • Castejón Limas, Manuel
  • Alaiz Moretón, Héctor
  • Fernández Robles, Laura
  • Sánchez González, Lidia
  • Fernández Llamas, Camino
  • Pérez García, Hilde
[EN] This paper reports the usage of the occurrence vector provided by the PAELLA algorithm in the context of robust regression. PAELLA was originally conceived as an outlier detection and data cleaning technique. A novel approach is to use this algorithm not for discarding outliers but to generate information related to the reliability of the observations recorded in the dataset. This approach proves to provide successful results when compared to traditional common practice such as outlier removal. A set of experiments using a contrived difficult artificial dataset are described using both neural networks and classical polynomial fitting. Finally, a successful comparison of our approach to two state-of-the-art algorithms proves the benefits of using the PAELLA algorithm in the context of robust regression., SI, Ministerio de Economía, Industria y Competitividad
BULERIA. Repositorio Institucional de la Universidad de León
Publicación Artículo científico (JournalArticle)

Use of classifiers and recursive feature elimination to assess boar sperm viability, Uso de clasificadores y eliminación recursiva de características para valolar la viabilidad del semen de verraco

  • Sánchez González, Lidia
  • Fernández Robles, Laura
  • Castejón Limas, Manuel
  • Alfonso Cendón, Javier
  • Pérez García, Hilde
  • Quintián, Héctor
  • Corchado, Emilio
[EN] This paper extends previous work on the assessment of boar sperm cells in order to discriminate amongst intact or reacted acrosomes for fertility purposes. The aim of the study reported is twofold. On one hand to assess the quality of a different set of classifiers. On the other, to assess the feasibility of applying dimension-reduction techniques in order to simplify the classification process. The supervised classification techniques used are Extremely Randomized Trees, Random Forest, Support Vector Machines and Gaussian Naive Bayes. The data sets used describe the local maximum gradient, the local mean gray levels and the local standard deviation along the inner contours of the sperm cells. The procedure to obtain these features is explained along as their mathematical nature. The first experiment reported uses each of the three data sets for performing a grid search with 50-fold cross validation in order to evaluate the scores of each classifier. The second experiment reported integrates the three previous data sets into a single one. After performing a recursive feature elimination stage to this data set the results show that only 5 of 840 features suffice in order to provide satisfactory results according to veterinary experts., SI, Ministerio de Economía, Industria y Competitividad
BULERIA. Repositorio Institucional de la Universidad de León
Publicación Artículo científico (JournalArticle)

Non-removal strategy for outliers in predictive models: The PAELLA algorithm case, Estrategia sin remoción para espureos en modelos predictivos: El caso del algoritmo PAELLA

  • Castejón Limas, Manuel
  • Alaiz Moretón, Héctor
  • Fernández Robles, Laura
  • Alfonso Cendón, Javier
  • Fernández Llamas, Camino
  • Sánchez González, Lidia
  • Pérez García, Hilde
[EN] This paper reports the experience of using the PAELLA algorithm as a helper tool in robust regression instead of as originally intended for outlier identification and removal. This novel usage of the algorithm takes advantage of the occurrence vector calculated by the algorithm in order to strengthen the effect of the more reliable samples and lessen the impact of those that otherwise would be considered outliers. Following that aim, a series of experiments are conducted in order to learn how to better use the information contained in the occurrence vector. Using a contrively difficult artificial dataset, a reference predictive model is fit using the whole raw dataset. The second experiment reports the results of fitting a similar predictive model but discarding the samples marked as outliers by PAELLA. The third experiment uses the occurrence vector provided by PAELLA in order to classify the observations in multiple bins and fit every possible model changing which bins are considered for fitting and which are discarded in that particular model. The fourth experiment introduces a sampling process before fitting in which the occurrence vector represents the likelihood of being considered in the training dataset. The fifth experiment considers the sampling process as an internal step to be performed interleaved between the training epochs. The last experiment compares our approach using weighted neural networks to a state of the art method., SI, Ministerio de Economía, Industria y Competitividad
BULERIA. Repositorio Institucional de la Universidad de León
Publicación Artículo científico (JournalArticle)

3D Tdoa Problem Solution with Four Receiving Nodes

  • Díez González, Javier
  • Álvarez, Rubén
  • Sánchez González, Lidia
  • Fernández Robles, Laura
  • Pérez García, Hilde
  • Castejón Limas, Manuel
[EN] Time difference of arrival (TDOA) positioning methods have experienced growing importance over the last few years due to their multiple applications in local positioning systems (LPSs). While five sensors are needed to determine an unequivocal three-dimensional position, systems with four nodes present two different solutions that cannot be discarded according to mathematical standards. In this paper, a new methodology to solve the 3D TDOA problems in a sensor network with four beacons is proposed. A confidence interval, which is defined in this paper as a sphere, is defined to use positioning algorithms with four different nodes. It is proven that the separation between solutions in the four-beacon TDOA problem allows the transformation of the problem into an analogous one in which more receivers are implied due to the geometric properties of the intersection of hyperboloids. The achievement of the distance between solutions needs the application of genetic algorithms in order to find an optimized sensor distribution. Results show that positioning algorithms can be used 96.7% of the time with total security in cases where vehicles travel at less than 25 m/s., SI, Ministerio de Economía, Industria y Competitividad
BULERIA. Repositorio Institucional de la Universidad de León
Publicación Artículo científico (JournalArticle)

Genetic Algorithm Approach to the 3D Node Localization in TDOA Systems

  • Díez González, Javier
  • Álvarez, Rubén
  • Gonzalez Bárcena, David
  • Sánchez González, Lidia
  • Castejón Limas, Manuel
  • Pérez García, Hilde
[EN] Positioning asynchronous architectures based on time measurements are reaching growing importance in Local Positioning Systems (LPS). These architectures have special relevance in precision applications and indoor/outdoor navigation of automatic vehicles such as Automatic Ground Vehicles (AGVs) and Unmanned Aerial Vehicles (UAVs). The positioning error of these systems is conditioned by the algorithms used in the position calculation, the quality of the time measurements, and the sensor deployment of the signal receivers. Once the algorithms have been defined and the method to compute the time measurements has been selected, the only design criteria of the LPS is the distribution of the sensors in the three-dimensional space. This problem has proved to be NP-hard, and therefore a heuristic solution to the problem is recommended. In this paper, a genetic algorithm with the flexibility to be adapted to different scenarios and ground modelings is proposed. This algorithm is used to determine the best node localization in order to reduce the Cramér-Rao Lower Bound (CRLB) with a heteroscedastic noise consideration in each sensor of an Asynchronous Time Difference of Arrival (A-TDOA) architecture. The methodology proposed allows for the optimization of the 3D sensor deployment of a passive A-TDOA architecture, including ground modeling flexibility and heteroscedastic noise consideration with sequential iterations, and reducing the spatial discretization to achieve better results. Results show that optimization with 15% of elitism and a Tournament 3 selection strategy offers the best maximization for the algorithm., SI, Ministerio de Economía, Industria y Competitividad
BULERIA. Repositorio Institucional de la Universidad de León
Publicación Artículo científico (JournalArticle)

Accuracy Analysis in Sensor Networks for Asynchronous Positioning Methods

  • Álvarez, Rubén
  • Díez González, Javier
  • Alonso, Efrén
  • Fernández Robles, Laura
  • Castejón Limas, Manuel
  • Pérez García, Hilde
[EN] The accuracy requirements for sensor network positioning have grown over the last few years due to the high precision demanded in activities related with vehicles and robots. Such systems involve a wide range of specifications which must be met through positioning devices based on time measurement. These systems have been traditionally designed with the synchronization of their sensors in order to compute the position estimation. However, this synchronization introduces an error in the time determination which can be avoided through the centralization of the measurements in a single clock in a coordinate sensor. This can be found in typical architectures such as Asynchronous Time Difference of Arrival (A-TDOA) and Difference-Time Difference of Arrival (D-TDOA) systems. In this paper, a study of the suitability of these new systems based on a Cramér-Rao Lower Bound (CRLB) evaluation was performed for the first time under different 3D real environments for multiple sensor locations. The analysis was carried out through a new heteroscedastic noise variance modelling with a distance-dependent Log-normal path loss propagation model. Results showed that A-TDOA provided less uncertainty in the root mean square error (RMSE) in the positioning, while D-TDOA reduced the standard deviation and increased stability all over the domain., SI, Ministerio de Economía, Industria y Competitividad, This research was funded by the Spanish Ministry of Economy, Industry and Competitiveness, grant number DPI2016-79960-C3-2-P.