Computer method and system for ranking users in a network community of users
First Claim
1. A method for distributing digital content comprising:
- in a hardware processor;
storing in a database of an Internet-based social network a plurality of user profiles, different ones of the stored user profiles representing different users in the Internet-based social network and each stored user profile including indications of rank in the Internet-based social network of the respective user represented by the profile;
accessing a search database storing digital content viewed by the users of the Internet-based social network, the digital content being from a plurality of global computer network sites;
identifying an importance of an individual user as a plurality of functions of user demand of the individual user;
determining at least one relative rank of the individual user based on the identified importance, said determining including;
(i) representing the social network as an interconnected network graph having nodes and directional connection lines between the nodes, each node being a respective person and each directional connection line being a connection from a person requesting the connection to a person being connected to, and (ii) modeling the connections between people represented in the interconnected network graph as a mathematical edge-weighted directed graph, wherein the mathematical edge-weighted directed graph mathematically takes into account the entire interconnected network graph at once and derives the importance of the individual user as the plurality of functions of user demand recursively for the entire interconnected network graph, such that the at least one relative rank of the individual user is determined after one pass of iterations by determining a product of a first matrix and a second matrix, the first matrix being based on and representing connections between nodes of the mathematical edge-weighted directed graph and the second matrix being based on and representing a number of nodes in the graph so as to account for the entire interconnected network graph;
updating in the respective user profile, the indications of the at least one determined relative rank of the individual user, said user profile stored in the database of user profiles of the social network;
prioritizing at least some of the digital content in the search database as a function of at least the determined relative rank stored in the user profiles of the respective users that viewed the digital content anddistributing the content based on the prioritization,wherein said hardware processor is configured to perform said storing, identifying, determining, updating, prioritizing, and distributing.
12 Assignments
0 Petitions
Accused Products
Abstract
A computer method and system for ranking computer network portal users is provided. The system and method comprise a ranking module which determines rank of an individual in a community of global computer network users. The ranking module determines rank of an individual as a function of user demand. The function of user demand includes any one or combination of number of requests to be connected to the individual user, readership following of the individual user and keywords common between profiles or authored works by the individual user and those of other users. An output member is coupled to receive the determined rank from the ranking module and generates an ordered list of user names ordered by determined rank of individuals. The rank of individuals may be provided to external entities such as fraud detection systems or advertising targeting engines.
-
Citations
48 Claims
-
1. A method for distributing digital content comprising:
-
in a hardware processor; storing in a database of an Internet-based social network a plurality of user profiles, different ones of the stored user profiles representing different users in the Internet-based social network and each stored user profile including indications of rank in the Internet-based social network of the respective user represented by the profile; accessing a search database storing digital content viewed by the users of the Internet-based social network, the digital content being from a plurality of global computer network sites; identifying an importance of an individual user as a plurality of functions of user demand of the individual user; determining at least one relative rank of the individual user based on the identified importance, said determining including;
(i) representing the social network as an interconnected network graph having nodes and directional connection lines between the nodes, each node being a respective person and each directional connection line being a connection from a person requesting the connection to a person being connected to, and (ii) modeling the connections between people represented in the interconnected network graph as a mathematical edge-weighted directed graph, wherein the mathematical edge-weighted directed graph mathematically takes into account the entire interconnected network graph at once and derives the importance of the individual user as the plurality of functions of user demand recursively for the entire interconnected network graph, such that the at least one relative rank of the individual user is determined after one pass of iterations by determining a product of a first matrix and a second matrix, the first matrix being based on and representing connections between nodes of the mathematical edge-weighted directed graph and the second matrix being based on and representing a number of nodes in the graph so as to account for the entire interconnected network graph;updating in the respective user profile, the indications of the at least one determined relative rank of the individual user, said user profile stored in the database of user profiles of the social network; prioritizing at least some of the digital content in the search database as a function of at least the determined relative rank stored in the user profiles of the respective users that viewed the digital content and distributing the content based on the prioritization, wherein said hardware processor is configured to perform said storing, identifying, determining, updating, prioritizing, and distributing. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26)
-
-
27. A computer system for distributing digital content comprising:
-
a database of an Internet-based social network containing a plurality of user profiles, different ones of the stored user profiles representing different users in the Internet-based social network, each stored user profile including indications of rank in the Internet-based social network of the respective user represented by the profile; a search database containing digital content viewed by the users of the Internet-based social network, the digital content being from a plurality of global computer network sites; a processor configured to identify an importance of the individual user as a plurality of functions of user demand; the processor further configured to execute a computer program comprising instructions for execution by a processor, from a non-transitory computer readable storage medium, the computer program adapted for; determining at least one relative rank of the individual user based on the identified importance, said determining including;
(i) representing the social network as an interconnected network graph having nodes and directional connection lines between the nodes, each node being a respective person and each directional connection line being a connection from a person requesting the connection to a person being connected to, and (ii) modeling the connections between people represented in the interconnected network graph as a mathematical edge-weighted directed graph, wherein the mathematical edge-weighted directed graph mathematically takes into account the entire interconnected network graph at once and derives the importance of the individual user as the plurality of functions of user demand recursively for the entire interconnected network graph, such that the at least one relative rank of the individual user is determined after one pass of iterations by determining a product of a first matrix and a second matrix, the first matrix being based on and representing connections between nodes of the mathematical edge-weighted directed graph and the second matrix being based on and representing a number of nodes in the graph so as to account for the entire interconnected network graph; andupdating in the user profile, the indications of the at least one determined relative rank of the individual user, said user profile corresponding to the individual user and being stored in the database of user profiles of the social network; prioritizing at least some of the digital content in the search database as a function of at least the determined relative rank stored in the user profiles of the respective users that viewed the digital content and distributing the digital content at least based on the prioritization. - View Dependent Claims (28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48)
-
Specification