7 research outputs found

    Identifying a Criminal's Network of Trust

    Full text link
    Tracing criminal ties and mining evidence from a large network to begin a crime case analysis has been difficult for criminal investigators due to large numbers of nodes and their complex relationships. In this paper, trust networks using blind carbon copy (BCC) emails were formed. We show that our new shortest paths network search algorithm combining shortest paths and network centrality measures can isolate and identify criminals' connections within a trust network. A group of BCC emails out of 1,887,305 Enron email transactions were isolated for this purpose. The algorithm uses two central nodes, most influential and middle man, to extract a shortest paths trust network.Comment: 2014 Tenth International Conference on Signal-Image Technology & Internet-Based Systems (Presented at Third International Workshop on Complex Networks and their Applications,SITIS 2014, Marrakesh, Morocco, 23-27, November 2014

    How to Hide One's Relationships from Link Prediction Algorithms

    Get PDF
    Our private connections can be exposed by link prediction algorithms. To date, this threat has only been addressed from the perspective of a central authority, completely neglecting the possibility that members of the social network can themselves mitigate such threats. We fill this gap by studying how an individual can rewire her own network neighborhood to hide her sensitive relationships. We prove that the optimization problem faced by such an individual is NP-complete, meaning that any attempt to identify an optimal way to hide one’s relationships is futile. Based on this, we shift our attention towards developing effective, albeit not optimal, heuristics that are readily-applicable by users of existing social media platforms to conceal any connections they deem sensitive. Our empirical evaluation reveals that it is more beneficial to focus on “unfriending” carefully-chosen individuals rather than befriending new ones. In fact, by avoiding communication with just 5 individuals, it is possible for one to hide some of her relationships in a massive, real-life telecommunication network, consisting of 829,725 phone calls between 248,763 individuals. Our analysis also shows that link prediction algorithms are more susceptible to manipulation in smaller and denser networks. Evaluating the error vs. attack tolerance of link prediction algorithms reveals that rewiring connections randomly may end up exposing one’s sensitive relationships, highlighting the importance of the strategic aspect. In an age where personal relationships continue to leave digital traces, our results empower the general public to proactively protect their private relationships.M.W. was supported by the Polish National Science Centre grant 2015/17/N/ST6/03686. T.P.M. was supported by the Polish National Science Centre grants 2016/23/B/ST6/03599 and 2014/13/B/ST6/01807 (for this and the previous versions of this article, respectively). Y.V. and K.Z. were supported by ARO MURI (grant #W911NF1810208). Y.V. was also supported by the U.S. National Science Foundation (CAREER award IIS- 1905558 and grant IIS-1526860). E.M. acknowledges funding by Ministerio de Economa y Competitividad (Spain) through grant FIS2016-78904-C3-3-P

    Central Actor Identification of Crime Group using Semantic Social Network Analysis

    Get PDF
    The Police as law enforcers who authorize in terms of social protection are expected to do both the prevention and investigation efforts also the settlement of criminal cases that occurred in the society. This research can help police to identify the main actor faster and leads to solving crime-cases. The use of overall centrality is very helpful in determining the main actors from other centrality measures. The purpose of this research is to identify the central actor of crimes done by several people. Semantic Social Network Analysis is used to perform central actor identification using five centrality measurements, such as degree centrality, betweenness centrality, closeness centrality, eigenvector centrality, and overall centrality. As for the relationship between actors, this research used social relation such as friendship, colleague, family, date or lover, and acquaintances. The relationship between actors is measured by first four centrality measures then accumulated by overall centrality to determine the main actor. The result showed 80.39% accuracy from 102 criminal cases collected with at least 3 actors involved in each case

    Locating Central Actors in Co-offending Networks

    No full text
    Abstract—A co-offending network is a network of offenders who have committed crimes together. Recently different researches have shown that there is a fairly strong concept of network among offenders. Analyzing these networks can help law enforcement agencies in designing more effective strategies for crime prevention and reduction. One of the important tasks in co-offending network analysis is central actors identification. In this paper, firstly we introduce a data model, called unified crime data level and co-offending network mining level. Using this data model, we extract the co-offending network of five years real-world crime data. Then we apply different variations of centrality methods on the extracted network and discuss how key player identification and removal can help law enforcement agencies in policy making for crime reduction. I
    corecore