BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20210324T150000
DTEND;TZID=America/New_York:20210324T160000
DTSTAMP:20240515T195432Z
CREATED:20240126T083019Z
LAST-MODIFIED:20240515T195432Z
UID:10001411-1616598000-1616601600@cmsa.fas.harvard.edu
SUMMARY:Word and Graph Embeddings for Machine Learning
DESCRIPTION:Speaker: Steve Skiena\, Dept. of Computer Science and AI Insititute\, Stony Brook University \nTitle: Word and Graph Embeddings for Machine Learning \nAbstract: DeepWalk is an approach we have developed to construct vertex embeddings: vector representations of vertices which be applied to a very general class of problems in data mining and information retrieval. DeepWalk exploits an appealing analogy between sentences as sequences of words and random walks as sequences of vertices to transfer deep learning (unsupervised feature learning) techniques from natural language processing to network analysis. It has become extremely popular\, having been cited by over 4600 research papers since its publication at KDD 2014. In this talk\, I will introduce the notion of graph embeddings\, and demonstrate why they make such powerful features for machine learning applications. I will focus on more recent efforts concerning (1) fast embedding methods for very large networks\, (2) techniques for embedding dynamic graphs\, and (3) embedding spaces as models for knowledge generation. \n  \n 
URL:https://cmsa.fas.harvard.edu/event/3-24-2021-new-tech-in-math-seminar/
LOCATION:MA
CATEGORIES:New Technologies in Mathematics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-New-Technologies-in-Mathematics-03.24.21.png
END:VEVENT
END:VCALENDAR