MESSAGE THREAD SEARCHING

• US 20120102037A1
• Filed: 10/26/2010
• Published: 04/26/2012
• Est. Priority Date: 10/26/2010
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Ozonat, Mehmet Kivanc
• Application Number:
  US12/912,236
• Publication Number:
  US 20120102037A1
• Time in Patent Office: Days
• US Class Current: 707/738
• CPC Class Codes: G06F 16/334 Query execution G06F16/335 takes precedence
• CPC Class Codes: G06F 16/355 Class or cluster creation or modification

Abstract

In one general aspect, a set of representations of message thread contents is decomposed into clusters of representations of message thread contents determined to be similar. Similarly, a set of representations of message thread titles is decomposed into clusters of representations of message thread titles determined to be similar, where the act of decomposing the set of representations of message thread titles is influenced by the act of decomposing the set of representations of message thread contents. In another general aspect, a search query is received and compared to representations of clusters of message threads (e.g., a cluster of representations of message thread titles). Based on this comparison, a particular cluster of message threads then is identified as matching the search query.

Claims

1. A computer-implemented method comprising:

accessing, from a computer memory storage system, a collection of message threads posted to a forum, each individual message thread including a title and content that is distinct from the title;

constructing a set of representations of the contents of the accessed collection of message threads;

constructing a set of representations of the titles of the accessed collection of message threads;

decomposing the set of representations of message thread contents, into clusters of representations of message thread contents determined to be similar; and

decomposing the set of representations of message thread titles into clusters of representations of message thread titles determined to be similar, the decomposing of the set of representations of message thread titles into clusters of representations of message thread titles determined to be similar being influenced by the decomposing of the set of representations of message thread contents into clusters of representations of message thread contents determined to be similar.

2. The method of claim 1 wherein the decomposing the set of representations of message thread contents into clusters of representations of message thread contents determined to be similar is influenced by the decomposing the set of representations of message thread titles into clusters of representations of message thread titles determined to be similar.

3. The method of claim 2 wherein decomposing the set of representations of message thread contents into clusters of representations of message thread contents determined to be similar and decomposing the set of representations of message thread titles into clusters of representations of message thread titles determined to be similar comprises minimizing a function that includes a component that represents a probability that the representations of message thread titles are decomposed into clusters that are different from the clusters into which their corresponding representations of message thread contents are decomposed and that includes a component that represents entropies of the clusters of representations of message thread contents and the clusters of representations of message thread titles.

4. The method of claim 2 wherein:

decomposing the set of representations of message thread contents into clusters of representations of message thread contents determined to be similar comprises decomposing the set of representations of message thread contents into a first hierarchical tree of nodes of clusters of representations of message thread contents that each include a different cluster of representations of message threads contents such that the first hierarchical tree has a first root node that includes the set of representations of message thread contents and each child node in the first hierarchical tree includes a subset of the cluster of representations of message threads included in its parent node; and

decomposing the set of representations of message thread titles into clusters of representations of message thread titles determined to be similar comprises decomposing the set of representations of message thread titles into a second hierarchical tree of nodes of clusters of representations of message thread titles that each include a different cluster of representations of message thread titles such that the second hierarchical tree has a second root node that includes the set of representations of message thread titles and each child node in the second hierarchical tree includes a subset of the cluster of representations of message threads included in its parent node.

5. The method of claim 1 wherein:

constructing a set of representations of the contents of the accessed collection of message threads includes constructing, for each message thread within the collection of message threads, a feature vector representing the contents of the message thread; and

constructing a set of representations of the titles of the accessed collection of message threads includes constructing, for each message thread within the collection of message threads, a feature vector representing the title of the message thread.

6. The method of claim 1 wherein:

decomposing the set of representations of message thread contents into clusters of representations of message thread contents determined to be similar includes;

generating a first cluster of representations of message thread contents that includes multiple representations of message thread contents, and

generating a second cluster of representations of message thread contents that includes no more than one representation of message thread contents; and

decomposing the set of representations of message thread titles into clusters of representations of message thread titles determined to be similar includes;

generating a first cluster of representations of message thread titles that includes multiple representations of message thread titles, and

generating a second cluster of representations of message thread titles that includes no more than one representation of a message thread title.

7. The method of claim 1 further comprising:

receiving a search query;

comparing the received search query to representations of the clusters of representations of message thread titles;

