A data reduction approach using hypergraphs to visualize communities and brokers in social networks

Research output: Contribution to journalReview article

Abstract

The comprehension of social network phenomena is closely related to data visualization. However, even with only hundreds of nodes, the visualization of dense networks is usually difficult. The strategy adopted in this work is data reduction using communities. Community detection in social network analysis is a very important issue and in particular detection of community overlapping. In this approach, the information extracted from social networks transcends cohesive groups, enabling the discovery of brokers that interact among communities. To find admissible solutions in hard problems, relaxed approaches are used. Quasi-cliques are generated, and partition is found using a partial set-covering heuristic. The proposed method allows the identification of communities and actors that link two or more groups. In the visualization process, the user can choose different dimension reduction approaches for the condensed graph. For each condensed structure, a hypergraph can be drawn, identifying communities and brokers.

LanguageEnglish
Article number60
JournalSocial Network Analysis and Mining
Volume8
Issue number1
DOIs
Publication statusPublished - 1 Dec 2018

Fingerprint

Data reduction
social network
Visualization
Data visualization
Electric network analysis
visualization
community
network analysis
heuristics
comprehension
Group

Keywords

  • Brokerage
  • Community detection
  • Data reduction
  • Graph mining
  • Hypergraphs

Cite this

@article{a0185169f0604346a816468a8f03ff40,
title = "A data reduction approach using hypergraphs to visualize communities and brokers in social networks",
abstract = "The comprehension of social network phenomena is closely related to data visualization. However, even with only hundreds of nodes, the visualization of dense networks is usually difficult. The strategy adopted in this work is data reduction using communities. Community detection in social network analysis is a very important issue and in particular detection of community overlapping. In this approach, the information extracted from social networks transcends cohesive groups, enabling the discovery of brokers that interact among communities. To find admissible solutions in hard problems, relaxed approaches are used. Quasi-cliques are generated, and partition is found using a partial set-covering heuristic. The proposed method allows the identification of communities and actors that link two or more groups. In the visualization process, the user can choose different dimension reduction approaches for the condensed graph. For each condensed structure, a hypergraph can be drawn, identifying communities and brokers.",
keywords = "Brokerage, Community detection, Data reduction, Graph mining, Hypergraphs",
author = "Lu{\'i}s Cavique and Marques, {Nuno C.} and Ant{\'o}nio Gon{\cc}alves",
note = "info:eu-repo/grantAgreement/FCT/5876/147256/PT# sem pdf conforme despacho.",
year = "2018",
month = "12",
day = "1",
doi = "10.1007/s13278-018-0538-6",
language = "English",
volume = "8",
journal = "Social Network Analysis and Mining",
issn = "1869-5450",
publisher = "Springer-Verlag Wien",
number = "1",

}

TY - JOUR

T1 - A data reduction approach using hypergraphs to visualize communities and brokers in social networks

AU - Cavique, Luís

AU - Marques, Nuno C.

AU - Gonçalves, António

N1 - info:eu-repo/grantAgreement/FCT/5876/147256/PT# sem pdf conforme despacho.

PY - 2018/12/1

Y1 - 2018/12/1

N2 - The comprehension of social network phenomena is closely related to data visualization. However, even with only hundreds of nodes, the visualization of dense networks is usually difficult. The strategy adopted in this work is data reduction using communities. Community detection in social network analysis is a very important issue and in particular detection of community overlapping. In this approach, the information extracted from social networks transcends cohesive groups, enabling the discovery of brokers that interact among communities. To find admissible solutions in hard problems, relaxed approaches are used. Quasi-cliques are generated, and partition is found using a partial set-covering heuristic. The proposed method allows the identification of communities and actors that link two or more groups. In the visualization process, the user can choose different dimension reduction approaches for the condensed graph. For each condensed structure, a hypergraph can be drawn, identifying communities and brokers.

AB - The comprehension of social network phenomena is closely related to data visualization. However, even with only hundreds of nodes, the visualization of dense networks is usually difficult. The strategy adopted in this work is data reduction using communities. Community detection in social network analysis is a very important issue and in particular detection of community overlapping. In this approach, the information extracted from social networks transcends cohesive groups, enabling the discovery of brokers that interact among communities. To find admissible solutions in hard problems, relaxed approaches are used. Quasi-cliques are generated, and partition is found using a partial set-covering heuristic. The proposed method allows the identification of communities and actors that link two or more groups. In the visualization process, the user can choose different dimension reduction approaches for the condensed graph. For each condensed structure, a hypergraph can be drawn, identifying communities and brokers.

KW - Brokerage

KW - Community detection

KW - Data reduction

KW - Graph mining

KW - Hypergraphs

UR - http://www.scopus.com/inward/record.url?scp=85053900575&partnerID=8YFLogxK

U2 - 10.1007/s13278-018-0538-6

DO - 10.1007/s13278-018-0538-6

M3 - Review article

VL - 8

JO - Social Network Analysis and Mining

T2 - Social Network Analysis and Mining

JF - Social Network Analysis and Mining

SN - 1869-5450

IS - 1

M1 - 60

ER -