Decision Trees as a Tool for Data Analysis. Elections in Barcelona: A Case Study

被引:0
|
作者
Armengol, E. [1 ]
Garcia-Cerdana, A. [1 ]
机构
[1] IIIA CSIC, Artificial Intelligence Res Inst, Campus UAB,Cami Can Planes S-N, Barcelona 08193, Spain
来源
MODELING DECISIONS FOR ARTIFICIAL INTELLIGENCE (MDAI 2020) | 2020年 / 12256卷
关键词
Inductive learning methods; Decision trees; Analysis of electoral results; DISCOVERY;
D O I
10.1007/978-3-030-57524-3_22
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Decision trees are inductive learning methods that construct a domain model easy to understand from domain experts. For this reason, we claim that the description of a given data set using decision trees is an easy way to both discover patterns and compare the classes that form the domain at hand. It is also an easy way to compare different models of the same domain. In the current paper, we have used decision trees to analyze the vote of the Barcelona citizens in several electoral convocations. Thus, the comparison of the models we have obtained has let us know that the percentage of people with a university degree is the most important aspect to separe the neighbourhoods of Barcelona according to the most voted party in a neighbourhood. We also show that in some neighbourhoods has always won the same party independently of the kind of convocation (local or general).
引用
收藏
页码:261 / 272
页数:12
相关论文
共 50 条