What would a graph look like in this layout? a machine learning approach to large graph visualization

OH Kwon, T Crnovrsanin, KL Ma - IEEE transactions on …, 2017 - ieeexplore.ieee.org
Using different methods for laying out a graph can lead to very different visual appearances,
with which the viewer perceives different information. Selecting a “good” layout method is …

Identifying network structure similarity using spectral graph theory

R Gera, L Alonso, B Crawford, J House… - Applied network …, 2018 - Springer
Most real networks are too large or they are not available for real time analysis. Therefore, in
practice, decisions are made based on partial information about the ground truth network. It …

Estimation of graphlet counts in massive networks

RA Rossi, R Zhou, NK Ahmed - IEEE transactions on neural …, 2018 - ieeexplore.ieee.org
Graphlets are induced subgraphs of a large network and are important for understanding
and modeling complex networks. Despite their practical importance, graphlets have been …

Android malware detection via graphlet sampling

T Gao, W Peng, D Sisodia, TK Saha… - IEEE Transactions …, 2018 - ieeexplore.ieee.org
Android systems are widely used in mobile & wireless distributed systems. In the near future,
Android is believed to dominate the mobile distributed environment. However, with the …

Efficiently counting all orbits of graphlets of any order in a graph using autogenerated equations

I Melckenbeeck, P Audenaert, D Colle… - …, 2018 - academic.oup.com
Motivation Graphlets are a useful tool to determine a graph's small-scale structure. Finding
them is exponentially hard with respect to the number of nodes in each graphlet. Therefore …

A graph entropy measure from urelement to higher-order graphlets for network analysis

R Huang, Z Chen, G Zhai, J He… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Graph entropy measures have recently gained wide attention for identifying and
discriminating various networks in biology, society, transportation, etc. However, existing …

Sampling informative patterns from large single networks

MH Chehreghani, T Abdessalem, A Bifet… - Future Generation …, 2020 - Elsevier
The set of all frequent patterns that are extracted from a single network can be huge. A
technique recently proposed for obtaining a compact, informative and useful set of patterns …

Methods and applications of network sampling

M Al Hasan - … challenges in complex, networked and risky …, 2016 - pubsonline.informs.org
Network data appear in various domains, including social, communication, and information
sciences. Analysis of such data is crucial for making inferences and predictions about these …

A distributed k-core decomposition algorithm on spark

A Mandal, M Al Hasan - … Conference on Big Data (Big Data), 2017 - ieeexplore.ieee.org
k-core decomposition of a graph is a popular graph analysis method that has found
widespread applications in various tasks. Thanks to its linear time complexity, k-core …

Sampling triples from restricted networks using MCMC strategy

M Rahman, MA Hasan - Proceedings of the 23rd ACM International …, 2014 - dl.acm.org
In large networks, the connected triples are useful for solving various tasks including link
prediction, community detection, and spam filtering. Existing works in this direction concern …