based on comparing the received search query to the representations of the clusters of representations of message thread titles, identifying, from among the representations of the clusters of representations of message thread titles, a representation of a particular cluster of representations of message thread titles as matching the received search query; and

causing a display of indications of the message threads corresponding to the representations of message thread titles of the particular cluster.

8. A computer-implemented method comprising:

accessing, from a computer memory storage system, a collection of feature vectors that represent corresponding clusters of message threads, multiple of the feature vectors representing clusters of message threads that include more than one message thread;

receiving a search query;

comparing the received search query to the accessed collection of feature vectors;

based on comparing the received search query to the accessed collection of feature vectors, identifying, from among the collection of feature vectors, a particular feature vector as matching the received search query;

determining that the particular feature vector represents a particular cluster of one or more particular message threads; and

causing a display of indications of the one or more particular message threads.

9. The method of claim 8 further comprising:

after causing the display of the indications of the one or more particular message threads, receiving a request for more message threads;

accessing, from the computer memory storage system, a hierarchical tree having multiple nodes including a root node and multiple leaf nodes, each node in the tree including a different cluster of message threads and each parent node in the tree including all of the message threads from each of its child nodes, the clusters of message threads included in the leaf nodes corresponding to the clusters of message threads represented by the feature vectors in the collection of feature vectors;

as a consequence of having received the request for more message threads, identifying a particular parent node in the tree as being the parent node for a leaf node that, corresponds to the particular cluster of one or more message threads; and

causing a display of indications of the message threads included within the particular parent node.

10. The method of claim 8 wherein the feature vectors represent clusters of titles of message threads such that accessing a collection of feature vectors that represent corresponding clusters of message threads includes accessing a collection of feature vectors that represent corresponding clusters of titles of message threads.

11. The method of claim 8 wherein the feature vectors represent clusters of titles of message threads but not the content of the message threads such that accessing a collection of feature vectors that represent corresponding clusters of titles of message threads includes accessing a collection of feature vectors that represent corresponding clusters of titles of message threads but not the content of the message threads.

12. The method of claim 8 further comprising converting the received search query into a search query feature vector representing the received search query, wherein comparing the received search query to the accessed collection of feature vectors includes comparing the search query feature vector to the accessed collection of feature vectors.

13. The method of claim 8 wherein identifying, from among the collection of feature vectors, the particular feature vector as matching the received search query includes determining that, among the collection of feature vectors, the particular feature vector is most similar to the received search query.

14. A system comprising:

one or more processing elements; and

a computer memory storage system storing;

a set of representations of message thread titles,

a set of representations of message thread contents, each representation of message thread contents corresponding to a representation of a message thread title within the set of message thread titles, and

instructions that, when executed, cause the one or more processing elements to;

grow a hierarchical tree of clusters of the representations of message thread titles,

grow a hierarchical tree of clusters of the representations of message thread contents,

given the hierarchical tree of clusters of representations of message thread contents, prune the hierarchical tree of clusters of the representations of message thread titles to generate a pruned hierarchical tree of clusters of the representations of message thread titles having a reduced probability that the representations of message thread titles are included within clusters that are different from the clusters into which their corresponding representations of message thread contents are included relative to the un-pruned hierarchical tree of clusters of the representations of message thread titles, and

given the hierarchical tree of clusters of representations of message thread titles, prune the hierarchical tree of clusters of the representations of message thread contents to generate a pruned hierarchical tree of clusters of the representations of message thread contents having a reduced probability that the representations of message thread contents are included within clusters that are different from the clusters into which their corresponding representations of message thread titles are, included relative to the un-pruned hierarchical tree of clusters of the representations of message thread contents.

15. The system of claim 14 wherein:

the instructions that, when executed, cause the one or more processing elements to grow a hierarchical tree of clusters of the representations of message thread titles include instructions that, when executed, cause the one or more processing elements to use entropy of the hierarchical tree of clusters of the representations of message thread titles as a constraint on growth of the hierarchical tree of clusters of the representations of message thread titles; and

the instructions that, when executed, cause the one or more processing elements to grow a hierarchical tree of clusters of the representations of message thread contents include instructions that, when executed, cause the one or more processing elements to use entropy of the hierarchical tree of clusters of the representations of message thread contents as a constraint on growth of the hierarchical tree of clusters of the representations of message thread contents.