BEGIN:VCALENDAR
VERSION:2.0
PRODID:ics.py - http://git.io/lLljaA
BEGIN:VEVENT
DESCRIPTION:Come see CC's own Professor Cory Scott discuss the hurdles and potential benefits of discovering new\, better ways to compare graphs to each other!\n\n\n\nRated PG-13: Some calculus and linear algebra required to understand everything.\n\n4/7/23 • 3:00 - 4:00 PM\nTutt Science Center 229\n\nFull abstract:\nGraphs are a natural way to capture data about structure - that is\, how a bunch of objects are related to one another. But what if we want to compare one graph to another? For example\, detecting whether a social network is comprised of real humans versus chatbots. Testing two networks for similarity turns out to be a really difficult problem in theoretical computer science - but there are potential applications to a wide variety of applications including biology and medicine. In this talk\, I'll discuss what makes this problem difficult. I'll also talk about ways to apply machine learning to the problem\, as well as what major roadblocks remain in machine-learning enabled graph similarity scoring.\n\nhttps://today.coloradocollege.edu/events/6256
DTEND:20230407T220000Z
LOCATION:Tutt Science Center 229
DTSTART:20230407T210000Z
SUMMARY:Talk: Towards Differentiable Graph Comparison
UID:ef55b13a-60d1-4767-9d1e-7b9ac1b27471
END:VEVENT
END:VCALENDAR