Skip to main content

SISTEMAS DE INFERENCIA PARA INFORMACION INCONSISTENTE: ANALISIS ARGUMENTATIVO

PID2019-111544GB-C22

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE LLEIDA

Resultados relacionados

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

Repositori Obert UdL
Publication Capítulo o parte de un libro (BookPart)

Feature Necessity & Relevancy in ML Classifier Explanations

  • Huang, Xuanxiang
  • Cooper, Martin C.
  • Morgado, Antonio
  • Planes Cid, Jordi
  • Marques-Silva, Joao
Given a machine learning (ML) model and a prediction, explanations can be defined as sets of features which are sufficient for the prediction. In some applications, and besides asking for an explanation, it is also critical to understand whether sensitive features can occur in some explanation, or whether a non-interesting feature must occur in all explanations. This paper starts by relating such queries respectively with the problems of relevancy and necessity in logic-based abduction. The paper then proves membership and hardness results for several families of ML classifiers. Afterwards the paper proposes concrete algorithms for two classes of classifiers. The experimental results confirm the scalability of the proposed algorithms., This work was supported by the AI Interdisciplinary Institute ANITI, funded by the French program “Investing for the Future – PIA3” under Grant agreement no. ANR-19-PI3A-0004, and by the H2020-ICT38 project COALA “Cognitive Assisted agile manufacturing for a Labor force supported by trustworthy Artificial intelligence”, and funded by the Spanish Ministry of Science and Innovation (MICIN) under project PID2019-111544GB-C22, and by a María Zambrano fellowship and a Requalification fellowship financed by Ministerio de Universidades of Spain and by European Union – NextGenerationEU.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Argumentation Reasoning with Graph Isomorphism Networks for Reddit Conversation Analysis

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Gibert Llauradó, Daniel
  • Planes Cid, Jordi
The automated analysis of different trends in online debating forums is an interesting tool for sampling the agreement between citizens in different topics. In previous work, we have defined computational models to measure different values in these online debating forums. One component in these models has been the identification of the set of accepted posts by an argumentation problem that characterizes this accepted set through a particular argumentation acceptance semantics. A second component is the classification of posts into two groups: the ones that agree with the root post of the debate, and the ones that disagree with it. Once we compute the set of accepted posts, we compute the different measures we are interested to get from the debate, as functions defined over the bipartition of the posts and the set of accepted posts. In this work, we propose to explore the use of graph neural networks (GNNs), based on graph isomorphism networks, to solve the problem of computing these measures, using as input the debate tree, instead of using our previous argumentation reasoning system. We focus on the particular online debate forum Reddit, and on the computation of a measure of the polarization in the debate. We explore the use of two different approaches: one where a single GNN model computes directly the polarization of the debate, and another one where the polarization is computed using two different GNNs: the first one to compute the accepted posts of the debate, and the second one to compute the bipartition of the posts of the debate. Our results over a set of Reddit debates show that GNNs can be used to compute the polarization measure with an acceptable error, even if the number of layers of the network is bounded by a constant. We observed that the model based on a single GNN shows the lowest error, yet the one based on two GNNs has more flexibility to compute additional measures from the debates. We also compared the execution time of our GNN-based models with a previous approach based on a distributed algorithm for the computation of the accepted posts, and observed a better performance., This work was partially funded by Spanish Project PID2019-111544GB-C22, and by the Universitat de Lleida Requalifcation (2021–2023) under the EU Next Generation.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Enhancing the insertion of NOP instructions to obfuscate malware via deep reinforcement learning

  • Gibert Llauradó, Daniel
  • Fredrikson, Matt
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
Current state-of-the-art research for tackling the problem of malware detection and classification is centered on the design, implementation and deployment of systems powered by machine learning because of its ability to generalize to never-before-seen malware families and polymorphic mutations. However, it has been shown that machine learning models, in partidular deep neural networks, lack robustness against crafted inputs (adversarial examples). In this work, we have investigated the vulnerability of a state-of-the-art shallow convolutional neural network malware classifier against the deat code insertion technique. We propose a general framework powered by a Double Q-network to induce misclassification over malware families. The framework trains an agent through a convolutional neural network to select the optimal positions in a code sequence to insert dead code instructions so that the machine learning classifier mislabels the resulting executable. The experiments show that the proposed method significantly drops the classification accuracy of the classifier to 56.53% while having an evasion rate of 100% for the samples belonging to Kelihos_ver3, Simda, and Kelihos_ver1 families. In addition, the average number of instructions needed to mislabel malware in comparison to a random agent decreased by 33%., This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 847402. This research has been partially funded by the Spanish MICINN Projects TIN2015-71799-C2-2-P, ENE2015-64117-C5-1-R, PID2019-111544GB-C22, and supported by the University of Lleida.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Machine learning solutions in sewer systems: a bibliometric analysis

  • Ribalta Gené, Marc
  • Béjar Torres, Ramón
  • Mateu Piñol, Carles
  • Rubión Soler, Edgar
