An interactive graphical method for community detection in network data

DOI10.1007/S00180-016-0663-5zbMATH Open1417.62184OpenAlexW2395651776MaRDI QIDQ2358932FDOQ2358932

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

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

zbMATH Keywords

interactive graphicsgraph layoutweb applicationhuman perception

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Interactive Exploration of Large Dendrograms with Prototypes

Uses Software

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

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)