Skip to main content

Resultados relacionados

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

Biblos-e Archivo. Repositorio Institucional de la UAM
Publication Artículo científico (JournalArticle)

Equity in the police districting problem balancing territorial and racial fairness in patrolling operations

  • Liberatore, Federico
  • Camacho-Collados, Miguel
  • Quijano Sánchez, Lara
Objectives The Police Districting Problem concerns the defnition of patrol districts that distribute police resources in a territory in such a way that high-risk areas receive more patrolling time than low-risk areas, according to a principle of territorial fairness. This results in patrolling confgurations that are efcient and efective at controlling crime but that, at the same time, might exacerbate racial disparity in police stops and arrests. In this paper, an Equitable Police Districting Problem that combines crime-reduction efectiveness with racial fairness is proposed. The capability of this model in designing patrolling confgurations that fnd a balance between territorial and racial fairness is assessed. Also, the trade-of between these two criteria is analyzed. Methods The Equitable Police Districting Problem is defned as a mixed-integer program. The objective function is formulated using Compromise Programming and Goal Programming. The model is validated on a real-world case study on the Central District of Madrid, Spain, and its solutions are compared to standard patrolling confgurations currently used by the police. Results A trade-of between racial fairness and crime control is detected. However, the experiments show that including the proposed racial criterion in the optimization of patrol districts greatly improves racial fairness with limited detriment to the policing efectiveness. Also, the model produces solutions that dominate the patrolling confgurations currently in use by the police. Conclusions The results show that the model successfully provides a quantitative evaluation of the trade-of between the criteria and is capable of defning patrolling confgurations that are efcient in terms of both racial and territorial fairness, The research of Liberatore is partially funded by the European Commission’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie, grant number MSCA-RISE 691161 (GEO-SAFE), and the Government of Spain, grant MTM2015-65803-R. The research of QuijanoSánchez was conducted with fnancial support from the Spanish Ministry of Science and Innovation, grant PID2019-108965GB-I00. All the fnancial support is gratefully acknowledged
Biblos-e Archivo. Repositorio Institucional de la UAM
Publication Artículo científico (JournalArticle)

SocialHaterBERT: A dichotomous approach for automatically detecting hate speech on Twitter through textual analysis and user profiles

  • Valle Cano, Gloria del
  • Quijano Sánchez, Lara
  • Liberatore, Federico
  • Gómez, Jesús
Social media platforms have evolved into an online representation of our social interactions. We may use the resources they provide to analyze phenomena that occur within them, such as the development and viralization of offensive and hostile content. In today’s polarized world, the escalating nature of this behavior is cause for concern in modern society. This research includes an in-depth examination of previous efforts and strategies for detecting and preventing hateful content on the social network Twitter, as well as a novel classification approach based on users’ profiles, related social environment and generated tweets. This paper’s contribution is threefold: (i) an improvement in the performance of the HaterNet algorithm, an expert system developed in collaboration with the Spanish National Office Against Hate Crimes of the Spanish State Secretariat for Security (Ministry of the Interior) that is capable of identifying and monitoring the evolution of hate speech on Twitter using an LTSM + MLP neural network architecture. To that end, a model based on BERT, HaterBERT, has been created and tested using HaterNet’s public dataset, providing results that show a significant improvement; (ii) A methodology to create a user database in the form of a relational network to infer textual and centrality features. This contribution, SocialGraph, has been independently tested with various traditional Machine Learning and Deep Learning algorithms, demonstrating its usefulness in spotting haters; (iii) a final model, SocialHaterBERT, that integrates the previous two approaches by analyzing features other than those inherent in the text. Experiment results reveal that this last contribution greatly improves outcomes, establishing a new field of study that transcends textual boundaries, paving the way for future research in coupled models from a diachronic and dynamic perspective, The research of Quijano-Sánchez was conducted with financial support from the Spanish Ministry of Science and Innovation, grant PID2019-108965GBI00. The research of Liberatore is partially funded by the European Commission’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie, grant number MSCA-RISE 691161 (GEOSAFE), and the Government of Spain, grant MTM2015-65803-R. All the financial support is gratefully acknowledged
Docta Complutense
Publication Artículo científico (JournalArticle)

A goal programming model for early evacuation of vulnerable people and relief distribution during a wildfire

  • Flores, Inmaculada
  • Ortuño Sánchez, María Teresa
  • Tirado Domínguez, Gregorio
Wildfires generate many safety issues to population at risk areas. Sometimes, due to the proximity of a fire, it is necessary to carry out the evacuation of vulnerable people in order to protect them from heat, sparks or flames. To facilitate the evacuation planning, potential evacuees are classified according to their health condition, so that they are taken care of properly. Additionally, once they reach a safe area, basic supplies are crucial to ensure their welfare. In order to assure the proper coverage of the basic needs of the evacuees, supplies have been also classified according to their characteristics. Furthermore, not everybody decides to evacuate at the same time; on the contrary, vulnerable people affected by fires require assistance or go to the designated pick-up points according to their own susceptibility about the situation, leading to the dynamic arrival of potential evacuees along a certain time horizon. In the same way, dynamic arrival of potential supplies along time can be considered. All these factors define a real-life problem that can be formulated as a mixed integer optimization model that is dynamic, multi-modal and multicriteria. This model is more flexible than others available in the literature and allows for a joint approach to people evacuation and supply distribution. A case study regarding the Saddleridge Fire that hit San Fernando Valley in Los Angeles County, California, in October 2019, is introduced and used to validate the proposed model and evaluate its performance.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Artículo científico (JournalArticle)

