Linkedin Corporation

Microsoft Technology Licensing, LLC

Cisco Technology, Inc.

Christian Posse

Anmol Bhasin

Abhishek Gupta

Jian H Li

Yurong Shi

Jacob Kessler

Monica Rogati

Junghoon (Andrew) Ahn

Jiong Wang

Ramesh Dommeti

Alexis Pribula

Michael Grishaver

Wing Li

Satish K Gannu

Dmytro Andriyovich Ivchenko

Elizabeth Ethel Burstein

Parker R Barrile

Ashutosh Arwind Malegaonkar

Kui Zhang

Baoshi Yan

Virgil Nicolae Mihailovici

Deepti Patil

Junghoon Andrew Ahn

Sonali Mihir Sambhus

Mohammad Shafkat Amin

Thangavelu Arumugam

Sripad Sriram

Nitasha Walia

Techniques for identifying and presenting member profiles similar to a source member profile are described. With some embodiments, a general recommendation engine is used to extract features from member profiles, and then store the extracted features, including any computed, derived or retrieved profile features, in an enhanced member profile. In real-time, the general recommendation engine processes client requests to identify member profiles similar to a source member profile by comparing select profile features stored in the enhanced member profile with corresponding profile features of the source member profile, where the comparison results in several similarity sub-scores that are then combined in accordance with directives set forth in a configuration file. Finally, the member profiles with the highest similarity scores corresponding with the user-selected member profile are selected, and in some instances, presented to a user.

Suggesting candidate profiles similar to a reference profile

Techniques for leveraging a social graph to facilitate the delivery of relevant recommendations. For example, a recommender is identified based on the recommender being a member of a social networking service who has interacted with an item of web-based content. A recommendee is identified based on the recommendee being another member of the social networking service who is connected to the recommender via a social graph maintained by the social networking service and based on having an affinity score for the item that exceeds a recommendee affinity score threshold and a connection strength to the recommender that exceeds a connection strength threshold. The recommender is sent a communication that invites the recommender to recommend the item to the recommendee. With some example embodiments, the communication is sent to the recommender within a pre-determined time measured from the time the recommender initiated an interaction with the item of web-based content.

Leveraging a social graph to deliver relevant recommendations

Disclosed in some examples are methods, systems and machine readable medium for recommending an out-of-network communication by determining a set of potential recommended members of a social networking service based upon one or more recommendation criteria. In some examples the recommendation criteria may include: a profile similarity to a previous target of an out-of-network communication, a degree of correspondence between an interest and intent of the sending member, and a likelihood of response.

Suggested out of network communication recipients

A system may include a network interface, a user interface, and a recommendation engine. The user interface may be configured to receive a company characteristic of a company profile of a company posted to the social network and a company bid from an entity related to company to the social network. The recommendation engine may be configured to determine an aggregate company score for the user based on a relevance of the company characteristic to a user characteristic and the company bid. The network interface may be configured to transmit a message related to the company to the user based, at least in part, on the aggregate company score.

User characteristics-based sponsored company postings

A first user of a presentation machine may be a recruiter that initiates an action in reference to a first user profile. The first user profile may describe a first candidate for a job. The presentation machine may identify the first user profile and determine a similarity score that indicates a degree of similarity between the first user profile and a second user profile that describes a second candidate for the job. The presentation machine may also access a volatility score that indicates a likelihood that the second candidate is receptive to a proposal that the second candidate be employed by an employer. Based on the similarity score and on the volatility score, the presentation machine may determine a rank of the second user profile. Based on the determined rank, the presentation machine may present the second user profile to the first user.

Presenting a user profile

A statistically overrepresented token in the descriptions of users associated with a target entity may be descriptive of the target entity. This may be true regardless of whether a primary description of the entity includes the overrepresented token. Accordingly, the entity description machine may access multiple descriptions of multiple users associated with the target entity. A portion of the multiple descriptions may each include a token descriptive of the target entity and of a subset of the multiple users. The entity description machine may determine that the token is overrepresented among the tokens within the multiple descriptions and generate a supplemental description of the target entity, where the supplemental description includes the overrepresented token. Once the supplemental description is generated, the entity description machine may use the supplemental description in referencing the target entity.

Generating a supplemental description of an entity

Methods and systems for identifying member profiles similar to a source member profile

A machine may implement a recommender that provides recommendations to users. The machine may be configured to present a first version of the recommender configured by various parameters. A user may submit a message to the machine, and the machine may identify a parameter among the various parameters by tokenizing the message and identifying the parameter among the tokens. The machine may then generate a second version of the recommender by modifying the parameter and configuring the second version according to the modified parameter. The machine may then present the first and second versions of the recommender contemporaneously two different portions of the users. By tokenizing a further message received from the users, the machine may evaluate the first and second versions and determine whether the second version is a replacement of the first version.

Recommender evaluation based on tokenized messages

Growing community of inventors

Forster City, CA, United States of America

Christian Posse