General Information
- Lectures: Monday-Friday, 10AM-11:15AM, E3-1 Lecture Room 3 (#2443)
- Professor: Ben Zhao, ravenben at cs.ucsb.edu
- Class Email List: graphs-wcu-s11 Google Group
- Prerequisites: A course in discrete mathematics
Introduction
Today's web services require efficient processing of large datasets in real-time. The scale and highly connected nature of these datasets pose significant challenges to traditional tools and algorithms. To meet these challenges for processing large data, we need to achieve advances in a number of research directions, including data and graph mining algorithms, distributed data processing infrastructures, data center networks.
This short course will cover recent developments in all of these areas in an attempt to understand and analyze the key remaining challenges in this space. Course materials will be drawn from technical papers from a variety of top conference and journals spanning areas of networking, systems, distributed systems, and data and knowledge mining.
Course evaluation will include a short course project on individual research topics related to the course topic areas.
Topics:
Lectures 1: review/overview of social networks
Lectures 2-3: distributed computation frameworks
Lectures 4-5: graph analysis, algorithms
Lectures 6-7: static and dynamic graph models
Lectures 8-9: data center networks
Lecture 10: Ongoing challenges and directions