2018
DOI: 10.1186/s13388-018-0031-9
|View full text |Cite
|
Sign up to set email alerts
|

The detection of criminal groups in real-world fused data: using the graph-mining algorithm “GraphExtract”

Abstract: Law enforcement and intelligence agencies generally have access to a number of rich data sources, both structured and unstructured, and with the advent of high performing entity resolution it is now possible to fuse multiple heterogeneous datasets into an explicit generic data representation. But once this is achieved how should agencies go about attempting to exploit this data by proactively identifying criminal events and the actors responsible? The authors will outline an effective generic method that; comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 42 publications
0
10
0
Order By: Relevance
“…They affirm that bank transactions have their own characteristics and properties that can be considered in the graphs. For Robinson and Scogings (2018), graph mining can be defined simply by detecting patterns in graphs, which include identification of subgraphs of interest within wider graphs. The authors argue graphic representation is an expressive model of data that best captures characteristics of relationships that point to criminal activities.…”
Section: Literature Reviewmentioning
confidence: 99%
“…They affirm that bank transactions have their own characteristics and properties that can be considered in the graphs. For Robinson and Scogings (2018), graph mining can be defined simply by detecting patterns in graphs, which include identification of subgraphs of interest within wider graphs. The authors argue graphic representation is an expressive model of data that best captures characteristics of relationships that point to criminal activities.…”
Section: Literature Reviewmentioning
confidence: 99%
“…With respect to the type of network being analysed, the method developed is most suited for network when the links represents flow or patterns of movement among vertices. Chen & Saad's work [54], as they referred to it, is the extraction of dense subgraph with respect to community detection in a network. Having established the problem as very challenging but really essential in the analyses of graph structures and complex network, the work revealed community detection has being similar to the problem of re-ordering matrices in sparse matrix techniques and thus exploited the concept and resulted in the method of identifying matrix column similarities.…”
Section: Random Walk Algorithmmentioning
confidence: 99%
“…And at third level, expressive data representation are created for evidence-based decision-making. [58] in the year 2014, and in 2018, Magalingam et al [52], Bahulkar et al [53], Robinson et al [54] ,Junjing at al [55], where they have used network graph analysis for community detection to identify clusters or communities from a covert dataset, these work proven its value in refining criminological concepts and theories to aid the understanding of social processes behind crime problems and to assist law enforcement agencies in enforcing crime. However, the Figure 3 above shows the gap identifies the less number of research done for the past decade.…”
Section: Community Detection In Criminal Networkmentioning
confidence: 99%
“…SNA relies on real datasets used as sources which allow to build networks that are then examined [10,[12][13][14][15][16][17][18]. However, the collection of complete network data describing the structure and activities of a criminal organization is difficult to obtain.…”
Section: Introductionmentioning
confidence: 99%