Social networks and genetic algorithms to choose committees with independent members

Mostrar todas las versiones(2)

Organizations need representative individuals to make decisions about particular concerns. These representative individuals are appointed in committees, and we expect from his members to make decisions avoiding bias that could arise from closeness between them. In this context, the best committees a...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Zamudio, Eduardo, Berdun, Luis S., Amandi, Analía
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2016
Materias:
Ciencias Informáticas
red social
Organizaciones
Decisiones
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/57022
http://45jaiio.sadio.org.ar/sites/default/files/ASAI-17_0.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-57022
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
red social
Organizaciones
Decisiones
spellingShingle Ciencias Informáticas
red social
Organizaciones
Decisiones
Zamudio, Eduardo
Berdun, Luis S.
Amandi, Analía
Social networks and genetic algorithms to choose committees with independent members
topic_facet Ciencias Informáticas
red social
Organizaciones
Decisiones
description Organizations need representative individuals to make decisions about particular concerns. These representative individuals are appointed in committees, and we expect from his members to make decisions avoiding bias that could arise from closeness between them. In this context, the best committees are those which show the greatest independence between its members. In this work, we present an automatic approach to the committee selection problem. Our aim is to maximize independence among members of the committee. To this end, we propose to build a social network to calculate distances between candidates, and then apply a genetic algorithm to get potential committees with the greatest distances between their members.
format Objeto de conferencia
Objeto de conferencia
author Zamudio, Eduardo
Berdun, Luis S.
Amandi, Analía
author_facet Zamudio, Eduardo
Berdun, Luis S.
Amandi, Analía
author_sort Zamudio, Eduardo
title Social networks and genetic algorithms to choose committees with independent members
title_short Social networks and genetic algorithms to choose committees with independent members
title_full Social networks and genetic algorithms to choose committees with independent members
title_fullStr Social networks and genetic algorithms to choose committees with independent members
title_full_unstemmed Social networks and genetic algorithms to choose committees with independent members
title_sort social networks and genetic algorithms to choose committees with independent members
publishDate 2016
url http://sedici.unlp.edu.ar/handle/10915/57022
http://45jaiio.sadio.org.ar/sites/default/files/ASAI-17_0.pdf
work_keys_str_mv AT zamudioeduardo socialnetworksandgeneticalgorithmstochoosecommitteeswithindependentmembers
AT berdunluiss socialnetworksandgeneticalgorithmstochoosecommitteeswithindependentmembers
AT amandianalia socialnetworksandgeneticalgorithmstochoosecommitteeswithindependentmembers
bdutipo_str Repositorios
_version_ 1764820476810493953

Ejemplares similares