BEGIN:VCALENDAR
METHOD:PUBLISH
PRODID:-//Apple Computer\, Inc//iCal 1.0//EN
X-WR-CALNAME;VALUE=TEXT:USC
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION:PhD Thesis Proposal - Ang Li\n
\n
Committee Members: T. K. Satish Kumar (chair), Sven Koenig, Aiichiro Nakano, Emilio Ferrara, and John Carlsson\n
\n
Title: Revisiting FastMap: New Applications\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 shortest-path computations, facility location, top-K centrality computations, and community detection and block modeling. 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
SEQUENCE:5
DTSTART:20231024T140000
LOCATION:EEB 110
DTSTAMP:20231024T140000
SUMMARY:PhD Thesis Proposal - Ang Li
UID:EC9439B1-FF65-11D6-9973-003065F99D04
DTEND:20231024T153000
END:VEVENT
END:VCALENDAR