Enterprise business intelligence using email analytics

• US 20060277207A1
• Filed: 06/06/2005
• Published: 12/07/2006
• Est. Priority Date: 06/06/2005
• Status: Abandoned Application

• Current Assignee: Michael J Ure
• Original Assignee: Michael J Ure
• Inventors: Ure, Michael J.
• Application Number:
  US11/145,713
• Publication Number:
  US 20060277207A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/107 Computer-aided management of electronic mailing [e-mailing]

Abstract

The present invention, generally speaking, provides a visual email analytics tool in which a network graph is created without the need to identify any particular node of the network graph. The complexity of the network graph is controlled by interactively pruning the network graph based on one or more measures of relatedness, such as the number of emails exchanged, clustering attributes, etc. Node-by-node pruning is also provided for. A privilege/consent system governs the viewing of emails. The tool enables a user to quickly and easily identify the relevant players and activities with respect to a particular subject.

Claims

1. A method of information retrieval and display comprising:

searching a message database using search criteria based on message content;

displaying a network graph representing messages satisfying the search criteria; and

interactively pruning or growing the network graph;

wherein a user is not required to identify any specific node of the network graph prior to displaying the network graph.

2. The method of claim 1, wherein edges of the network graph are directed edges representing a sender/receiver relationship between connected nodes, at least some nodes having both incoming and outgoing edges.

3. A computer readable medium storing instructions comprising instructions for:

searching a message database using search criteria based on message content;

displaying a network graph representing messages satisfying the search criteria; and

interactively pruning or growing the network graph;

wherein a user is not required to identify any specific node of the network graph prior to displaying the network graph.

4. The apparatus of claim 3, wherein edges of the network graph are directed edges representing a sender/receiver relationship between connected nodes, at least some nodes having both incoming and outgoing edges.