Max-Planck-Institut für Informatik
max planck institut
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:Analyzing Dynamics of Choice among Discrete Alternatives
Speaker:Andrew Tomkins
coming from:Google
Speakers Bio:Andrew Tomkins is an engineering director at Google working on web analysis, search, and personalization. His research has focused on measurement, modelling, and analysis of content, communities, and users on the World Wide Web. Prior to joining Google, he spent four years at Yahoo!, leading search research and serving as chief scientist of the search organization. He also spent eight years at IBM's Almaden Research Center, where he co-founded the WebFountain project and served as its chief scientist. He has published over 100 technical papers and submitted over sixty patents. Andrew received Bachelors degrees in Mathematics and Computer Science from MIT, and a PhD in CS from Carnegie Mellon University. He recently co-chaired the program of WWW2008 and KDD2010, and serves on the editorial board of ACM Transactions on the Web
Event Type:SWS Distinguished Lecture Series
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Friday, 9 January 2015
Duration:90 Minutes
Building:E1 5
In this talk we'll consider two problems in which users must select from a set of alternatives. In the first scenario, a user consumes a class of item repeatedly, such as listening to a sequence of songs, or visiting a sequence of restaurants over time. Our goal is to understand the dynamics of repeated consumption of the same item. We present a model related to Herbert Simon's 1955 copying model, and analyze its effectiveness. In the second scenario, a user traverses a directed graph whose nodes represent items, and whose arcs represent related items recommended by the system. In this setting, we develop a model and algorithm for determining the underlying quality of each node based on traversal data. Our result provides a well-motivated unique solution to the problem of "reverse engineering" a markov chain by finding a transition matrix given the graph and the steady state
Name(s):Susanne Girard
Video Broadcast
Video Broadcast:YesTo Location:Kaiserslautern
To Building:G26To Room:111
Tags, Category, Keywords and additional notes
Attachments, File(s):
Created by:Susanne Girard/MPI-SWS, 01/06/2015 04:13 PMLast modified by:Uwe Brahm/MPII/DE, 11/24/2016 04:14 PM
  • Susanne Girard, 01/06/2015 04:17 PM -- Created document.