| dc.contributor.author | Brazier, Tyler | |
| 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. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU Policy 190.6.2 | |
| dc.title | Mining Representative Cohesive Dense Subgraphs | en_US |
| dc.type | Master's paper | en_US |
| dc.date.accessioned | 2014-08-05T15:40:15Z | |
| dc.date.available | 2014-08-05T15:40:15Z | |
| dc.date.issued | 2014 | |
| dc.identifier.uri | http://hdl.handle.net/10365/23675 | |
| dc.subject.lcsh | Data mining. | en_US |
| dc.subject.lcsh | Web usage mining. | en_US |
| dc.subject.lcsh | Online social networks. | en_US |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Engineering | en_US |
| ndsu.department | Computer Science | en_US |
| ndsu.program | Computer Science | en_US |
| ndsu.advisor | Salem, Saeed | |
