Abstract: In an example embodiment, usage information is used to calculate one or more individual document historical information-deficient metrics (IDHIDMs) by combining values for the one or more metrics from multiple documents within the document corpus that share an identical combination of entities of the one or more entity types. A search query is segmented into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type. At least one IDHIDM for a combination of entities matching the tagged segments is used to rank one or more retrieved documents responsive to the query.

Abstract: In order to acquire content about an event, a collection group of users of a social network may be dynamically identified. This collection group of users may be relevant to and/or proximate to the event. For example, the collection group of users may be identified based on their user or member profiles and characteristics of the event. Then, recommendations may be provided to the collection group of the users to acquire content, such as an image or a video associated with the event. Moreover, acquired content may be subsequently presented to the users of the social network. In addition, the behaviors of the users in the social network (such as a number of views of the content and/or a duration of the views) may be used to determine the event characteristics that are the most interesting to the users, thereby improving future content acquisition.

Abstract: In order to facilitate access to pages in documents (such as slides in presentations and/or frames in videos), a system may create pointers specifying the pages in the documents, and may aggregate the pointers in an index. For example, the index may be aggregated based on keywords in content in the documents, metadata associated with the documents and/or presentation formats of the pages. Then, when the system receives a search query, the system may identify a match in the pointers in the index based on the search query and the keywords, the metadata and/or the presentation formats in the index. Next, the system may provide a pointer in the index based on the match. This pointer may allow a page in a document to be accessed without extracting or copying the page.

Abstract: In order to facilitate access to pages in documents, a system may ingest pointers that specify the pages in the documents from hypertext documents on a network, and may aggregate the ingested pointers in an index. For example, the index may be aggregated based on keywords in content in the documents, metadata associated with the documents and/or presentation formats of the pages. Then, when the system receives a search query, the system may identify a match in the pointers in the index based on the search query and the keywords, the metadata and/or the presentation formats in the index. Next, the system may provide a link with a pointer in the index based on the match. When the system receives information specifying activation of the link, the system may access a page in a document associated with a hypertext document, without extracting or copying the page.

Abstract: A system, method, and apparatus are provided for depicting attributes of a user's or member's connections within a professional or social network, in a manner that enables insight into the nature of the connections. When insight into a first member's connections is to be depicted, one or more attributes of first-degree connections (i.e., direct connections) and/or other connections are retrieved (e.g., employer or associated organization, function or role, seniority, skill(s)), over all time or some threshold period of time into the past. The values for the attributes are aggregated over the examined connections, and some or all values are displayed with one or more visual characteristics (e.g., size, color) that indicate a frequency or commonness of the values among the connections. The system or apparatus may include a user interface through which the depiction is presented in place of or in addition to a display of the connections.

Abstract: The disclosed embodiments provide a system for facilitating interaction within a social network. During operation, the system obtains a set of clusters of users in a graph of a social network, wherein the graph includes a set of nodes representing the users and a set of edges representing relationships between pairs of the users. Next, the system identifies low connectivity between a first cluster and second cluster in the set of clusters and high compatibility between a first user from the first cluster and a second user from the second cluster. The system then generates, based on the high compatibility, an introduction of the first and second users to facilitate increased interaction between the first and second users.

Abstract: The disclosed embodiments provide a method and system for performing network A/B testing. During operation, the system obtains, for a set of users in a social network, a set of treatment assignments of the users in an A/B test, wherein the treatment assignments indicate exposure of the users to a control version or a treatment version of a message. Next, the system obtains, for each of the users, a fraction of neighbors exposed to the treatment version in the A/B test. The system then applies a statistical model to the treatment assignments and the fraction of neighbors exposed to the treatment version to estimate an average treatment effect (ATE) for the set of users. Finally, the system selects, based on the ATE, a fraction of additional users in the social network for subsequent exposure to the treatment version and presents the treatment version to the fraction of additional users.

Abstract: In order to prevent data thrashing and the resulting performance degradation, a computer system may maintain an application-layer cache space to more effectively use physical memory and, thus, significantly improve an application-memory hit ratio and reduce disk input-output operations. In particular, the computer system may maintain a managed memory cache that is separate from a page cache. The managed memory cache may be managed according to predefined caching rules that are separate from the caching rules in the operating system that are used to manage the page cache, and these caching rules may be application-aware. Subsequently, when data for an application is accessed, the computer system may prefetch the data and associated information from disk and store the information in the managed memory cache based on data correlations associated with the application.

Abstract: A system, apparatus, and method are provided for configuring web feeds for users/subscribers. A user identifies a topic of interest, which may be a person, organization, event, place, concept, or other thing. A content processor analyzes content items received from a multitude of publishers' feed to identify their topics. A relevance score regarding each associated topic is calculated for each of the received items and, for each user that subscribed to the topic, the item's relevance score is compared to a user-specific threshold relevance score to determine whether to add it to the user's feed. The threshold relevance score for a topic for a user is computed based on factors such as the average relevance scores of the topic's content items, the standard deviation, the user's relationship with the topic, a target frequency with which items corresponding to the topic should be offered to the user, etc.

