| dc.contributor.author | Dawar, Priyanka | |
| dc.description.abstract | In today’s computing world, graphs have become increasingly important in modeling sophisticated structures, entities and their interactions, with broad applications including Bioinformatics, Computer Vision, Web analysis etc. For an example, multiple gene expressions samples over the same set of genes are recorded to strengthen the evidence of co-expression patterns. These can be modeled by forming a set of graphs for these samples. The problem is how to dig into such multiple sources of information to make better inferences. In this paper, I have presented an efficient method to find useful subnetworks from graph networks. The idea is to create a summary graph from these networks and then find subnetworks using this graph. I have given a detailed comparison between an already existing approach called vertex-vertex summary graph approach and the approach discussed in this paper. The results I have found are more promising than for the existing approach. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU Policy 190.6.2 | |
| dc.title | Mining Quasi-Frequent Subnetworks in Graph Networks Using Edge-Edge Summary Graph | en_US |
| dc.type | Master's paper | en_US |
| dc.date.accessioned | 2017-05-10T00:21:41Z | |
| dc.date.available | 2017-05-10T00:21:41Z | |
| dc.date.issued | 2017 | |
| dc.identifier.uri | http://hdl.handle.net/10365/25986 | |
| dc.subject.lcsh | Data mining. | en_US |
| dc.subject.lcsh | Big data. | en_US |
| dc.subject.lcsh | Graphic methods -- Data processing. | en_US |
| dc.subject.lcsh | Graph theory -- Data processing. | 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 | |
