6 Citations (Scopus)

Abstract

In this paper, we study a variant of the social network maximum influence problem and its application to intelligently approaching individual gang members with incentives to leave a gang. The goal is to identify individuals who when influenced to leave gangs will propagate this action. We study this emerging application by exploring specific facets of the problem that must be addressed when modeling this particular situation. We formulate a new influence maximization variant - the "social incentive influence" (SII) problem and study it both formally and in the context of the law-enforcement domain. Using new techniques from unconstrained submodular maximization, we develop an approximation algorithm for SII and present a suite of experimental results - including tests on real-world police data from Chicago.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
PublisherAssociation for Computing Machinery
Pages1829-1836
Number of pages8
ISBN (Print)9781450329569
DOIs
StatePublished - 2014
Event20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2014 - New York, NY, United States
Duration: Aug 24 2014Aug 27 2014

Other

Other20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2014
CountryUnited States
CityNew York, NY
Period8/24/148/27/14

Fingerprint

Law enforcement
Approximation algorithms
Violence

Keywords

  • complex networks
  • network diffusion
  • propagation in networks

ASJC Scopus subject areas

  • Software
  • Information Systems

Cite this

Shakarian, P., Salmento, J., Pulleyblank, W., & Bertetto, J. (2014). Reducing gang violence through network influence based targeting of social programs. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1829-1836). Association for Computing Machinery. https://doi.org/10.1145/2623330.2623331

Reducing gang violence through network influence based targeting of social programs. / Shakarian, Paulo; Salmento, Joseph; Pulleyblank, William; Bertetto, John.

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, 2014. p. 1829-1836.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shakarian, P, Salmento, J, Pulleyblank, W & Bertetto, J 2014, Reducing gang violence through network influence based targeting of social programs. in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, pp. 1829-1836, 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2014, New York, NY, United States, 8/24/14. https://doi.org/10.1145/2623330.2623331
Shakarian P, Salmento J, Pulleyblank W, Bertetto J. Reducing gang violence through network influence based targeting of social programs. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery. 2014. p. 1829-1836 https://doi.org/10.1145/2623330.2623331
Shakarian, Paulo ; Salmento, Joseph ; Pulleyblank, William ; Bertetto, John. / Reducing gang violence through network influence based targeting of social programs. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, 2014. pp. 1829-1836
@inproceedings{637eecbbe08b4647bc0cc5ba59c0e921,
title = "Reducing gang violence through network influence based targeting of social programs",
abstract = "In this paper, we study a variant of the social network maximum influence problem and its application to intelligently approaching individual gang members with incentives to leave a gang. The goal is to identify individuals who when influenced to leave gangs will propagate this action. We study this emerging application by exploring specific facets of the problem that must be addressed when modeling this particular situation. We formulate a new influence maximization variant - the {"}social incentive influence{"} (SII) problem and study it both formally and in the context of the law-enforcement domain. Using new techniques from unconstrained submodular maximization, we develop an approximation algorithm for SII and present a suite of experimental results - including tests on real-world police data from Chicago.",
keywords = "complex networks, network diffusion, propagation in networks",
author = "Paulo Shakarian and Joseph Salmento and William Pulleyblank and John Bertetto",
year = "2014",
doi = "10.1145/2623330.2623331",
language = "English (US)",
isbn = "9781450329569",
pages = "1829--1836",
booktitle = "Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Reducing gang violence through network influence based targeting of social programs

AU - Shakarian, Paulo

AU - Salmento, Joseph

AU - Pulleyblank, William

AU - Bertetto, John

PY - 2014

Y1 - 2014

N2 - In this paper, we study a variant of the social network maximum influence problem and its application to intelligently approaching individual gang members with incentives to leave a gang. The goal is to identify individuals who when influenced to leave gangs will propagate this action. We study this emerging application by exploring specific facets of the problem that must be addressed when modeling this particular situation. We formulate a new influence maximization variant - the "social incentive influence" (SII) problem and study it both formally and in the context of the law-enforcement domain. Using new techniques from unconstrained submodular maximization, we develop an approximation algorithm for SII and present a suite of experimental results - including tests on real-world police data from Chicago.

AB - In this paper, we study a variant of the social network maximum influence problem and its application to intelligently approaching individual gang members with incentives to leave a gang. The goal is to identify individuals who when influenced to leave gangs will propagate this action. We study this emerging application by exploring specific facets of the problem that must be addressed when modeling this particular situation. We formulate a new influence maximization variant - the "social incentive influence" (SII) problem and study it both formally and in the context of the law-enforcement domain. Using new techniques from unconstrained submodular maximization, we develop an approximation algorithm for SII and present a suite of experimental results - including tests on real-world police data from Chicago.

KW - complex networks

KW - network diffusion

KW - propagation in networks

UR - http://www.scopus.com/inward/record.url?scp=84907033473&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84907033473&partnerID=8YFLogxK

U2 - 10.1145/2623330.2623331

DO - 10.1145/2623330.2623331

M3 - Conference contribution

AN - SCOPUS:84907033473

SN - 9781450329569

SP - 1829

EP - 1836

BT - Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

PB - Association for Computing Machinery

ER -