Botnet detection using graph-based feature clustering

S Chowdhury, M Khanzadeh, R Akula, F Zhang… - Journal of Big Data, 2017 - Springer
Detecting botnets in a network is crucial because bots impact numerous areas such as cyber
security, finance, health care, law enforcement, and more. Botnets are becoming more …

Ranking to learn: Feature ranking and selection via eigenvector centrality

G Roffo, S Melzi - New Frontiers in Mining Complex Patterns: 5th …, 2017 - Springer
In an era where accumulating data is easy and storing it inexpensive, feature selection plays
a central role in helping to reduce the high-dimensionality of huge amounts of otherwise …

Modification of supervised OPF-based intrusion detection systems using unsupervised learning and social network concept

H Bostani, M Sheikhan - Pattern Recognition, 2017 - Elsevier
Optimum-path forest (OPF) is a graph-based machine learning method that can overcome
some limitations of the traditional machine learning algorithms that have been used in …

Social network analysis approach for improved transportation planning

IH El-Adaway, IS Abotaleb, E Vechan - Journal of Infrastructure …, 2017 - ascelibrary.org
Social network analysis (SNA) is a well-established methodology for investigating networks
through the use of mathematical formulations abstracted from graph theory. It has been …

An upper approximation based community detection algorithm for complex networks

P Kumar, S Gupta, B Bhasker - Decision Support Systems, 2017 - Elsevier
The emergence of multifarious complex networks has attracted researchers and
practitioners from various disciplines. Discovering cohesive subgroups or communities in …

HellRank: a Hellinger-based centrality measure for bipartite social networks

SM Taheri, H Mahyar, M Firouzi, E Ghalebi K… - Social Network Analysis …, 2017 - Springer
Measuring centrality in a social network, especially in bipartite mode, poses many
challenges, for example, the requirement of full knowledge of the network topology, and the …

I/O-efficient calculation of H-group closeness centrality over disk-resident graphs

J Zhao, P Wang, JCS Lui, D Towsley, X Guan - Information Sciences, 2017 - Elsevier
We introduce H-group closeness centrality in this work. H-group closeness centrality of a
group of nodes measures how close this node group is to other nodes in a graph, and can …

Exploring big graph computing—An empirical study from architectural perspective

L Nai, Y Xia, IG Tanase, H Kim - Journal of Parallel and Distributed …, 2017 - Elsevier
Graph computing is widely applied in a large number of big data applications. Despite its
importance, high performance graph computing remains a challenge, especially for large …

Distributed algorithms for large-scale robotic ensembles: centrality, synchronization and self-reconfiguration

A Naz - 2017 - theses.hal.science
Technological advances especially in the miniaturization of robotic devices foreshadow the
emergence of large-scale ensembles of small-size resource-constrained robots that …

[图书][B] International specialization dynamics

D Lebert, H El Younsi - 2017 - books.google.com
This book deals with the dynamics of international specializations during the present period
of trade globalization. It discusses international trade as a network linking countries, and …