FRCU - GIICIS: Grupo de Investigación en Inteligencia Computacional e Ingeniería de Software - Artículos
Permanent URI for this collectionhttp://48.217.138.120/handle/20.500.12272/4095
Browse
5 results
Search Results
Item Graph representations for reinforcement learning(Universidad Nacional de La Plata. Facultad de Informática., 2024-04) Schab, Esteban Alejandro; Casanova Pietroboni, Carlos Antonio; Piccoli, María FabianaGraph analysis is becoming increasingly important due to the expressive power of graph models and the efficient algorithms available for processing them. Reinforcement Learning is one domain that could ben- efit from advancements in graph analysis, given that a learning agent may be integrated into an environ- ment that can be represented as a graph. Nevertheless, the structural irregularity of graphs and the lack of prior labels make it difficult to integrate such a model into modern Reinforcement Learning frameworks that rely on artificial neural networks. Graph embedding enables the learning of low-dimensional vector representations that are more suited for machine learning algorithms, while retaining essential graph features. This paper presents a framework for evaluating graph embedding algorithms and their ability to preserve the structure and relevant features of graphs by means of an internal validation metric, without resorting to subsequent tasks that require labels for training. Based on this framework, three defined algorithms that meet the necessary requirements for solving a specific problem of Reinforcement Learningin graphs are selected, analyzed, and compared. These algorithms are Graph2Vec, GL2Vec, and Wavelet Characteristics, with the latter two demonstrating superior performance.Item Hierarchical clustering-based framework for a posteriori exploration of pareto fronts : application on the bi-objective next release problem(Hector Florez, Universidad Distrital Francisco Jose de Caldas, Colombia., 2023-05-24) Casanova Pietroboni, Carlos Antonio; Schab, Esteban Alejandro; Prado, Lucas Martín; Rottoli, Giovani DaianWhen solving multi-objective combinatorial optimization problems using a search algorithm without a priori information, the result is a Pareto front. Selecting a solution from it is a laborious task if the number of solutions to be analyzed is large. This task would benefit from a systematic approach that facilitates the analysis, comparison and selection of a solution or a group of solutions based on the preferences of the decision makers. In the last decade, the research and development of algorithms for solving multi-objective combinatorial optimization problems has been growing steadily. In contrast, efforts in the a posteriori exploration of non-dominated solutions are still scarce.Item Multi-criteria and multi-expert requirement prioritization using fuzzy linguistic labels(ParadigmPlus, 2022-02-08) Rottoli, Giovani Daian; Casanova Pietroboni, Carlos AntonioRequirement prioritization in Software Engineering is the activity that helps to select and or-der for the requirements to be implemented in each software development process iteration. Thus, requirement prioritization assists the decision-making process during iteration management. This work presents a method for requirement prioritization that considers many experts’ opinions on multiple decision criteria provided using fuzzy linguistic labels, a tool that allows capturing the imprecision of each experts’ judgment. These opinions are then aggregated using the fuzzy ag-gregation operator MLIOWA considering different weights for each expert. Then, an order for the requirements is given considering the aggregated opinions and different weights for each evaluated dimension or criteria. The method proposed in this work has been implemented and demonstrated using a synthetic dataset. A statistical evaluation of the results obtained using different t-norms was also carried out.Item Optimización multiobjetivo difusa mediante enjambre de partículas aplicada al problema del próximo lanzamiento(2019-05-02) Casanova Pietroboni, Carlos Antonio; Rottoli, Giovanni Daián; Schab, Esteban Alejandro; De Battista, Anabella Cecilia; Tournoud, Adrián Alberto; Bracco, Luciano Joaquín; Pereyra Rausch, Fernando NahuelEn este trabajo se presenta un método novedoso basado en Enjambres de Partículas y Lógica Difusa para optimización multiobjetivo: el FMOPSO (Fuzzy Multi-Objective Particle Swarm Optimization). Este método se presenta en el contexto de la resolución de un problema clásico de la Ingeniería de Software Basada en Búsqueda: el Problema del Próximo Lanzamiento (Next Release Problem). Se realiza una prueba de concepto aplicando este algoritmo a una instancia bi-objetivo del problema mencionado anteriormente, y se lo compara con otra metaheurística del estado del arte. Finalmente, se concluye resaltando los resultados más importantes.Item Aproximación del frente pareto-óptimo de un problema NRP bi-objetivo mediante un algoritmo basado en enjambres de partículas(2018-10-26) Rottoli, Giovanni Daián; Schab, Esteban Alejandro; De Battista, Anabella Cecilia; Tournoud, Adrián Alberto; Bracco, Luciano Joaquín; Pereyra Rausch, Fernando Nahuel; Casanova Pietroboni, Carlos AntonioEn este trabajo se presenta un método novedoso basado en Enjambres de Partículas para la aproximación del frente Pareto-óptimo de un problema de optimización bi-objetivo, el problema del Next Release (NRP). Se define el problema en sus versiones mono y bi-objetivo, presentando una representación con Programación Lineal Entera. El método utiliza la teoría de Conjuntos Difusos para componer una función abstracta de aptitud, la cual es especializada por distintas partículas para realizar la búsqueda en distintos lugares del frente. Se realiza una prueba de concepto, aplicando el método a una instancia del problema y se compara con otra metaheurística del estado del arte. Finalmente, se concluye resaltando los resultados más importantes.