STAT 603 - GRAPHS FOR KNOWLEDGE DISCOVERY
Long Title: GRAPH-THEORETICAL APPROACHES TO KNOWLEDGE DISCOVERY
Department: Statistics
Grade Mode: Standard Letter
Language of Instruction: Taught in English
Course Type: Lecture
Credit Hours: 3
Restrictions: Must be enrolled in one of the following Level(s):
Graduate
Description: The course will focus on using the power of graph representation and related tools for knowledge discovery from data (structure analysis, pattern recognition, cluster (community) detection). We will review necessary graph theoretical foundations, relevant types of graphs; characterization of graphs by various properties and measures (such as randomness, connectedness, clustering coefficient, similarity.) Topics will include graph segmentation algorithms such as Leading Eigenvector (spectral clustering), Walktrap (Markov-chain random walk), or Infomap, for inferring clusters; and graph matching algorithms for model comparison. We will explore graph representations emerging from vector quantization machine learning processes (e.g, neural maps, K-means), which provide compressed, rich models of complex data relations and facilitate analysis of large data sets with relatively small graphs. We will exercise applications in homeworks and a class project utilizing available graph manipulation software packages.
No previous knowledge of Graph Theory is assumed. Students will be assumed to have working knowledge of the following:
• Linear algebra (such as in MATH 355, ELEC 301 or equivalent)
• Multivariate calculus (such as in MATH 212, MATH 232, or equivalent)
• Probability and statistics (such as in STAT 310, or ELEC/STAT 331 or equivalent)
Please see additional information on recommended background in the syllabus and at the course web site. Recommended Prerequisite(s): No previous knowledge of Graph Theory is assumed. Students will be assumed to have working knowledge of the following:
• Linear algebra (such as in MATH 355, ELEC 301 or equivalent)
• Multivariate calculus (such as in MATH 212, MATH 232, or equivalent)
• Probability and statistics (such as in STAT 310, or ELEC/STAT 331 or equivalent)
If unsure, please check with the instructor.
In addition,
• If you have taken (ELEC 531 and (CMOR 553 / ELEC 533 / STAT 583) ) or (STAT 615 and STAT 518) you automatically qualify.
• Familiarity with simple information theoretical notions (ELEC 241 or equivalent) is an advantage. These will be briefly reviewed in the course as necessary.
• Having taken machine learning type courses such as COMP/ELEC/STAT 502, ELEC/COMP 440, STAT 613 is an advantage.