Abstract: Techniques for intelligent scheduling of content sharing by company employees via an online social networking service are described. According to various embodiments, a request is received from a member of an online social networking service to share a content item among members in the member's connection network on the online social networking service. Member behavior log data associated with the members in the connection network of the member is then accessed. Thereafter, an optimum sharing time for sharing the content item among the members in the member's connection network is calculated. The content item is then caused to be shared at the optimum sharing time with the members in the member's connection network.

Abstract: A system, apparatus, and method are provided for retrieving new content from a multitude of web feeds (e.g., hundreds of thousands). Each of multiple sources hosts one or more web feeds (e.g., RSS feeds, Atom feeds), and is categorized based on how frequently new content is found in the source's feeds. Each source has a corresponding status indicator whose value increases (to a maximum value), each time the source's feeds are serviced (e.g., polled, downloaded) and new content is received, or decreases (to a minimum value) if no new content is received and the indicator has not been recently decreased. Each category of web feed source corresponds to a range of possible status indicator values, and a given source may dynamically move between categories as its status indicator value changes.

Abstract: Disclosed in some examples are methods, machine readable mediums, and systems for providing a list of skills a member should learn in order to achieve a particular goal. The system may provide a user interface to the member of the social networking service. Through the user interface, the member may select one or more goals that they wish to achieve. Based upon these goals, the list of skills associated with that goal may be determined—this list is a goal set of skills. The goal set of skills may be compared to the member's current skills. Skills in the list of goal skills that the member does not already possess may be recommended to the member.

Abstract: Systems and methods are disclosed that recommend one or more electronic presentations to a user based on one or more factors. These factors may include contextual information, behavioral information, profile information, or combinations of the foregoing. Contextual information may include content and/or features extracted from a given electronic presentation. Behavioral information may include user behavioral data, such as the number of times a user has viewed a presentation, the amount of the presentation viewed by the user, presentations previously viewed by the user, and other such behavioral data. Profile information may include user professional profile information, such as skills the user has identified as possessing, employment history information, and other such user professional profile information.

Abstract: A system receives, via a user input, job profiles for job postings to a social network. The system then determines whether each job profile is for a paid job posting to the social network or for an unpaid job posting to the social network. Unpaid job postings are presented to users of the social network only via a job search user interface; paid job postings are presented to users of the social network via the job search user interface and via other channels of the social network, such as e-mail. The presentation via other channels is based a comparison of user profiles to job profiles. The system also extracts job profiles for job postings to the social network, from at least one external website, and presents these job postings to users of the social network only via the job search user interface.

Abstract: A method can include receiving a request for content including an attribute for a school. The method can analyze a social graph to identify a first set of nodes representing members, which can connect to a first node representing a first school, the social graph can be represented by a graph data structure having nodes representing various entities and edges representing associations between entities. The method can analyze a social graph to identify a second set of nodes representing members, the second set of nodes representing members connecting to a second node representing a school. The method can generate a central tendency of a number of the first set of nodes representing members and a number of the second set of nodes representing members and using the central tendency and a number of the first set of nodes representing members, can determine an index number for the first school.

Abstract: Techniques for optimizing non-convex function for learning to rank are described. Consistent with some embodiments, a search module may set an order for a group of search features. The group of search features can be used by a ranking model to determine the relevance of items in a search query. Additionally, the search module can assign a first weight factor to a first search feature in the group of search features. Moreover, the search module can calculate a mean reciprocal rank for the search query based on the assigned first weight factor. Furthermore, the search module can determine a second weight factor, using a preset incremental vector, for a second search feature in the group of search features to maximize the mean reciprocal rank for the search query. Subsequently, the search module can assign the second weight factor to the second search feature in the group of search features.

Abstract: A system and method for interleaving primary and private messages includes establishing, with a processor, a primary conversation among a primary group of users, receiving a command from at least one of the users to establish a private group including some but not all of the users of the primary group, establishing, with the processor, the private conversation among the private group, and causing a user interface to display the private conversation only to the private group, the private conversation being interleaved on the user interface with the primary conversation.

Abstract: The disclosed embodiments provide a system for monitoring the performance of periodically scheduled workflows and associated jobs while they are executing a computing cluster. During operation, the system monitors the total execution time for the workflow. While monitoring the total execution time for the workflow, the system also monitors execution times for individual jobs in the set of jobs that comprise the workflow. The system also periodically determines an execution-time threshold for the workflow based on prior executions of the workflow. If the monitored execution time for the workflow exceeds the determined execution-time threshold for the workflow, the system sends an alert about the workflow to a user. The system also enables the user to examine the monitored execution time for the workflow and the monitored execution times for the associated jobs. This helps the user to determine a solution to a performance problem for the workflow.

Abstract: A method and system to suggest keywords to a social network member is described. A suggested keywords system, in one example embodiment, examines phrases that appear in profiles maintained by the on-line social networking system that are similar to the target profile and identifies those words and phrases that are most prominent in these profiles, utilizing a graph-based approach. These most prominent words and phrases may be presented to the target member as suggested keywords to be included in the member's professional summary.

Abstract: A system and method for virally growing a social network. The social network system receives a member account sign-up message for a first social network from a first member. The social network system then posts a member sign-up notification to the first member's event wall on a second social network; wherein the first member has one or more social contacts through the second social network. For at least a second respective member in the one or more social contacts, the social network system posts a personalized invitation message as a comment to the member sign-up notification on the first member's event wall, wherein the comment is initially hidden from all members other than the second respective member of the one or more member contacts.