US8676909B2ActiveUtilityA1

Method, system and architecture for delivering messages in a network to automatically increase a signal-to-noise ratio of user interests

Assignee: GUYOT PAULPriority: Jun 22, 2009Filed: Jun 15, 2010Granted: Mar 18, 2014
Est. expiryJun 22, 2029(~2.9 yrs left)· nominal 20-yr term from priority
H04L 51/212
69
PatentIndex Score
11
Cited by
25
References
15
Claims

Abstract

The present invention pertains to a method for delivering messages in a social network to increase a signal-to-noise ratio for the recipients of messages, characterized in that a process mechanism comprises of a diffusion process and a selection process combined through an adaptive process, in which: the diffusion process dispatches each message through dynamic routing graphs defined between the sender user and a set of potentially interested recipient users; the selection process locally filters the messages that are transmitted from sender users and received by potentially interested recipient users, according to the result of the application of a selection function on the metadata values constituting a message profile extracted from each transmitted message and weighted feature values constituting a user profile of the recipient to establish an estimate of interest for the user regarding each message, and the adaptive process continuously adjusts processing functions to adapt the graphs structure according to the user profiles dynamically updated by message metadata.

Claims

exact text as granted — not AI-modified
The invention claimed is: 
     
       1. Method for delivering messages in a social network to increase a signal-to-noise ratio for recipient users of messages comprising a diffusion process and a selection process in which:
 the diffusion process dispatches each message through routing graphs between sender user and recipient users; 
 the selection process locally filters the messages that are transmitted from sender users and received by recipient users, according to the result of the application of a selection function on metadata values constituting a message profile extracted from each transmitted message and feature values constituting a user profile of each recipient; 
 
       and characterised in that:
 the diffusion process dispatches each message from sender users to a set of potentially interested recipient users chosen on a basis of features extracted from messages; 
 the diffusion process and the selection process are combined in an adaptive process where the selection functions and the routing graphs are continuously adjusted by updates of sender and receiver profiles triggered by user actions and message metadata of exchanged messages. 
 
     
     
       2. Method for delivering messages according to  claim 1  wherein the selection function is based on an inner product between a message vector based on metadata as coordinates extracted from the message profile space and a user vector based on weighed feature values as coordinates of the user profiles space, the maximization being achieved by selecting the inner product values greater than a threshold value. 
     
     
       3. Method for delivering messages according to  claim 1 , wherein the message profile extracted from the message comprises metadata chosen between at least one list of weighted feature values, a list of users identified in the message, a unique login of the sender user, of the former message in connection with the current message and of the primary message of linked messages, a sequence of characters to identify the software configuration or support used to send the message and the network on which the message is transmitted, the time of the message, Boolean information to indicate the confidentiality degree of the message and its accessibility in another network. 
     
     
       4. Method for delivering messages according to  claim 1 , wherein at least two types of graphs are used, a topic graph and a user graph, the topic graph diffusing messages according to topics mentioned in the messages and the user graph diffusing messages according to the relationships between users as recorded in user profiles. 
     
     
       5. Method for delivering messages according to  claim 1 , wherein the graphs are modified according to changes in the content of messages and changes in message flows. 
     
     
       6. Method for delivering messages according to  claim 1 , wherein a route is created between two users when the rate of messages exchanged between them is greater than a predetermined threshold. 
     
     
       7. Method for delivering messages according to  claim 1 , wherein the adaptive selection function has at least two outcomes:
 the message is discarded, and if received again it will be discarded as well, as a result, the user will not receive the message unless the user profile is updated to permit the distribution of the message; 
 the message is only delivered once and discarded if received again. 
 
     
     
       8. System for delivering messages in a social network to implement the method according to  claim 1 , comprising user nodes distributed on several computers, the messages being diffused through a user graph that links sender user nodes and potential recipient user nodes characterised in that messages are filtered according to a selection function and links between nodes are continuously modified, created or destroyed in response to user actions or updates in user profiles or transmission of messages. 
     
     
       9. System for delivering messages according to  claim 8 , comprising diffusion feature nodes and where messages are diffused through routing graphs sender user nodes can be indirectly connected to recipient user nodes through diffusion feature nodes, characterised in that links between user nodes and feature nodes are continuously modified, created or destroyed in response to updates in user profiles or transmission of messages. 
     
     
       10. System for delivering messages according to  claim 8 , wherein the routing graphs are dynamically adapted to involve updated features nodes and new feature nodes created from message profiles extracted from newly transmitted messages with a pre-process tool. 
     
     
       11. System for delivering messages according to  claim 8 , wherein links in routing graphs are created or respectively destroyed when a feature value or a weighted feature value in a user profile raises above a predetermined threshold or respectively decreases below a predetermined threshold. 
     
     
       12. System for delivering messages according to  claim 8 , wherein a selection feature used in the selection process at the recipient user nodes is chosen between the language and the topics mentioned in the messages. 
     
     
       13. System for delivering messages according to  claim 8 , wherein each recipient user node comprises two selection functions with different thresholds or parameters, delivering messages through a realtime flow and an asynchronous flow, each delivery happening through different interfaces. 
     
     
       14. System for delivering messages according to  claim 8 , wherein the combination of the following dynamic adaptive tools of:
 updating the profile of the sender user, 
 updating the connections of user nodes with feature nodes, 
 updating the connections of user nodes with other user nodes, 
 updating the profile of the recipient users and 
 adaptive selection of messages, 
 
       delivers messages according to automatically identified user interests. 
     
     
       15. Method for delivering messages according to  claim 7 , wherein the adaptive selection function has at least three outcomes:
 the message is discarded, and if received again it will be discarded as well, as a result, the user will not receive the message unless the user profile is updated to permit the distribution of the message; 
 the message is only delivered once and discarded if received again, and 
 the message is put on hold, and if received again, the adaptive selection function will consider feature values and metadata included in all instances of the message.

Join the waitlist — get patent alerts

Track US8676909B2 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.