An email and meeting assistant using graph walks

Einat Minkov, William W. Cohen

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
StatePublished - 2006
Externally publishedYes
Event3rd Conference on Email and Anti-Spam, CEAS 2006 - Mountain View, CA, United States
Duration: 27 Jul 200628 Jul 2006

Conference

Conference3rd Conference on Email and Anti-Spam, CEAS 2006
Country/TerritoryUnited States
CityMountain View, CA
Period27/07/0628/07/06

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'An email and meeting assistant using graph walks'. Together they form a unique fingerprint.

Cite this