메뉴 건너뛰기




Volumn 40, Issue 6, 2013, Pages 1155-1171

Bayesian networks for sex-related homicides: Structure learning and prediction

Author keywords

Bayesian networks; criminal event perspective; ensemble learning; model averaging; offender profiling

Indexed keywords


EID: 84877833176     PISSN: 02664763     EISSN: 13600532     Source Type: Journal    
DOI: 10.1080/02664763.2013.780235     Document Type: Article
Times cited : (4)

References (32)
  • 3
    • 23044532198 scopus 로고    scopus 로고
    • The personality paradox in offender profiling
    • doi:10.1037/1076-8971.8.1.115
    • Alison, L., Bennell, C., Mokros, A. and Ormerod, D. 2002. The personality paradox in offender profiling. Psychology, Public Policy, and Law, 8: 115 - 135. (doi:10.1037/1076-8971.8.1.115)
    • (2002) Psychology, Public Policy, and Law , vol.8 , pp. 115-135
    • Alison, L.1    Bennell, C.2    Mokros, A.3    Ormerod, D.4
  • 4
    • 84877827397 scopus 로고    scopus 로고
    • The role of profiling in the investigation of sexual homicide
    • In: Proulx J., Beauregard É., Cusson M., Nicole A., editors Chichester,: Wiley
    • Beauregard, É. 2007. " The role of profiling in the investigation of sexual homicide ". In Sexual Murderers: A Comparative Analysis and New Perspectives, Edited by: Proulx, J., Beauregard, É., Cusson, M. and Nicole, A. 193 - 211. Chichester: Wiley.
    • (2007) Sexual Murderers: A Comparative Analysis and New Perspectives , pp. 193-211
    • Beauregard, E.1
  • 6
    • 0001019707 scopus 로고    scopus 로고
    • Learning Bayesian networks is NP-complete
    • In: Fisher D., Lenz H.-J., editors New York,: Springer
    • Chickering, D. M. 1996. " Learning Bayesian networks is NP-complete ". In Learning from Data: Artificial Intelligence and Statistics V, Edited by: Fisher, D. and Lenz, H.-J. 121 - 130. New York: Springer.
    • (1996) Learning from Data: Artificial Intelligence and Statistics V , pp. 121-130
    • Chickering, D.M.1
  • 7
    • 0008399274 scopus 로고    scopus 로고
    • Specific profile analysis: A data-based approach to offender Profiling
    • In: Jackson J. L., Bekerian D. A., editors Chichester,: Wiley
    • Davies, A. 1997. " Specific profile analysis: A data-based approach to offender Profiling ". In Offender Profiling: Theory, Research and Practise, Edited by: Jackson, J. L. and Bekerian, D. A. 191 - 208. Chichester: Wiley.
    • (1997) Offender Profiling: Theory, Research and Practise , pp. 191-208
    • Davies, A.1
  • 8
    • 3343019470 scopus 로고
    • Measuring nominal scale agreement among many raters
    • doi:10.1037/h0031619
    • Fleiss, J. L. 1971. Measuring nominal scale agreement among many raters. Psychological Bulletin, 76: 378 - 382. (doi:10.1037/h0031619)
    • (1971) Psychological Bulletin , vol.76 , pp. 378-382
    • Fleiss, J.L.1
  • 9
    • 0033707946 scopus 로고    scopus 로고
    • Using Bayesian networks to analyze expression data
    • doi:10.1089/106652700750050961
    • Friedman, N., Linial, M., Nachman, I. and Peer, D. 2000. Using Bayesian networks to analyze expression data. Journal of Computational Biology, 7: 601 - 620. (doi:10.1089/106652700750050961)
    • (2000) Journal of Computational Biology , vol.7 , pp. 601-620
    • Friedman, N.1    Linial, M.2    Nachman, I.3    Peer, D.4
  • 12
    • 84987031663 scopus 로고
    • Probabilistic similarity networks
    • doi:10.1002/net.3230200508
    • Heckerman, D. 1990. Probabilistic similarity networks. Networks, 20: 607 - 636. (doi:10.1002/net.3230200508)
    • (1990) Networks , vol.20 , pp. 607-636
    • Heckerman, D.1
  • 14
    • 33947524259 scopus 로고    scopus 로고
    • Estimating high-dimensional directed acyclic graphs with the PC-Algorithm
    • Kalisch, M. and Bühlmann, P. 2007. Estimating high-dimensional directed acyclic graphs with the PC-Algorithm. Journal of Machine Learning Research, 8: 613 - 636.
    • (2007) Journal of Machine Learning Research , vol.8 , pp. 613-636
    • Kalisch, M.1    Bühlmann, P.2
  • 16
    • 84987049628 scopus 로고
    • Independence properties of directed Markov fields
    • doi:10.1002/net.3230200503
    • Lauritzen, S. L., Dawid, A. P., Larsen, B. N. and Leimer, H. G. 1990. Independence properties of directed Markov fields. Networks, 20: 491 - 505. (doi:10.1002/net.3230200503)
    • (1990) Networks , vol.20 , pp. 491-505
    • Lauritzen, S.L.1    Dawid, A.P.2    Larsen, B.N.3    Leimer, H.G.4
  • 17
    • 0001006209 scopus 로고
    • Local computations with probabilities on graphical structures and their application to expert systems
    • Lauritzen, S. L. and Spiegelhalter, D. 1988. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50: 157 - 224.
    • (1988) Journal of the Royal Statistical Society, Series B , vol.50 , pp. 157-224
    • Lauritzen, S.L.1    Spiegelhalter, D.2
  • 18
    • 61749097205 scopus 로고    scopus 로고
    • Controlling the false discovery rate of the association/causality structure learned with the PC algorithm
    • Li, J. and Wang, Z. J. 2009. Controlling the false discovery rate of the association/causality structure learned with the PC algorithm. Journal of Machine Learning Research, 10: 475 - 514.
    • (2009) Journal of Machine Learning Research , vol.10 , pp. 475-514
    • Li, J.1    Wang, Z.J.2
  • 19
    • 84898996215 scopus 로고    scopus 로고
    • Bayesian network induction via local neighborhoods
    • In: Solla S. A., Leen T. K., Müller K.-R., editors Cambridge,: MIT Press
    • Margaritis, D. and Thrun, S. 1999. " Bayesian network induction via local neighborhoods ". In Advances in Neural Information Processing Systems 12, Edited by: Solla, S. A., Leen, T. K. and Müller, K.-R. 505 - 511. Cambridge: MIT Press.
    • (1999) Advances in Neural Information Processing Systems 12 , pp. 505-511
    • Margaritis, D.1    Thrun, S.2
  • 20
    • 33747163541 scopus 로고    scopus 로고
    • High-dimensional graphs and variable selection with the LASSO
    • doi:10.1214/009053606000000281
    • Meinshausen, N. and Bühlmann, P. 2006. High-dimensional graphs and variable selection with the LASSO. The Annals of Statistics, 34: 1436 - 1462. (doi:10.1214/009053606000000281)
    • (2006) The Annals of Statistics , vol.34 , pp. 1436-1462
    • Meinshausen, N.1    Bühlmann, P.2
  • 23
    • 0004213845 scopus 로고    scopus 로고
    • New York,: Cambridge University Press
    • Pearl, J. 2000. Causality, New York: Cambridge University Press.
    • (2000) Causality
    • Pearl, J.1
  • 25
    • 0002444961 scopus 로고
    • Counting unlabelled acyclic digraphs
    • In: Little C. H.C., editors Heidelberg,: Springe
    • Robinson, R. W. 1977. " Counting unlabelled acyclic digraphs ". In Lecture Notes in Mathematics: Combinatorial Mathematics V, Edited by: Little, C. H.C. 28 - 43. Heidelberg: Springe.
    • (1977) Lecture Notes in Mathematics: Combinatorial Mathematics V , pp. 28-43
    • Robinson, R.W.1
  • 27
    • 13044305299 scopus 로고    scopus 로고
    • Differentiating stranger murders: Profiling offender characteristics from behavioral styles
    • doi:10.1002/(SICI)1099-0798(199907/09)17:3<391::AID-BSL352>3.0.CO;2-Z
    • Salfati, G. and Canter, D. V. 1999. Differentiating stranger murders: Profiling offender characteristics from behavioral styles. Behavioral Sciences and the Law, 17: 391 - 406. (doi:10.1002/(SICI)1099-0798(199907/09)17:3<391::AID-BSL352>3.0.CO;2-Z)
    • (1999) Behavioral Sciences and the Law , vol.17 , pp. 391-406
    • Salfati, G.1    Canter, D.V.2
  • 31
    • 33746035971 scopus 로고    scopus 로고
    • The max-min hill-climbing Bayesian network structure learning algorithm
    • doi:10.1007/s10994-006-6889-7
    • Tsamardinos, I., Brwon, L. E. and Aliferis, C. F. 2006. The max-min hill-climbing Bayesian network structure learning algorithm. Machine Learning, 65: 31 - 78. (doi:10.1007/s10994-006-6889-7)
    • (2006) Machine Learning , vol.65 , pp. 31-78
    • Tsamardinos, I.1    Brwon, L.E.2    Aliferis, C.F.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.