An interactive graphical method for community detection in network data

DOI10.1007/S00180-016-0663-5MaRDI QIDQ2358932zbMATH OpenOpenAlexFDO

Authors Andee Kaplan, Heike Hofmann, Daniel J. Nordman

Publication date 27 June 2017

Published in Computational Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00180-016-0663-5

zbMATH Keywords

interactive graphicsgraph layoutweb applicationhuman perception

Mathematics Subject Classification ID

Multivariate analysis (62H99) Applications of graph theory (05C90) Social networks; opinion dynamics (91D30)

Recommendations

• Visualizing network communities with a semi-definite programming method
• Fused community detection
• Hypothesis testing for automated community detection in networks
• Identifying Community Structures from Network Data via Maximum Likelihood Methods
• A testing based extraction algorithm for identifying significant communities in networks

Cites work

• scientific article; zbMATH DE number 1168330 (Why is no real title available?)
• An Exponential Family of Probability Distributions for Directed Graphs
• An open graph visualization system and its applications to software engineering
• Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
• Community structure in social and biological networks
• Estimation and Prediction for Stochastic Blockstructures
• Pseudo-likelihood methods for community detection in large sparse networks
• The Structure and Function of Complex Networks

Cited in

(1)

• Interactive Exploration of Large Dendrograms with Prototypes

Describes a project that uses

Uses Software

• D3.js
• LabelRankT
• Jsnetworkx
• d3Network
• Gephi
• rjson
• shiny
• igraph
• JavaScript
• NodeXL
• R

This page was built for publication: An interactive graphical method for community detection in network data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358932)