BEGIN:VCALENDAR
METHOD:PUBLISH
PRODID:-//Apple Computer\, Inc//iCal 1.0//EN
X-WR-CALNAME;VALUE=TEXT:USC
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION:Title: Revisiting FastMap: New Applications\n
\n
Date: Thursday, June 20th, 2024 - 2:00p - 3:30p\n
\n
Location: SAL 213\n
\n
Committee Members: T. K. Satish Kumar (Chair), John Carlsson, Emilio Ferrara, Sven Koenig, and Aiichiro Nakano\n
\n
Abstract: FastMap was first introduced in the Data Mining community for generating Euclidean embeddings of complex objects. In this talk, I will first generalize FastMap to generate Euclidean embeddings of graphs in near-linear time: The pairwise Euclidean distances approximate a desired graph-based distance function on the vertices. I will then apply the graph version of FastMap to efficiently solve various graph-theoretic problems of significant interest in AI: including facility location, top-K centrality computations, community detection and block modeling, and graph convex hull computations. I will also present a novel learning framework, called FastMapSVM, by combining FastMap and Support Vector Machines. I will then apply FastMapSVM to predict the satisfiability of Constraint Satisfaction Problems and to classify seismograms in Earthquake Science.\n
\n
Zoom Link: https://usc.zoom.us/j/92402869565?pwd=L0dwc0xRZVNrT3UrQWZCcERmVlBqQT09
SEQUENCE:5
DTSTART:20240620T140000
LOCATION:SAL 213
DTSTAMP:20240620T140000
SUMMARY:PhD Dissertation Defense - Ang Li
UID:EC9439B1-FF65-11D6-9973-003065F99D04
DTEND:20240620T153000
END:VEVENT
END:VCALENDAR