Identifying Criminal Organizations From Their Social Network Structures

Identification of criminal structures within very large social networks is an essential security feat. By identifying such structures, it may be possible to track, neutralize, and terminate the corresponding criminal organizations before they act. We evaluate the effectiveness of three different methods for classifying an unknown network as terrorist, cocaine, or noncriminal. We consider three methods for the identification of network types: evaluating common social network analysis metrics, modeling with a decision tree, and network motif frequency analysis. The empirical results show that these three methods can provide significant improvements in distinguishing all three network types. We show that these methods are viable enough to be used as supporting evidence by security forces in their fight against criminal organizations operating on social networks.WoSScopu

Evolutionary Multiobjective Query Workload Optimization Of Cloud Data Warehouses

With the advent of Cloud databases, query optimizers need to find paretooptimal solutions in terms of response time and monetary cost. Our novel approach minimizes both objectives by deploying alternative virtual resources and query plans making use of the virtual resource elasticity of the Cloud. We propose an exact multiobjective branch-and-bound and a robust multiobjective genetic algorithm for the optimization of distributed data warehouse query workloads on the Cloud. In order to investigate the effectiveness of our approach, we incorporate the devised algorithms into a prototype system. Finally, through several experiments that we have conducted with different workloads and virtual resource configurations, we conclude remarkable findings of alternative deployments as well as the advantages and disadvantages of the multiobjective algorithms we propose.PubMedWoSScopu

Improving Hadoop Hive Query Response Times Through Efficient Virtual Resource Allocation

The performance of the MapReduce-based Cloud data warehouses mainly depends on the virtual hardware resources allocated. Most of the time, the resources are values selected/given by the Cloud service providers. However, setting the right virtual resources in accordance with the workload demands of a query, such as the number of CPUs, the size of RAM, and the network bandwidth, will improve the response time when querying large data on an optimized system. In this study, we carried out a set of experiments with a well-known Mapreduce SQL-translator, Hadoop Hive, on benchmark decision support the TPC benchmark (TPC-H) database in order to analyze the performance sensitivity of the queries under different virtual resource settings. Our results provide valuable hints for the decision makers who design efficient MapReduce-based data warehouses on the Cloud

Evolutionary Multiobjective Query Workload Optimization of Cloud Data Warehouses

With the advent of Cloud databases, query optimizers need to find paretooptimal solutions in terms of response time and monetary cost. Our novel approach minimizes both objectives by deploying alternative virtual resources and query plans making use of the virtual resource elasticity of the Cloud. We propose an exact multiobjective branch-and-bound and a robust multiobjective genetic algorithm for the optimization of distributed data warehouse query workloads on the Cloud. In order to investigate the effectiveness of our approach, we incorporate the devised algorithms into a prototype system. Finally, through several experiments that we have conducted with different workloads and virtual resource configurations, we conclude remarkable findings of alternative deployments as well as the advantages and disadvantages of the multiobjective algorithms we propose