Abstract: Described herein are enterprise search systems and methods that cluster search results that are associated with the same metadata or the same enterprise search site into one or more clustered results panels of a search results panel. The search results that are not included in the clustered results panel(s) are included in a non-clustered results panel of the search results panel.

Abstract: Described herein are enterprise search systems and methods that cluster search results that are associated with the same metadata or the same enterprise search site into one or more clustered results panels of a search results panel. The search results that are not included in the clustered results panel(s) are included in a non-clustered results panel of the search results panel.

Abstract: Generating and providing a content feed to a user that surfaces information items that are determined to be interesting or relevant to the user including content that is determined to be “distant” to the user is provided. Explicit user actions are used to discover peers who are not colleagues of the user (e.g., peers with whom the user does not share a close organizational relationship, peers with whom the user does not regularly communicate, etc.), but who the user indicates an interest in via his/her actions. These peers are categorized as elevated peers of the user, and information items associated with and trending around the elevated peers are surfaced to the user in a content feed.

Abstract: Generating and providing a content feed to a user that surfaces information items that are determined to be interesting or relevant to the user including content that is determined to be “distant” to the user is provided. Explicit user actions are used to discover peers who are not colleagues of the user (e.g., peers with whom the user does not share a close organizational relationship, peers with whom the user does not regularly communicate, etc.), but who the user indicates an interest in via his/her actions. These peers are categorized as elevated peers of the user, and information items associated with and trending around the elevated peers are surfaced to the user in a content feed.

Abstract: Variety of approaches to perform graph traversal utilizing a graph query language are described. A data service initiates operations to perform graph traversal upon receiving a graph query for processing a graph. The graph query includes a traversal operation. The graph query is executed for processing the graph with the traversal operation. Next, an outcome is identified from graph nodes of the graph as a result of the traversal operation. The outcome is provided for a presentation.

Abstract: Users are most likely to search for documents “around” them, such as documents which are created, read, or modified by other users they work closely or collaborate with, documents on sites the user frequents, and/or documents trending around them, in addition to documents they've created or interacted with themselves. Therefore, embodiments are directed to relevance ranking of query results based on external context. A search service may receive a query and an external context list, determine a relevance value for each entry in the external context list, and perform the query, where a search index comprising items may be returned in response to performance of the query. The search service may then match entries in the external context list against associated properties of the items, compute a score for the items based on the matching, and rank results of the query based on the score computed for the items.

Abstract: A computer-implemented method that monitors the activity of different nodes within a system as well as crowd sourcing activity. The computer-implemented method determines that a first node formed a relationship with a second node, generates an edge based on the relationship between the first node and the second node, stores the edge in a graph index and assigns a privacy setting to the edge based on the relationship between the first and second nodes.

Abstract: Systems, methods, and software are disclosed herein for implementing enterprise graph search. In at least one implementation, an enterprise search service receives a search request that includes a graph query directed to an enterprise graph. The graph is representative of various objects and actors associated with an enterprise, as well as which of the actors performed which of various actions with respect to each of the various objects. The service searches at least a portion of the enterprise graph to identify a subset of the objects that relate to the actors as defined by the graph query in terms of at least the actors and actions. A reply to the search request may include graph results indicative of the subset of the objects.

Abstract: Generating and providing a content feed to a user that surfaces information items that are determined to be interesting or relevant to the user including content that is determined to be “distant” to the user is provided. Explicit user actions are used to discover peers who are not colleagues of the user (e.g., peers with whom the user does not share a close organizational relationship, peers with whom the user does not regularly communicate, etc.), but who the user indicates an interest in via his/her actions. These peers are categorized as elevated peers of the user, and information items associated with and trending around the elevated peers are surfaced to the user in a content feed.

Abstract: Documents are ranked with topics within a graph. A user, a tag, and a document are placed as nodes in a graph. One or more relationships are established between the user, the tag, and the document. The nodes are connected with edges acting as the one or more relationships. The tag is promoted into a topic based on the one or more relationships.

Abstract: A computer-implemented method that monitors the activity of different nodes within a system as well as crowd sourcing activity. The computer-implemented method determines that a first node formed a relationship with a second node, generates an edge based on the relationship between the first node and the second node, stores the edge in a graph index and assigns a privacy setting to the edge based on the relationship between the first and second nodes.

Abstract: An information feed is provided that surfaces information items that are determined to be interesting or relevant to a user. The information feed may be updated with new information items each time the feed is accessed by the user. Information not surfaced to the user in the feed may be accessed by the user via one or more other means, but only those items having a sufficient importance to the user are surfaced in the feed. Items in the feed are sorted by order of importance or relevance to the user. When new items are added to the feed, they are sorted relative to each other, but are displayed separately from previous groupings of items added to the feed. Items may be reposted to different positions in the feed, and items may be manually removed from the feed if desired.

Abstract: An analysis application utilizes interactivity signals to generate relationships and promote content. One or more interactivity applications, such as a social networking application, are queried to retrieve interactivity signals. Interactivity signals include an interaction pattern that indicates a relationship between a user and relations of the user. A relationship graph is constructed based on the interactivity signals. Content associated with a user is promoted based on the relationship graph. A weight of the interactivity signals is adjusted to improve a ranking of the relationship graph and a ranking of the content.

Abstract: A graph query is executed against a graph index that connects actors with objects through edges. A graph ranking model is obtained and results of the graph query are ranked, using the graph ranking model, based upon edge data available from edges in the graph that match the query.

Abstract: Systems, methods, and software are disclosed herein for implementing enterprise graph search. In at least one implementation, an enterprise search service receives a search request that includes a graph query directed to an enterprise graph. The graph is representative of a various objects and actors associated with an enterprise, as well as which of the actors performed which of various actions with respect to each of the. The service searches at least a portion of the enterprise graph to identify a subset of the objects that relate to the actors as defined by the graph query in terms of at least the actors and actions. A reply to the search request may include graph results indicative of the subset of the objects.