Mining Marked Nodes in Large Graphs
|Abstract||With the rise of the Big Data Era, an exponential amount of network data is being generated at an unprecedented rate across a wide-range of high impact micro and macro areas of research---from protein interaction to social networks. The critical challenge is translating this large scale network data into actionable information.
A key task in the data translation is the analysis of network connectivity via marked nodes---the primary focus of our research. We have developed a framework for analyzing network connectivity via marked nodes in large scale graphs, utilizing novel algorithms in three interrelated areas: (1) analysis of a single seed node via it’s ego-centric network (AttriPart algorithm); (2) pathway identification between two see... (more)
|Contributor||Freitas, Scott (Author) / Tong, Hanghang (Advisor) / Maciejewski, Ross (Committee member) / Yang, Yezhou (Committee member) / Arizona State University (Publisher)|
|Reuse Permissions||All Rights Reserved|
|Note||Masters Thesis Computer Science 2018|
|Collaborating Institutions||Graduate College / ASU Library|
|Additional Formats||MODS / OAI Dublin Core / RIS|