Back to search

North Dakota State University

Mining Representative Cohesive Dense Subgraphs

Abstract

dc:description.abstract

Data mining techniques have an important implication in social and biological network analysis, were we're interested in finding related complexes and communities. A modern paradigm for solving this problem involves finding densely connected interacting members such as bound proteins in a PPI. It's important to also consider the properties of members. In the context of social networks, we might be interested in finding groups of friends of similar age and sharing common interests. This information can lead to better targeting for advertising and suggestions. In this paper, we introduce an algorithm that can be applied to mining entity- relationship networks. Our approach discovers relevant subnetworks by considering density among entities as well as their similar attribute properties. We apply two distinct methods of forming subnetworks in order to find as many relevant complexes as possible. In addition, we supply techniques for summarization and reduction of nearly-redundant subnetworks in the results.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Brazier, Tyler

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/23675

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

Brazier, Tyler. Mining Representative Cohesive Dense Subgraphs. North Dakota State University, 2014. https://hdl.handle.net/10365/23675