Date of Award
1-1-2018
Language
English
Document Type
Dissertation
Degree Name
Doctor of Philosophy (PhD)
College/School/Department
Department of Computer Science
Content Description
1 online resource (ii, ix, 63 pages) : illustrations (some color)
Dissertation/Thesis Chair
Jeong-Hyon Hwang
Committee Members
Petko Bogdanov, Feng Chen
Keywords
prioritization, pruning, subgraph discovery, Graph theory, Computer algorithms, Data mining
Subject Categories
Computer Sciences
Abstract
Subgraph discovery in a single data graph---finding subsets of vertices and edges satisfying a user-specified criteria---is an essential and general graph analytics operation with a wide spectrum of applications. Depending on the criteria, subgraphs of interest may correspond to cliques of friends in social networks, interconnected entities in RDF data, or frequent patterns in protein interaction networks to name a few. Existing systems usually examine a large number of subgraphs while employing many computers and often produce an enormous result set of subgraphs. How can we enable fast discovery of only the most relevant subgraphs while minimizing the computational requirements?
Recommended Citation
Joshi, Aparna, "An efficient system for subgraph discovery" (2018). Legacy Theses & Dissertations (2009 - 2024). 2088.
https://scholarsarchive.library.albany.edu/legacy-etd/2088