Back to search

North Dakota State University

Mining Communities from Multi-Layered Graphs

Abstract

dc:description.abstract

Identifying communities from networks has been a subject of great interest in Biological and Social network analysis. Finding communities can help with tasks such as identifying and fighting disease. Using graphs to represent networks and identifying dense subgraphs as communities within these graphs is an increasingly important area of study. Many of the same entities can be found in multiple networks, each representing a different type of relationship. These graphs capturing different relationships between the same entities can be combined into a single graph called a “multi-layered graph”. By finding dense subgraphs containing the same entities within multiple layers of the multi-layered graph, we can increase the confidence these dense subgraphs are communites. This paper has developed an algorithm that takes multi-layered graphs and employs quasi-clique based community discovery for extracting communities. Experimental results on real co-authorship networks show that the proposed approach discover communities that have dense interactions.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chao, Meng

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/23023

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Chao, Meng. Mining Communities from Multi-Layered Graphs. North Dakota State University, 2013. https://hdl.handle.net/10365/23023