The use of machine learning solutions has been rising recently, and the water domain is reaping several benefits from its application. However, there is still room in the literature regarding machine learning applied to sewer systems. In this article, we study applied solutions to the predictive problem of four factors in the sewer: pipe defects, sedimentation, and failure and blockage events. Even with the number of publications available to solve each problem, there is still a need for improvement. This article aims to identify existing literature gaps through a bibliometric analysis based on data extracted from Scopus and Web of Science. Results show an increasing trend in published papers studying the domain and identify different knowledge gaps within the literature related to the correct use of data, the need for models capable of generalization, and the identification of novel techniques to be studied in the future., The work described in this paper has been conducted within the project SCOREwater. This project has received funding from the European Union’s Horizon 2020 Research and Innovation Programme under grant agreement no 820751. Ramón Béjar acknowledges funding from the Spanish Ministry of Science and Innovation, under project PID2019-111544GB-C22. Marc Ribalta also acknowledges funding from Agència de Gestió d’Ajuts Universitaris i de Recerca (AGAUR) DI-2019-066
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Approximate and Optimal Solutions for the Bipartite Polarization Problem

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Martínez Rodríguez, Santi
In a recent work we introduced a problem about finding the highest polarized bipartition on a weighted and labeled graph that represents a debate developed trough some social network, where nodes represent user’s opinions and edges agreement or disagreement between users. Finding this target bipartition is an optimization problem that can be seen as a generalization of the maxcut problem, so we first introduced a basic local search algorithm to find approximate solutions of the problem. In this paper we go one step further, and we present an exact algorithm for finding the optimal solution, based on an integer programming formulation, and compare the performance of a new variant of our local search algorithm with the exact algorithm. Our results show that at least on real instances of the problem, obtained from Reddit debates, the approximate solutions obtained are almost always identical to the optimal solutions., This work was partially funded by Spanish Project PID2019- 111544GB-C22 (MINECO / FEDER), by the European Union’s Horizon 2020 Research and Innovation Program under Grant Agreements 723596, 768824, 764025 and 814945, and by 2017 SGR 1537.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Measuring Polarization in Online Debates

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Martínez Rodríguez, Santi
Social networks can be a very successful tool to engage users to discuss relevant topics for society. However, there are also some dangers that are associated with them, such as the emergence of polarization in online discussions. Recently, there has been a growing interest to try to understand this phenomenon, as some consider that this can be harmful concerning the building of a healthy society in which citizens get used to polite discussions and even listening to opinions that may be different from theirs. In this work, we face the problem of defining a precise measure that can quantify in a meaningful way the level of polarization present in an online discussion. We focus on the Reddit social network, given that its primary focus is to foster discussions, in contrast to other social networks that have some other uses. Our measure is based on two different characteristics of an online discussion: the existence of a balanced bipartition of the users of the discussion, where one partition contains mainly users in agreement (regarding the topic of the discussion) and the other users in disagreement, and the degree of negativity of the sentiment of the interactions between these two groups of users. We discuss how different characteristics of the discussions affect the value of our polarization measure, and we finally perform an empirical evaluation over different sets of Reddit discussions about diverse classes of topics. Our results seem to indicate that our measure can capture differences in the polarization level of different discussions, which can be further understood when analyzing the values of the different factors used to define the measure., This research was funded by Spanish Project PID2019-111544GB-C22 (MINECO/FEDER), by the European Union’s Horizon 2020 Research and Innovation Program under Grant Agreements 723596, 768824, 764025 and 814945, and by 2017 SGR 1537.
Repositori Obert UdL
Publication Artículo científico (JournalArticle)

