PhD Defense by Yang Zhou

Event Details
  • Date/Time:
    • Wednesday October 12, 2016 - Thursday October 13, 2016
      3:00 pm - 4:59 pm
  • Location: KACB 1315
  • Phone:
  • URL:
  • Email:
  • Fee(s):
  • Extras:
No contact information submitted.

Summary Sentence: Innovative Ming, Processing, and Application of Big Graphs

Full Summary: No summary paragraph submitted.

Title: Innovative Ming, Processing, and Application of Big Graphs


Yang Zhou

School of Computer Science

College of Computing

Georgia Institute of Technology


Date: Wednesday, October 12, 2016

Time: 3:00 PM - 5:00 PM EDT

Location: KACB 1315



Dr. Ling Liu (Advisor, School of Computer Science, Georgia Institute of Technology)

Dr. Jay Lofstead (Scalable System Software Group, Sandia National Laboratories)

Dr. Shamkant Navathe (School of Computer Science, Georgia Institute of Technology)

Dr. Calton Pu (School of Computer Science, Georgia Institute of Technology)

Dr. Lakshmish Ramaswamy (Department of Computer Science, University of Georgia)




With continued advances in computing and information technology, big graphs have grown at an astonishing rate in terms of volume, variety, and velocity. Mining and processing such big graphs have huge potential to reveal hidden insights and promote innovation in many business, science, and engineering domains. This dissertation research is dedicated to the novel graph mining algorithms and the scalable graph processing frameworks.


This dissertation had made original contributions in graph mining, processing and application: First, we have developed a suite of novel graph mining algorithms to analyze and mine large-scale real-world heterogeneous information networks. Our algorithmic approaches enable new ways to dive into the correlation structure of big graphs to derive new insights about how heterogeneous entities interact with one another and influence the effectiveness and efficiency of graph clustering, graph classification and graph ranking. Second, we have developed a scalable graph parallel processing framework by exploring parallel processing optimizations at both access tier and computation tier. We have designed a suite of hierarchically composable graph parallel abstractions to enable large-scale graphs to be processed efficiently for iterative graph computation applications. Our approach enables computer hardware resource aware graph partitioning such that parallel graph processing workloads can be well balanced in the presence of highly irregular graph structures and the mismatch of graph access and computation workloads. Third but not the least, we have developed innovative domain specific graph analytics frameworks to understand the hidden patterns in enterprise storage systems and to derive the interesting correlations among various enterprise web services. These novel graph algorithms and frameworks provide broader and deeper insights for better understanding of tradeoffs in enterprise system design and implementation.

Additional Information

In Campus Calendar

Graduate Studies

Invited Audience
Phd Defense
  • Created By: Tatianna Richardson
  • Workflow Status: Draft
  • Created On: Sep 20, 2016 - 5:44am
  • Last Updated: Oct 7, 2016 - 10:19pm