February 2018 - Dm-meeting - mailman.cs.vt.edu

Fwd: [Urbcomp-faculty] REMINDER: UrbComp Seminar Series ft. Jordan Holt, WMATA on Feb. 28 at 3 pm
by B. Aditya Prakash 27 Feb '18

27 Feb '18

FYI, looks interesting. You should try to attend. Apologies for the brevity Sent from my iPhone Begin forwarded message: > From: "Hawrami, Wanawsha via Urbcomp-faculty" <urbcomp-faculty(a)cs.vt.edu> > Date: February 27, 2018 at 10:11:27 AM EST > To: "urbcomp-faculty(a)cs.vt.edu" <urbcomp-faculty(a)cs.vt.edu>, "urbcomp-seminars(a)cs.vt.edu" <urbcomp-seminars(a)cs.vt.edu>, "vt-ncr-arlington-g(a)vt.edu" <vt-ncr-arlington-g(a)vt.edu>, "vt-ncr-g(a)vt.edu" <vt-ncr-g(a)vt.edu>, "dac_students(a)googlegroups.com" <dac_students(a)googlegroups.com> > Subject: [Urbcomp-faculty] REMINDER: UrbComp Seminar Series ft. Jordan Holt, WMATA on Feb. 28 at 3 pm > Reply-To: "Hawrami, Wanawsha" <wanah92(a)vt.edu> > > Dear Students and Colleagues, > > Please join us for the first UrbComp Seminar Series of the semester featuring Jordan Holt from WMATA on Wednesday Feb. 28 at 3 - 4 pm in room 4-024 of the Virginia Tech Research Center - Arlington and Torg 3001. > > We look forward to seeing you there! > > > >

1 0

Wednesday, Feb. 28th, @ 5:00 pm, McB 133C, Sorour Amiri (LOCATION CHANGED)
by Sorour Ekhtiari Amiri 25 Feb '18

25 Feb '18

Hi everyone, Please join us for our next DM-Meeting. ****DM-Meeting Spring 2018**** WHO: Sorour E. Amiri WHEN: Wednesday, Feb. 28th, 2018, @ 5:00 pm *WHERE: McB 133C*WHAT: I will talk about my current graph summarization project Title: NetGist: Learning to generate task-based network summaries Abstract: Given a network, can we visualize it for any given task, highlighting the important characteristics? Networks are widespread, and hence summarizing and visualizing them is of primary interest for many applications such as viral marketing, extracting communities and immunization. Summaries can help speed-up existing algorithms as well as help in sense-making. However, most prior work focuses on generic structural summarization techniques or on developing specific algorithms for speci.c tasks. .is is both tedious and challenging. As a result, for several popular tasks, there do not exist redeemed summarization tools for users. In this paper, we explore a promising alternative approach instead. We propose NetGist, a framework which automatically learns how to generate a summary for a given task on a given network. In addition to generating the required summary, this also allows us to reuse the learned process on other similar networks. We formulate a novel task-based graph summarization problem and leverage reinforcement learning to design a .exible framework for our solution. Via extensive experiments, we show that NetGist learns meaningful summaries, and outperforms task-specific algorithms robustly on diverse datasets. Finally, it also allows for complex task-based sense-making of networks in many contexts. Best regards, Sorour

1 0

Spreadsheet for DM-meeting
by Sorour Ekhtiari Amiri 22 Feb '18

22 Feb '18

Hi everyone, Please register for the dates you can present in the following spreadsheet, https://docs.google.com/spreadsheets/d/1E-tTKTQMECn2kiy7dhZA6586vy42Usg1QQX… Best regards, Sorour

1 0

Wednesday, Feb.21st @ Torgerson 3160A
by Sorour Ekhtiari Amiri 16 Feb '18

16 Feb '18

Hi everyone, Hope you had a great semester so far. In Spring 2018 we schedule our meetings from 5:00 pm to 6:00 pm on Wednesdays in the meeting room 3160A Torgerson hall. We will have our first meeting next Wednesday, Feb. 21st. This week's meeting will be about welcoming everyone back, and discussing last AAAI conference and our submissions for KDD. Hope to see you all! Best regards, Sorour

1 0