A mathematical pre-disaster model with uncertainty and multiple criteria for facility location and network fortification

  • Monzon, Julia
  • Liberatore, Federico
  • Vitoriano, Begoña
Disasters have catastrophic effects on the affected population, especially in developing and underdeveloped countries. Humanitarian Logistics models can help decision-makers to efficiently and effectively warehouse and distribute emergency goods to the affected population, to reduce casualties and suffering. However, poor planning and structural damage to the transportation infrastructure could hamper these efforts and, eventually, make it impossible to reach all the affected demand centers. In this paper, a pre-disaster Humanitarian Logistics model is presented that jointly optimizes the prepositioning of aid distribution centers and the strengthening of road sections to ensure that as much affected population as possible can efficiently get help. The model is stochastic in nature and considers that the demand in the centers affected by the disaster and the state of the transportation network are random. Uncertainty is represented through scenarios representing possible disasters. The methodology is applied to a real-world case study based on the 2018 storm system that hit the Nampula Province in Mozambique., The authors would like to thank the following entities, agencies and organizations for all the help and support provided: National Institute of Statistics (Mozambique), National Road Administration (Mozambique), National Institute of Disaster Management (Mozambique), Red Cross (Spain), Maputo International Airport, and the NGO ONGAWA. The research was partially funded by the European Commission’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie, grant number MSCA-RISE 691161 (GEO-SAFE); the Government of Spain, grant MTM2015-65803-R; the Complutense University of Madrid, scholarship Ayudas para la realización de estancias en proyectos de cooperación para el desarrollo sostenible. All the financial support is gratefully acknowledged.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publication Artículo científico (JournalArticle)

Detecting and monitoring hate speech in Twitter

  • Pereira-Kohatsu, Juan Carlos
  • Quijano Sánchez, Lara
  • Liberatore, Federico
  • Camacho-Collados, Miguel
Social Media are sensors in the real world that can be used to measure the pulse of societies. However, the massive and unfiltered feed of messages posted in social media is a phenomenon that nowadays raises social alarms, especially when these messages contain hate speech targeted to a specific individual or group. In this context, governments and non-governmental organizations (NGOs) are concerned about the possible negative impact that these messages can have on individuals or on the society. In this paper, we present HaterNet, an intelligent system currently being used by the Spanish National Office Against Hate Crimes of the Spanish State Secretariat for Security that identifies and monitors the evolution of hate speech in Twitter. The contributions of this research are many-fold: (1) It introduces the first intelligent system that monitors and visualizes, using social network analysis techniques, hate speech in Social Media. (2) It introduces a novel public dataset on hate speech in Spanish consisting of 6000 expert-labeled tweets. (3) It compares several classification approaches based on different document representation strategies and text classification models. (4) The best approach consists of a combination of a LTSM+MLP neural network that takes as input the tweet's word, emoji, and expression tokens' embeddings enriched by the tf-idf, and obtains an area under the curve (AUC) of 0.828 on our dataset, outperforming previous methods presented in the literature., The work by Quijano-Sanchez was supported by the Spanish Ministry of Science and Innovation grant FJCI-2016-28855. The research of Liberatore was supported by the Government of Spain, grant MTM2015-65803-R, and by the European Union’s Horizon 2020 Research and Innovation Programme, under the Marie Sklodowska-Curie grant agreement No. 691161 (GEOSAFE). All the financial support is gratefully acknowledged
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publication Artículo científico (JournalArticle)

Variety of mutual-visibility problems in graphs

  • Cicerone, Serafino
  • Di Stefano, Gabriele
  • Drožđek, Lara
  • Hedžet, Jaka
  • Klavžar, Sandi
  • González Yero, Ismael
If X is a subset of vertices of a graph G, then vertices u and v are X-visible if there exists a shortest u,v-path P such that V(P)∩X⊆{u,v}. If each two vertices from X are X-visible, then X is a mutual-visibility set. The mutual-visibility number of G is the cardinality of a largest mutual-visibility set of G and has been already investigated. In this paper a variety of mutual-visibility problems is introduced based on which natural pairs of vertices are required to be X-visible. This yields the total, the dual, and the outer mutual-visibility numbers. We first show that these graph invariants are related to each other and to the classical mutual-visibility number, and then we prove that the three newly introduced mutual-visibility problems are computationally difficult. According to this result, we compute or bound their values for several graphs classes that include for instance grid graphs and tori. We conclude the study by presenting some inter-comparison between the values of such parameters, which is based on the computations we made for some specific families.
Docta Complutense
Publication Artículo científico (JournalArticle)

Variable neighborhood search to solve the generalized orienteering problem

  • Urrutia Zambrana, Adolfo
  • Tirado Domínguez, Gregorio
  • Mateos, Alfonso
This paper presents a variable neighborhood search (VNS) algorithm to solve the extension of the orienteering problem known as the generalized orienteering problem (GOP). Our algorithm aims to use a reduced number of neighborhoods without compromising the quality of the results. This reduced number of neighborhoods, together with the precalculation of scores associated with points of interest, allows us, in most cases, to outperformall previous metaheuristics proposed for this problem. This is the first time a VNS is being applied to theGOP, and it provides promising computational results. In particular, in the case studies considered in the paper, we were able to find 35 new best solutions, all of which were found using a shorter computational time. Furthermore, the information regarding other best-known solutions provided in the literature has also been improved, with corrections to some previously published errors regarding scores and distances. In addition, the benchmark has been extended with the incorporation of new case studies based on real data from three of the most popular tourist cities in Spain.