METHOD AND APPARATUS FOR PROCESSING MESSAGES IN A SOCIAL NETWORK

• US 20140129590A1
• Filed: 01/09/2014
• Published: 05/08/2014
• Est. Priority Date: 02/14/2006
• Status: Active Grant

• Current Assignee: Calabrio
• Original Assignee: SRI International, Inc.
• Inventors: Davitz, Jeffrey, Basu, Sugato, Yu, Jiye, Gutelius, David
• Granted Patent: US 8,923,830 B2
• Time in Patent Office: Days
• US Class Current: 707/770
• CPC Class Codes: G06F 16/13 File access structures, e.g. distributed indices arrangements of input from, or output to, record carriers G06F3/06
• CPC Class Codes: G06F 16/2471 Distributed queries
• CPC Class Codes: G06F 16/90335 Query processing
• CPC Class Codes: H04L 51/04 Real-time or near real-time messaging, e.g. instant messaging [IM]
• CPC Class Codes: H04L 51/52 for supporting social networking services
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1072 Discovery involving ranked list compilation of candidate peers
• CPC Class Codes: H04L 67/303 Terminal profiles

Abstract

In one embodiment, the present invention is a method and apparatus for knowledge generation and deployment in a distributed network. In one embodiment, a method for processing messages in a social network includes receiving a new message from a first node in the network, the new message including a query, providing the first node with an answer to the query, if the answer is located in a repository, and initiating generation of the answer, if the answer is not located in the repository.

Claims

1. A method for routing a query within a social network, the method performed by a computer processor and comprising:

algorithmically deriving, by the processor, for each node of a plurality of nodes in the social network, a metric representing expertise of the node to respond to queries;

receiving the query;

directing the query to one or more of the plurality of nodes in the social network;

receiving a tagged version of the query from at least one of the one or more of the plurality of nodes, the tagged version comprising meta-content that was added by one or more of the plurality of nodes;

algorithmically identifying, by the processor, one or more candidate nodes to whom to further direct the query, based at least in part on the metric representing expertise derived for each of the one or more candidate nodes and based at least in part on the meta-content in the tagged version of the query;

directing the query to the candidate nodes.

2. The method of claim 1, wherein the meta-content includes a suggestion of a specific node in the plurality of nodes to whom to direct the query.

3. The method of claim 1, wherein the meta-content includes a topic label related to content of the query.

4. The method of claim 1, wherein the meta-content includes a keyword related to content of the query.

5. The method of claim 1, wherein the meta-content includes a solicitation for clarification of the query.

6. The method of claim 1, wherein the meta-content indicates that the at least one of the one or more of the plurality of nodes is interested in future responses to the query.

7. The method of claim 1, further comprising:

storing meta-content with the query.

8. The method of claim 1, further comprising:

updating the metric representing expertise for the at least one of the one or more of the plurality of nodes.

9. The method of claim 1, wherein the meta-content is added by the at least one of the one or more of the plurality of nodes from whom the tagged version is received.

10. The method of claim 1, wherein the meta-content is added by a node to whom the query was forwarded by one or more others of the plurality of nodes.

11. A method for responding to queries for use with a social network, the method performed by a computer processor and comprising:

algorithmically deriving, by the processor, for each node of a plurality of nodes in the social network, a metric representing expertise of the node to respond to queries;

receiving a first query;

algorithmically identifying, by the processor, one or more candidate nodes to whom to direct the first query, from among the plurality of nodes, based at least in part on the metric representing expertise for each of the candidate nodes;

directing the first query to the candidate nodes;

receiving a response to the first query from at least one of the candidate nodes;

storing the first query and the response in a database;

[0046-0047;

0040]

receiving a second query;

determining that the second query meets a threshold of similarity to a stored query stored in the database; and

responding to the second query based on a response stored with the stored query.

12. The method of claim 11, wherein at least one of the second query and the stored query includes meta-content added by one of the plurality of nodes.

13. The method of claim 12, wherein said determining that the threshold of similarity is met takes into account the meta-content.

14. The method of claim 13, wherein the meta-content includes a topic label related to content of the second query or the stored query.

15. The method of claim 13, wherein the meta-content includes a keyword related to content of the query.

16. The method of claim 11, further comprising:

validating the response, prior to the storing.

17. The method of claim 16, wherein the validating comprises:

forwarding the first query and the response to one or more validation nodes selected from among the plurality of nodes.

18. The method of claim 17, wherein the validating further comprises:

examining meta-content added by at least one of the one or more validation nodes, wherein the meta-content specifies a quality of the response.

19. A method for routing a message within a social network, the method performed by a computer processor and comprising:

algorithmically deriving, by the processor, for each node of a plurality of nodes in the social network, a first metric representing expertise of the node regarding each of one or more topics, wherein the first metric is based at least partly on an algorithmically-generated topic model of content that is at least one of;

authored by the node or read by the node;

algorithmically deriving, by the processor, for each node of the plurality of nodes, a second metric, based on at least one of;

(i) an affinity of one or more other nodes in the social network to refer messages to the node or (ii) a likelihood of a human user of the node to respond to messages;

receiving a message;

determining a relevant topic to which the message relates;

algorithmically identifying, by the processor, one or more candidate nodes in the social network to whom to direct the message, based at least in part on the first metric derived for each of the candidate nodes with respect to the relevant topic, and based at least in part on the second metric derived for each of the candidate nodes;

directing the message to the candidate nodes; and

updating the first metric, at least with respect to the relevant topic, for one or more of the candidate nodes based on a response provided by the one or more of the candidate nodes to the message.