Persona:
Fernández Amoros, David José

Foto de perfil
Dirección de correo electrónico
ORCID
0000-0003-3758-0195
Fecha de nacimiento
Proyectos de investigación
Unidades organizativas
Puesto de trabajo
Apellidos
Fernández Amoros
Nombre de pila
David José
Nombre

Filtros

2020 - 20222
Restablecer filtros

Ajustes

Autor: Cobo, Manuel J. ×

Resultados de la búsqueda

Mostrando 1 - 2 de 2
  • Miniatura
    Publicación
    Group Decision-Making Based on Artificial Intelligence: A Bibliometric Analysis
    (MDPI, 2020) Heradio Gil, Rubén; Fernández Amoros, David José; Cobo, Manuel J.; Cerrada Collado, Cristina; https://orcid.org/0000-0002-7131-0482; https://orcid.org/0000-0001-6575-803X
    Decisions concerning crucial and complicated problems are seldom made by a single person. Instead, they require the cooperation of a group of experts in which each participant has their own individual opinions, motivations, background, and interests regarding the existing alternatives. In the last 30 years, much research has been undertaken to provide automated assistance to reach a consensual solution supported by most of the group members. Artificial intelligence techniques are commonly applied to tackle critical group decision-making difficulties. For instance, experts’ preferences are often vague and imprecise; hence, their opinions are combined using fuzzy linguistic approaches. This paper reports a bibliometric analysis of the ample literature published in this regard. In particular, our analysis: (i) shows the impact and upswing publication trend on this topic; (ii) identifies the most productive authors, institutions, and countries; (iii) discusses authors’ and journals’ productivity patterns; and (iv) recognizes the most relevant research topics and how the interest on them has evolved over the years.
  • Miniatura
    Publicación
    A Rule-Learning Approach for Detecting Faults in Highly Configurable Software Systems from Uniform Random Samples
    (2022) Heradio Gil, Rubén; Fernández Amoros, David José; Ruiz Parrado, Victoria; Cobo, Manuel J.; https://orcid.org/0000-0003-2993-7705; http://orcid.org/ 0000-0001-6575-803X
    Software systems tend to become more and more configurable to satisfy the demands of their increasingly varied customers. Exhaustively testing the correctness of highly configurable software is infeasible in most cases because the space of possible configurations is typically colossal. This paper proposes addressing this challenge by (i) working with a representative sample of the configurations, i.e., a ``uniform'' random sample, and (ii) processing the results of testing the sample with a rule induction system that extracts the faults that cause the tests to fail. The paper (i) gives a concrete implementation of the approach, (ii) compares the performance of the rule learning algorithms AQ, CN2, LEM2, PART, and RIPPER, and (iii) provides empirical evidence supporting our procedure