Fusing feature engineering and deep learning: A case study for malware classification

  • Gibert Llauradó, Daniel
  • Planes Cid, Jordi
  • Mateu Piñol, Carles
  • Le, Quan
Machine learning has become an appealing signature-less approach to detect and classify malware because of its ability to generalize to never-before-seen samples and to handle large volumes of data. While traditional feature-based approaches rely on the manual design of hand-crafted features based on experts’ knowledge of the domain, deep learning approaches replace the manual feature engineering process by an underlying system, typically consisting of a neural network with multiple layers, that perform both feature learning and classification altogether. However, the combination of both approaches could substantially enhance detection systems. In this paper we present an hybrid approach to address the task of malware classification by fusing multiple types of features defined by experts and features learned through deep learning from raw data. In particular, our approach relies on deep learning to extract N-gram like features from the assembly language instructions and the bytes of malware, and texture patterns and shapelet-based features from malware’s grayscale image representation and structural entropy, respectively. These deep features are later passed as input to a gradient boosting model that combines the deep features and the hand-crafted features using an early-fusion mechanism. The suitability of our approach has been evaluated on the Microsoft Malware Classification Challenge benchmark and results show that the proposed solution achieves state-of-the-art performance and outperforms gradient boosting and deep learning methods in the literature., This project has received funding from Enterprise Ireland and the European Union’s Horizon 2020 Research and Innovation Programme under the Marie Skłodowska-Curie grant agreement No 847402, and from the Spanish Science and Innovation Ministry funded project PID2019-111544GB-C22. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of CeADAR, University College Dublin, and the University of Lleida.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Machine learning solutions in sewer systems: a bibliometric analysis

  • Ribalta Gené, Marc
  • Béjar Torres, Ramón
  • Mateu Piñol, Carles
  • Rubión Soler, Edgar
The use of machine learning solutions has been rising recently, and the water domain is reaping several benefits from its application. However, there is still room in the literature regarding machine learning applied to sewer systems. In this article, we study applied solutions to the predictive problem of four factors in the sewer: pipe defects, sedimentation, and failure and blockage events. Even with the number of publications available to solve each problem, there is still a need for improvement. This article aims to identify existing literature gaps through a bibliometric analysis based on data extracted from Scopus and Web of Science. Results show an increasing trend in published papers studying the domain and identify different knowledge gaps within the literature related to the correct use of data, the need for models capable of generalization, and the identification of novel techniques to be studied in the future., The work described in this paper has been conducted within the project SCOREwater. This project has received funding from the European Union’s Horizon 2020 Research and Innovation Programme under grant agreement no 820751. Ramón Béjar acknowledges funding from the Spanish Ministry of Science and Innovation, under project PID2019-111544GB-C22. Marc Ribalta also acknowledges funding from Agència de Gestió d’Ajuts Universitaris i de Recerca (AGAUR) DI-2019-066
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Enhancing the insertion of NOP instructions to obfuscate malware via deep reinforcement learning

  • Gibert Llauradó, Daniel
  • Fredrikson, Matt
  • Mateu Piñol, Carles
  • Planes Cid, Jordi
