School of Computer Science
Technical Workshop Series: Graph Mining in Python Using NetworkX
Presenter: – PhD Candidate Mahshad Hashemi
Date: Monday, November 13th, 2:30 pm – 3:30 pm
Location: 4th Floor (Workshop space) at 300 Ouellette Avenue (School of Computer Science Advanced Computing Hub)
1. Two-part attendance mandatory (sign in sheet, QR Code)
2. Arrive 5-10 minutes prior to event starting - LATECOMERS WILL NOT BE ADMITTED.
3. Be respectful of the decision of the advisor/host of event if you are not given admittance, there are several more events in future.
4. If you cannot attend, please be sure to cancel your attendance prior.
Abstract:
In previous workshop we covered the basic concepts of Graph Theory and some of the common problems in real life that are solved using Graph Theory. In this workshop we will start using python for analyzing graphs with the help of NetworkX which is one of the famous libraries of Python. At the end of this workshop, students will be able to use NetworkX package for creation, manipulation, and study of the structure, dynamics, and functions of complex networks.
Workshop Outline:
- Introduction
- Graph types
- Algorithms
- Functions
- Graph generators
- Linear algebra
- Converting to and from other data formats
- Relabeling nodes
- Reading and writing graphs
- Drawing
- Randomness
- Exceptions
Prerequisites:
Basic knowledge of Python and fundamentals of Graph Theory
Biography:
Mahshad is a Ph.D. candidate and research assistant in the School of Computer Science. Her primary research focus is on using Graph Theory to solve biological problems.