Show simple item record

dc.contributor.authorHarrison, Kyle Robert
dc.date.accessioned2014-09-05T20:32:24Z
dc.date.available2014-09-05T20:32:24Z
dc.date.issued2014-09-05
dc.identifier.urihttp://hdl.handle.net/10464/5679
dc.description.abstractA complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex network is a social network whereby the vertices represent people and edges denote their daily interactions. Understanding social network dynamics can be vital to the mitigation of disease spread as these networks model the interactions, and thus avenues of spread, between individuals. To better understand complex networks, algorithms which generate graphs exhibiting observed properties of real-world networks, known as graph models, are often constructed. While various efforts to aid with the construction of graph models have been proposed using statistical and probabilistic methods, genetic programming (GP) has only recently been considered. However, determining that a graph model of a complex network accurately describes the target network(s) is not a trivial task as the graph models are often stochastic in nature and the notion of similarity is dependent upon the expected behavior of the network. This thesis examines a number of well-known network properties to determine which measures best allowed networks generated by different graph models, and thus the models themselves, to be distinguished. A proposed meta-analysis procedure was used to demonstrate how these network measures interact when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results form the basis of the fitness evaluation for a GP system used to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce existing, well-known graph models as well as a real-world network. Results indicated that the automatically inferred models exemplified functional similarity when compared to their respective target networks. This approach also showed promise when used to infer a model for a mammalian brain network.en_US
dc.language.isoengen_US
dc.publisherBrock Universityen_US
dc.subjectGraph Modelsen_US
dc.subjectComplex Networksen_US
dc.subjectGenetic Programmingen_US
dc.subjectAutomatic Constructionen_US
dc.subjectNetwork Similarityen_US
dc.titleNetwork Similarity Measures and Automatic Construction of Graph Models using Genetic Programmingen_US
dc.typeElectronic Thesis or Dissertationen
dc.degree.nameM.Sc. Computer Scienceen_US
dc.degree.levelMastersen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.degree.disciplineFaculty of Mathematics and Scienceen_US
dc.embargo.termsNoneen_US
refterms.dateFOA2021-08-04T02:58:00Z


Files in this item

Thumbnail
Name:
Brock_Harrison_Kyle_2014.pdf
Size:
2.940Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record