BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20210314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20211107T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221128T161500
DTEND;TZID=America/Los_Angeles:20221128T171500
DTSTAMP:20260519T070037
CREATED:20220920T153253Z
LAST-MODIFIED:20221122T174526Z
UID:2939-1669652100-1669655700@colleges.claremont.edu
SUMMARY:Applied Math Seminar: Juergen Kritschgau (Carnegie Mellon)
DESCRIPTION:Title: Using Mutual Information of Hypergraph Compressions for Clustering\n\nAbstract: Hypergraphs are often used to represent higher order observed relationships between subjects of study. In particular\, the vertices of a hypergraph could represent the basic elements of study\, and edges represent observed relationships between the vertices. Implicitly\, the assumption is that observed edges are more (or less) likely to appear between vertices that are “similar”. Therefore\, an important question in data science is whether the edges of a hypergraph can be used to recover ground truth vertex labels where two vertices receive the same label if they are similar. This is known as the clustering problem. In this talk\, we will discuss how mutual information of hypergraph compressions can be used to cluster hypergraphs\, and apply this clustering strategy to synthetic and real world data sets.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-juergen-kritschgau-carnegie-mellon/
LOCATION:Shanahan 2407 at Harvey Mudd College\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Heather Zinn Brooks":MAILTO:hzinnbrooks@g.hmc.edu
END:VEVENT
END:VCALENDAR