Loading Events

« All Events

  • This event has passed.

CIS/GRASP Seminar: Jean Gallier, University of Pennsylvania, “Clustering of Unsigned and signed Graphs Using Normalized Cuts (Normalized Cuts 15+ years later)” Part 2

October 1, 2015 @ 3:00 pm


In part II of my talk , I will discuss how to solve stage 2 of the clustering problem, namely, going back from a continuous solution to a  discrete solution. I will review Yu and Shi’s approach, and present a mild generalization. Kunegis et al proposed a way to deal with signed graphs for two clusters (allowing negative weights). I will show that it is actually possible to extend the method of normalized cuts for signed graphs to any number of clusters, and present an application to word clustering developed by Joao Sedoc.

Slides may be found here…


- Learn More

Jean Gallier is a Professor of Computer and Information Science at the University of Pennsylvania, with a secondary appointment in Mathematics. He obtained his Ph.D in Computer Science at UCLA in 1978. Gallier has done research in a number of areas of CS, including program correctness, incremental parsing and error recovery, logic programming, unification, term-rewriting and equational logic, polymorphic lambda calculi, and linear logic. For the past twenty two years, he has focused on geometric modeling, surfaces splines, surface reconstruction from meshes, and recently on optimization problems arising in computer vision, robotics, and machine learning. Generally, he is interested in applying geometric tools (in particular, differential geometry) to problems in computer science. He is the author of seven books, the next to the last one with Dianna Xu, “A Guide to the Classification theorem for compact surfaces,” and the last one, “Logic For Computer Science” (second edition).


October 1, 2015
3:00 pm
Event Category: