|
|
|
|
LEADER |
00000nam a22000002 4500 |
001 |
1866149393 |
003 |
DE-627 |
005 |
20231018043714.0 |
007 |
cr uuu---uuuuu |
008 |
231018s2018 xx |||||o 00| ||eng c |
035 |
|
|
|a (DE-627)1866149393
|
035 |
|
|
|a (DE-599)KXP1866149393
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rda
|
041 |
|
|
|a eng
|
084 |
|
|
|a 2,1
|2 ssgn
|
100 |
1 |
|
|a Christen, Peter
|e VerfasserIn
|4 aut
|
245 |
1 |
2 |
|a A Decision Tree Approach to Predicting Recidivism in Domestic Violence
|
264 |
|
1 |
|c 2018
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
520 |
|
|
|a Domestic violence (DV) is a global social and public health issue that is highly gendered. Being able to accurately predict DV recidivism, i.e., re-offending of a previously convicted offender, can speed up and improve risk assessment procedures for police and front-line agencies, better protect victims of DV, and potentially prevent future re-occurrences of DV. Previous work in DV recidivism has employed different classification techniques, including decision tree (DT) induction and logistic regression, where the main focus was on achieving high prediction accuracy. As a result, even the diagrams of trained DTs were often too difficult to interpret due to their size and complexity, making decision-making challenging. Given there is often a trade-off between model accuracy and interpretability, in this work our aim is to employ DT induction to obtain both interpretable trees as well as high prediction accuracy. Specifically, we implement and evaluate different approaches to deal with class imbalance as well as feature selection. Compared to previous work in DV recidivism prediction that employed logistic regression, our approach can achieve comparable area under the ROC curve results by using only 3 of 11 available features and generating understandable decision trees that contain only 4 leaf nodes.Comment: 12 pages; Accepted at The 2018 Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD
|
650 |
|
4 |
|a slides
|
700 |
1 |
|
|a Wijenayake, Senuri
|e VerfasserIn
|4 aut
|
700 |
1 |
|
|a Graham, Timothy
|e VerfasserIn
|4 aut
|
856 |
4 |
0 |
|u http://arxiv.org/abs/1803.09862
|x Verlag
|z kostenfrei
|3 Volltext
|
912 |
|
|
|a NOMM
|
935 |
|
|
|a mkri
|
951 |
|
|
|a BO
|
ELC |
|
|
|a 1
|
LOK |
|
|
|0 000 xxxxxcx a22 zn 4500
|
LOK |
|
|
|0 001 4391830159
|
LOK |
|
|
|0 003 DE-627
|
LOK |
|
|
|0 004 1866149393
|
LOK |
|
|
|0 005 20231018043714
|
LOK |
|
|
|0 008 231018||||||||||||||||ger|||||||
|
LOK |
|
|
|0 035
|a (DE-2619)CORE50749030
|
LOK |
|
|
|0 040
|a DE-2619
|c DE-627
|d DE-2619
|
LOK |
|
|
|0 092
|o n
|
LOK |
|
|
|0 852
|a DE-2619
|
LOK |
|
|
|0 852 1
|9 00
|
LOK |
|
|
|0 935
|a core
|
OAS |
|
|
|a 1
|
ORI |
|
|
|a SA-MARC-krimdoka001.raw
|