Current state-of-the-art research for tackling the problem of malware detection and classification is centered on the design, implementation and deployment of systems powered by machine learning because of its ability to generalize to never-before-seen malware families and polymorphic mutations. However, it has been shown that machine learning models, in partidular deep neural networks, lack robustness against crafted inputs (adversarial examples). In this work, we have investigated the vulnerability of a state-of-the-art shallow convolutional neural network malware classifier against the deat code insertion technique. We propose a general framework powered by a Double Q-network to induce misclassification over malware families. The framework trains an agent through a convolutional neural network to select the optimal positions in a code sequence to insert dead code instructions so that the machine learning classifier mislabels the resulting executable. The experiments show that the proposed method significantly drops the classification accuracy of the classifier to 56.53% while having an evasion rate of 100% for the samples belonging to Kelihos_ver3, Simda, and Kelihos_ver1 families. In addition, the average number of instructions needed to mislabel malware in comparison to a random agent decreased by 33%., This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 847402. This research has been partially funded by the Spanish MICINN Projects TIN2015-71799-C2-2-P, ENE2015-64117-C5-1-R, PID2019-111544GB-C22, and supported by the University of Lleida.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Fusing feature engineering and deep learning: A case study for malware classification

  • Gibert Llauradó, Daniel
  • Planes Cid, Jordi
  • Mateu Piñol, Carles
  • Le, Quan
Machine learning has become an appealing signature-less approach to detect and classify malware because of its ability to generalize to never-before-seen samples and to handle large volumes of data. While traditional feature-based approaches rely on the manual design of hand-crafted features based on experts’ knowledge of the domain, deep learning approaches replace the manual feature engineering process by an underlying system, typically consisting of a neural network with multiple layers, that perform both feature learning and classification altogether. However, the combination of both approaches could substantially enhance detection systems. In this paper we present an hybrid approach to address the task of malware classification by fusing multiple types of features defined by experts and features learned through deep learning from raw data. In particular, our approach relies on deep learning to extract N-gram like features from the assembly language instructions and the bytes of malware, and texture patterns and shapelet-based features from malware’s grayscale image representation and structural entropy, respectively. These deep features are later passed as input to a gradient boosting model that combines the deep features and the hand-crafted features using an early-fusion mechanism. The suitability of our approach has been evaluated on the Microsoft Malware Classification Challenge benchmark and results show that the proposed solution achieves state-of-the-art performance and outperforms gradient boosting and deep learning methods in the literature., This project has received funding from Enterprise Ireland and the European Union’s Horizon 2020 Research and Innovation Programme under the Marie Skłodowska-Curie grant agreement No 847402, and from the Spanish Science and Innovation Ministry funded project PID2019-111544GB-C22. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of CeADAR, University College Dublin, and the University of Lleida.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Measuring Polarization in Online Debates

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Martínez Rodríguez, Santi
Social networks can be a very successful tool to engage users to discuss relevant topics for society. However, there are also some dangers that are associated with them, such as the emergence of polarization in online discussions. Recently, there has been a growing interest to try to understand this phenomenon, as some consider that this can be harmful concerning the building of a healthy society in which citizens get used to polite discussions and even listening to opinions that may be different from theirs. In this work, we face the problem of defining a precise measure that can quantify in a meaningful way the level of polarization present in an online discussion. We focus on the Reddit social network, given that its primary focus is to foster discussions, in contrast to other social networks that have some other uses. Our measure is based on two different characteristics of an online discussion: the existence of a balanced bipartition of the users of the discussion, where one partition contains mainly users in agreement (regarding the topic of the discussion) and the other users in disagreement, and the degree of negativity of the sentiment of the interactions between these two groups of users. We discuss how different characteristics of the discussions affect the value of our polarization measure, and we finally perform an empirical evaluation over different sets of Reddit discussions about diverse classes of topics. Our results seem to indicate that our measure can capture differences in the polarization level of different discussions, which can be further understood when analyzing the values of the different factors used to define the measure., This research was funded by Spanish Project PID2019-111544GB-C22 (MINECO/FEDER), by the European Union’s Horizon 2020 Research and Innovation Program under Grant Agreements 723596, 768824, 764025 and 814945, and by 2017 SGR 1537.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Approximate and Optimal Solutions for the Bipartite Polarization Problem

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Martínez Rodríguez, Santi
In a recent work we introduced a problem about finding the highest polarized bipartition on a weighted and labeled graph that represents a debate developed trough some social network, where nodes represent user’s opinions and edges agreement or disagreement between users. Finding this target bipartition is an optimization problem that can be seen as a generalization of the maxcut problem, so we first introduced a basic local search algorithm to find approximate solutions of the problem. In this paper we go one step further, and we present an exact algorithm for finding the optimal solution, based on an integer programming formulation, and compare the performance of a new variant of our local search algorithm with the exact algorithm. Our results show that at least on real instances of the problem, obtained from Reddit debates, the approximate solutions obtained are almost always identical to the optimal solutions., This work was partially funded by Spanish Project PID2019- 111544GB-C22 (MINECO / FEDER), by the European Union’s Horizon 2020 Research and Innovation Program under Grant Agreements 723596, 768824, 764025 and 814945, and by 2017 SGR 1537.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Argumentation Reasoning with Graph Isomorphism Networks for Reddit Conversation Analysis

  • Alsinet, Teresa
  • Argelich Romà, Josep
  • Béjar Torres, Ramón
  • Gibert Llauradó, Daniel
  • Planes Cid, Jordi
