Patent application number | Description | Published |
20130318036 | ZENO: BATCH-COMPUTED NEWS FEED UPDATES - A system may receive, at least in part from an update database, a plurality of updates to a plurality of profiles that individually describe ones of a plurality of users of a social network. The system may process, using a batch processor, at least some of the plurality of updates to generate a consolidated update indicative of a status of at least some of the plurality of profiles. The system may transmit the consolidated update to the update database. The system may display the consolidated update on an update stream of the social network corresponding to at least one of the plurality of users. | 11-28-2013 |
20140304202 | CONNECTION INVITATION ORDERING - Disclosed in some examples are methods, systems, and machine-readable mediums which provide a relevance engine for determining a relevance of an individual (either a non-member or another member) to another individual (either a non-member or another member). This relevance engine may use signals in the form of data that the social networking service may learn about the individuals to determine how relevant the individuals are to each other. Example applications may include ordering of connection invitations in a social networking service. | 10-09-2014 |
20150039667 | INCREMENTAL PROCESSING ON DATA INTENSIVE DISTRIBUTED APPLICATIONS - Disclosed in some examples are methods, machine readable mediums, and systems which build upon traditional frameworks such as Hadoop for developing incremental monoid computations. In some examples, the traditional frameworks requires no modifications, and may provide an accumulator-based interface for programmers to store and use state across successive runs; the framework may ensure that only the necessary sub-computations are performed and incremental state management may be hidden from the programmer. | 02-05-2015 |
20150046539 | TECHNIQUES TO FACILITATE RECOMMENDATIONS FOR NON-MEMBER CONNECTIONS - Disclosed in some examples are methods, systems, and machine-readable mediums which provide a relevance engine for determining a relevance of an individual (either a non-member or another member) to another individual (either a non-member or another member). This relevance engine may use signals in the form of data that the social networking service may learn about the individuals to determine how relevant the individuals are to each other. | 02-12-2015 |
20150106361 | GENERATING MEMBER PROFILE RECOMMENDATIONS BASED ON COMMON CONNECTION DATA IN A SOCIAL GRAPH - Systems and methods for generating recommendations based on data derived from a social network are described. For example, a first indirect connection of a source member profile may be identified. The first indirect connection is a member profile connected to the source member through a first connection path. A second indirect connection of the source member profile is also identified. The second indirect connection is a member profile connected to the source member through a second connection path. A selection is made between the first indirect connection and the second indirect connection based on a comparison of common connection scores calculated for the indirect connections. The selected indirect connection is then surfaced to a client device associated with the source member profile. | 04-16-2015 |
20150106365 | GENERATING MEMBER PROFILE RECOMMENDATIONS BASED ON CONNECTION TIMING DATA IN A SOCIAL GRAPH - Systems and methods for generating recommendations based on data derived from a social network are described. For example, a first indirect connection of a source member profile may be identified. The first indirect connection is a member profile connected to the source member through a first connection path. A second indirect connection of the source member profile is also identified. The second indirect connection is a member profile connected to the source member through a second connection path. A selection is made between the first indirect connection and the second indirect connection based on a comparison of timing scores calculated for the indirect connections. The selected indirect connection is then surfaced to a client device associated with the source member profile. | 04-16-2015 |
20150106371 | GENERATING CONNECTION RECOMMENDATIONS BASED ON RECENT CONNECTIONS AND CONNECTIONS OF CLOSE CONNECTIONS - The present disclosure is directed to methods, systems, and computer program products for rendering member profile suggestions based on data derived from a social graph and activity data derived from a social network service operation on the social graph. A social network service may store member or organization profiles as nodes on the social graph. In response to a recommendation event, the social network service may identify a source profile having direct connections to a first set of profiles. The social network service may then determine a second set of profiles that are directly connected to one or more profiles of the first set of profiles. The profiles may be further associated with connection activity information, and the social network service may select one or more of the profiles from the second set of profiles as recommended profiles for the source profile based on the connection activity information. | 04-16-2015 |
20150112898 | SITE FLOW OPTIMIZATION - A method and system to present an optimum action in response to a flow of actions in a computer network from a user are provided. For each of a plurality of possible presented actions corresponding to a particular flow of actions in a computer network, and for each of one or more possible performed actions for each possible presented action, a likelihood that a user will perform the possible performed action is determined. Then each of the determined likelihoods is weighted by applying a weight assigned to a corresponding possible presented action. An optimum presented action is identified determining a presented action having a weighted maximum determined likelihood, based on the weighted determined likelihood. | 04-23-2015 |