An Email and Meeting Assistant Using Graph Walks

نویسندگان

  • Einat Minkov
  • William W. Cohen
چکیده

We describe a framework for representing email as well as meeting information as a joint graph. In the graph, documents and meeting descriptions are connected via other nontextual objects representing the underlying structure-rich data. This framework integrates content, social networks and a timeline in a structural graph. Extended similarity metrics for objects embedded in the graph can be derived using a lazy graph walk paradigm. In this paper we evaluate this general framework for two meeting and email related tasks. A novel task considered is finding email-addresses of relevant attendees for a given meeting. Another task we define and evaluate is finding the full set of email-address aliases for a person, given the corresponding name string. The experimental results show promise of this approach over other possible methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Meeting Time for Two Random Walks on a Regular Graph

We provide an analysis of the expected meeting time of two independent random walks on a regular graph. For 1-D circle and 2-D torus graphs, we show that the expected meeting time can be expressed as the sum of the inverse of non-zero eigenvalues of a suitably defined Laplacian matrix. We also conjecture based on empirical evidence that this result holds more generally for simple random walks o...

متن کامل

Meeting Times of Random Walks on Graphs

We prove an upper bound on the meeting time of an arbitrary number of random walks in any connected undirected graph in terms of the meeting times of fewer random walks. We show that the bound is tight for rings, and that it is both stronger and more general than a bound suggested by Tetali and Winkler [4].

متن کامل

Exact computation for meeting times and infection times of random walks on graphs

We consider independent multiple random walks on graphs and study comparison results of meeting times and infection times between many conditions of the random walks by obtaining the exact density functions or expectations.

متن کامل

Multiple Random Walks in Random Regular Graphs

We study properties of multiple random walks on a graph under various assumptions of interaction between the particles. To give precise results, we make the analysis for random regular graphs. The cover time of a random walk on a random r-regular graph was studied in [6], where it was shown with high probability (whp), that for r ≥ 3 the cover time is asymptotic to θrn lnn, where θr = (r − 1)/(...

متن کامل

Multiple Random Walks and Interacting Particle Systems

We study properties of multiple random walks on a graph under variousassumptions of interaction between the particles.To give precise results, we make our analysis for random regular graphs.The cover time of a random walk on a random r-regular graph was studiedin [6], where it was shown with high probability (whp), that for r ≥ 3 thecover time is asymptotic to θrn lnn, where...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006