The automated analysis of different trends in online debating forums is an interesting tool for sampling the agreement between citizens in different topics. In previous work, we have defined computational models to measure different values in these online debating forums. One component in these models has been the identification of the set of accepted posts by an argumentation problem that characterizes this accepted set through a particular argumentation acceptance semantics. A second component is the classification of posts into two groups: the ones that agree with the root post of the debate, and the ones that disagree with it. Once we compute the set of accepted posts, we compute the different measures we are interested to get from the debate, as functions defined over the bipartition of the posts and the set of accepted posts. In this work, we propose to explore the use of graph neural networks (GNNs), based on graph isomorphism networks, to solve the problem of computing these measures, using as input the debate tree, instead of using our previous argumentation reasoning system. We focus on the particular online debate forum Reddit, and on the computation of a measure of the polarization in the debate. We explore the use of two different approaches: one where a single GNN model computes directly the polarization of the debate, and another one where the polarization is computed using two different GNNs: the first one to compute the accepted posts of the debate, and the second one to compute the bipartition of the posts of the debate. Our results over a set of Reddit debates show that GNNs can be used to compute the polarization measure with an acceptable error, even if the number of layers of the network is bounded by a constant. We observed that the model based on a single GNN shows the lowest error, yet the one based on two GNNs has more flexibility to compute additional measures from the debates. We also compared the execution time of our GNN-based models with a previous approach based on a distributed algorithm for the computation of the accepted posts, and observed a better performance., This work was partially funded by Spanish Project PID2019-111544GB-C22, and by the Universitat de Lleida Requalifcation (2021–2023) under the EU Next Generation.
Recercat. Dipósit de la Recerca de Catalunya
Publication Capítulo o parte de un libro (BookPart)

Feature Necessity & Relevancy in ML Classifier Explanations

  • Huang, Xuanxiang
  • Cooper, Martin C.
  • Morgado, Antonio
  • Planes Cid, Jordi
  • Marques-Silva, Joao
Given a machine learning (ML) model and a prediction, explanations can be defined as sets of features which are sufficient for the prediction. In some applications, and besides asking for an explanation, it is also critical to understand whether sensitive features can occur in some explanation, or whether a non-interesting feature must occur in all explanations. This paper starts by relating such queries respectively with the problems of relevancy and necessity in logic-based abduction. The paper then proves membership and hardness results for several families of ML classifiers. Afterwards the paper proposes concrete algorithms for two classes of classifiers. The experimental results confirm the scalability of the proposed algorithms., This work was supported by the AI Interdisciplinary Institute ANITI, funded by the French program “Investing for the Future – PIA3” under Grant agreement no. ANR-19-PI3A-0004, and by the H2020-ICT38 project COALA “Cognitive Assisted agile manufacturing for a Labor force supported by trustworthy Artificial intelligence”, and funded by the Spanish Ministry of Science and Innovation (MICIN) under project PID2019-111544GB-C22, and by a María Zambrano fellowship and a Requalification fellowship financed by Ministerio de Universidades of Spain and by European Union – NextGenerationEU.