Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Robust and Scalable Learning with Graphs
Speaker:Stephan Günnemann
coming from:Technical University of Munich
Speakers Bio:Stephan Günnemann is a Professor at the Department of Informatics, Technical University of Munich. He acquired his doctoral degree in 2012 at RWTH Aachen University in the field of computer science. From 2012 to 2015 he was an associate of Carnegie Mellon University, USA; initially as a postdoctoral fellow and later as a senior researcher. Stephan Günnemann has been a visiting researcher at Simon Fraser University, Canada, and a research scientist at the Research & Technology Center of Siemens AG. His research interests include efficient data mining and machine learning techniques for high-dimensional, temporal, and network data.
Event Type:Colloquium Lecture
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:Public Audience
Language:English
Date, Time and Location
Date:Thursday, 6 July 2017
Time:11:00
Duration:60 Minutes
Location:Saarbrücken
Building:E1 5
Room:029
Abstract
Graph data representing complex interactions between instances is ubiquitous across many application domains. Social networks of interacting users; e-commerce systems of related products, users, and sellers; document citation graphs; or functional brain networks are only a few examples. With the mere size of these graphs being one big challenge, a further key limiting factor for analytics is the data's quality itself: the collected graphs are rarely clean but often noisy, prone to corruptions, and vulnerable to attacks. In this talk, I will present two data mining principles that tackle both of these challenges: (i) Robust spectral clustering in the presence of corrupted graphs, and (ii) collective classification in heterogeneous graphs for fraud detection. For both tasks, I will present the underlying modeling principles and I will sketch solutions how to derive efficient and highly scalable learning algorithms.
Contact
Name(s):Petra Schaaf
Phone:5000
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):
Created:
Petra Schaaf/AG5/MPII/DE, 06/23/2017 11:06 AM
Last modified:
halma/MPII/DE, 11/07/2018 04:52 PM
  • Petra Schaaf, 06/26/2017 12:15 PM
  • Petra Schaaf, 06/23/2017 11:11 AM -- Created document.