Message focusing

• US 10,182,027 B2
• Filed: 02/17/2015
• Issued: 01/15/2019
• Est. Priority Date: 12/15/2010
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: Loofbourrow, Wayne, Arrouye, Yan
• Primary Examiner(s): Lazaro, David R
• Application Number:
  US14/624,064
• Publication Number:
  US 20150188866A1
• Time in Patent Office: 1,428 Days
• Field of Search: 709204, 709206, 709207
• CPC Class Codes: G06F 16/48 Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
• CPC Class Codes: H04L 51/212 using filtering or selective blocking
• CPC Class Codes: H04L 51/216 Handling conversation history, e.g. grouping of messages in sessions or threads
• CPC Class Codes: H04L 51/52 for supporting social networking services
• CPC Class Codes: H04L 67/52 specially adapted for the location of the user terminal

Abstract

A method and apparatus of a device that focuses messages is described. In an exemplary method, the device receives a first and second group of message. The device further selects a related message from the second group of messages that is related to each message in the first group. This selecting is based on an affinity group, where the affinity group includes a message address that occurs in at least one of the messages in the second group and the affinity group is determined using the message addresses contained in the first and second groups.

Claims

1. A non-transitory machine-readable medium having executable instructions to cause one or more processing units to perform a method comprising:

receiving a plurality of message threads, wherein each of the plurality of threads includes one or more messages that are related to each of the messages in that thread and a message includes data specifying a plurality of message addresses;

for each of the message threads, computing, with a messaging server, a thread signature using a set of affinity groups, wherein each affinity group is a group of message addresses that represent entities that communicate with each other for a particular common purpose, the affinity groups are computed by the messaging server without relying on a message body, the thread signature comprises a distance vector of similarity values representing the similarities between the message addresses in the set of affinity groups, and the message addresses in each message in the message thread; and

creating at least one group of related message threads using the plurality of thread signatures.

2. The non-transitory machine-readable medium of claim 1, wherein a message is of a type selected from the group consisting of email, Short Message Service, Multimedia Message Service, Enhanced Message Service, TWITTER, FACEBOOK, telephone message log, and instant messaging.

3. The non-transitory machine-readable medium of claim 2, wherein the plurality of message threads includes a plurality of message types.

4. The non-transitory machine-readable medium of claim 1, wherein the computing the thread signature comprises:

computing a message signature for each of the one or more messages in the message thread, wherein the message signature is the distance vector between the plurality of message addresses of that message and the affinity group.

5. The medium of claim 4, wherein the computing of the thread signature comprises averaging the one or more distance vectors of the message signatures.

6. The non-transitory machine-readable medium of claim 1, wherein the entities in each affinity group communicate above a minimum frequency regarding the particular common purpose.

7. The non-transitory machine-readable medium of claim 1 where the messages in a thread are related based on a common subject and wherein the data specifying a plurality of message addresses is included in a message header.

8. The non-transitory machine-readable medium of claim 7 wherein the plurality of message addresses are included in at least one of:

To, From, or cc fields.

9. The non-transitory machine-readable medium of claim 1 wherein each affinity group, in the set of affinity groups, is computed based on a probability that a message which includes one message address also includes one or more other message addresses.

10. A method comprising:

receiving a plurality of message threads, wherein each of the plurality of threads includes one or more messages that are related to each of the messages in that thread and a message includes data specifying a plurality of message addresses;

for each of the message threads, computing a thread signature using a set of affinity groups, wherein each affinity group is a group of message addresses that are related to each other for a particular common purpose, the affinity groups are computed by the messaging server without relying on a message body, the thread signature comprises a distance vector of similarity values representing the similarities between the message addresses in the set of affinity groups, and the message addresses in each message in the message thread; and

creating at least one group of related message threads using the plurality of thread signatures.

11. The method of claim 10, wherein the plurality of message threads includes a plurality of message types.

12. The method of claim 10, wherein the computing the thread signature comprises:

computing a message signature for each of the one or more messages in the message thread, wherein the message signature is the distance vector between the plurality of message addresses of that message and the affinity group.

13. The method of claim 12 wherein the computing of the thread signature comprises averaging the one or more distance vectors of the message signatures.

14. The method of claim 10 wherein the messages in a thread are related based on a common subject and wherein the data specifying a plurality of message addresses is included in a message header.

15. The method of claim 14 wherein the plurality of message addresses are included in at least one of:

To, From, or cc fields.

16. The method of claim 10 wherein each affinity group, in the set of affinity groups, is computed based on a probability that a message which includes one message address also includes one or more other message addresses.

17. An apparatus comprising:

at least one processor;

a memory coupled to the processor though a bus; and

a process executed from the memory by the processor causes the at least one processor to receive a plurality of message threads, wherein each of the plurality of threads includes one or more messages that are related to each of the messages in that thread and a message includes data specifying a plurality of message addresses, compute a thread signature, for each of the message threads, using a set of affinity groups, wherein each affinity group is a group of message addresses that are related to each other for a particular common purpose, the affinity groups are computed by the messaging server without relying on a message body, and the thread signature comprises a distance vector of similarity values representing the similarities between the message addresses in the set of affinity groups, and the message addresses in each message in the message thread, and

create a group of related message threads using the plurality of thread signatures.

18. The apparatus of claim 17, wherein the plurality of message threads includes a plurality of message types.

19. The apparatus of claim 17, wherein the process further cause the processor to compute the thread signature comprises by

computing a message signature for each of the one or more messages in the message thread, wherein the message signature is the distance vector between the plurality of message addresses of that message and the affinity group.

20. The apparatus of claim 19, wherein the process further causes the processor to compute a thread signature further comprises by

averaging the one or more distance vectors of the message signatures to arrive at the thread signature.