Microsoft Technology Licensing, LLC

Hypertag Limited

John Michael Winn

Dmitriy Meyerzon

John Guiver

Matteo Venanzi

Alexander Armin Spengler

Ivan Korostelev

Antonio Criminisi

Nikita Voronkov

Vladimir V Gvozdev

Jamie Daniel Joseph Shotton

Pushmeet Kohli

James Edelen

Pavel Myshkov

Yordan Kirilov Zaykov

Elena Pochernina

Carsten Rother

Jamie Shotton

Thomas Minka

Tore L Sundelin

Toby Leonard Sharp

Omar Zia Khan

Reinhard Sebastian Bernhard Nowozin

Hui Li

Samuel Alexander Webster

Jeffrey L Wight

Fernando Garcia

Nicolas Le Roux

Martin Kukla

Shahram Izadi

Jan-Ove Almli Karlberg

Andrew Donald Gordon

Åge Andre Kvalnes

Otmar Hilliges

Anitha Kannan

Jorge Pereira

David G Molyneaux

Helge Grenager Solheim

James Charles Kleewein

Thore Graepel

Filip Andrzej Radlinski

Alexander Wetmore

Christopher Michael Bishop

Daniel Stefan Tarlow

Lucas Bordeaux

Anthony Arnold Wieser

Andrei-Alin Corodescu

Junyi Chai

Ankur Agarwal

Yoram Bachrach

Simon Thoresen Hult

Chia-Jiun Tan

Marius Bunescu

Thuy Thanh Duong

Omar Faruk

Andrei Razvan Popov

Mat Cook

Noura Farra

Seyed Mohammadali Eslami

Nicolas Manfred Otto Heess

Thomas Deselaers

Sravya Narala

David J Spiegelhalter

Hadi Abbass Kotaich

Sanil Rajput

In various examples there is a computer-implemented method of database construction. The method comprises storing a knowledge graph comprising nodes connected by edges, each node representing a topic. Accessing a topic type hierarchy comprising a plurality of types of topics, the topic type hierarchy having been computed from a corpus of text documents. One or more text documents are accessed and the method involves labelling a plurality of the nodes with one or more labels, each label denoting a topic type from the topic type hierarchy, by, using a deep language model; or for an individual one of the nodes representing a given topic, searching the accessed text documents for matches to at least one template, the template being a sequence of words and containing the given topic and a placeholder for a topic type; and storing the knowledge graph comprising the plurality of labelled nodes.

Knowledge base with type discovery

Examples of the present disclosure describe systems and methods for cross-provider topic conflation. In aspects, a request relating to one or more topics may be received by a content surfacing platform. One or more data sources of multiple content providers may be searched for documents relating to the topic(s). Document content (e.g., document metadata and sentences, phrases, and other word content within the document) relating to the topic(s) may be extracted from the documents of the various content providers. The document content may be classified and/or separated into subparts. The subparts may be clustered and/or conflated by topic, thereby removing duplicated data while preserving the unique information in each subpart. The conflated topics may be stored in a single knowledge base, such as an enterprise knowledge graph, and/or presented in response to the request.

Cross-provider topic conflation

Examples described herein generally relate to a computer system for generating a knowledge graph storing a plurality of entities and to displaying a topic page for an entity in the knowledge graph. The computer system performs a mining of source documents within an enterprise intranet to determine a plurality of entity names. The computer system generates an entity record within the knowledge graph for a mined entity name based on an entity schema and the source documents. The entity record includes attributes aggregated from the source documents. The computer system receives a curation action on the entity record from a first user. The computer system updates the entity record based on the curation action. The computer system displays an entity page including at least a portion of the attributes to a second user based on permissions of the second user to view the source documents.

Enterprise knowledge graph

Examples described herein generally relate to a computer system including a knowledge graph storing a plurality of entities. A mining of a set of enterprise source documents within an enterprise intranet is performed, by a plurality of knowledge mining toolkits, to determine a plurality of entity names. The plurality of entity names are linked based on entity metadata by traversing various relationships between people, files, sites, groups, associated with entities. An entity record is generated within a knowledge graph for a mined entity name from the linked entity names based on an entity schema and ones of the set of enterprise source documents associated with the mined entity name. The entity record includes attributes aggregated from the ones of the set of enterprise source documents associated with the mined entity name.

Enterprise knowledge graphs using multiple toolkits

Mining of a set of enterprise source documents within an enterprise intranet is performed, by a plurality of knowledge mining toolkits, to determine a plurality of entity names. A plurality of entity records are generated within a knowledge graph for mined entity names from the entity names based on an entity schema and ones of the set of enterprise source documents associated with the mined entity names. Pattern recognition is applied to an active document using an enterprise named entity recognition (ENER) system to identify potential entity names within the document that match a respective one of a plurality of entity records in the knowledge graph. One or more matching entity names are annotated within the document with information from the knowledge graph for the respective ones of the plurality of entity records. The annotated information is displayed with the active document.

Annotations for enterprise knowledge graphs using multiple toolkits

Examples described herein generally relate to a computer system including a knowledge graph storing a plurality of entities. The computer system generates an Aho Corasick trie including an entity name for each of the plurality of entities in the knowledge graph. The computer system compares a document viewed by a user to a plurality of templates defining potential entity names to identify extracts of the document matching at least one of the plurality of templates. The computer system applies the document to the Aho Corasick trie to determine potential entity names within the document that each match a respective one of the plurality of entities in the knowledge graph. The computer system annotates one or more matching entity names within the document with information from the knowledge graph for the respective ones of the plurality of entities to show, for example, a topic card providing information about the respective entities.

Document annotation based on enterprise knowledge graph

Examples described herein generally relate to a computer system including a knowledge graph storing a plurality of entities. The computer system compares source documents within an enterprise intranet to a plurality of templates defining potential entity attributes to identify extracts matching at least one of the plurality of templates. The computer system parses the extracts according to respective templates of the plurality of templates that match the extracts to determine instances. The computer system performs incremental clustering on a number of the instances to determine potential entity names. The computer system queries the knowledge graph with the potential entity names to obtain a set of candidate entity records. The computer system links the potential entity names with at least partial matching ones of the set of candidate entity records to define updated matching candidate entity records. The computer system updates the knowledge graph with the updated matching candidate entity records.

Incremental clustering for enterprise knowledge graph

Checking and/or completing for data grids is described such as for grids having rows and columns of cells at least some of which contain data values such as numbers or categories. In various embodiments predictive probability distributions are obtained from an inference engine for one or more of the cells and the predictive probability distributions are used for various tasks such as to suggest values to complete blank cells, highlight cells having outlying values, identify potential errors, suggest corrections to potential errors, identify similarities between cells, identify differences between cells, cluster rows of the data grid, and other tasks. In various embodiments a graphical user interface displays a data grid and provides facilities for completing, error checking/correcting, and analyzing data in the data grid.

Checking and/or completion for data grids

Memory facilitation using directed acyclic graphs is described, for example, where a plurality of directed acyclic graphs are trained for gesture recognition from human skeletal data, or to estimate human body joint positions from depth images for gesture detection. In various examples directed acyclic graphs are grown during training using a training objective which takes into account both connection patterns between nodes and split function parameter values. For example, a layer of child nodes is grown and connected to a parent layer of nodes using an initialization strategy. In examples, various local search processes are used to find good combinations of connection patterns and split function parameters.

Memory facilitation using directed acyclic graphs

An inference engine is described for efficient machine learning. For example, an inference engine executes a plurality of ordered steps to carry out inference on the basis of observed data. For each step, a plurality of inputs to the step are received. A predictor predicts an output of the step and computes uncertainty of the prediction. Either the predicted output or a known output is selected on the basis of the uncertainty. If the known output is selected, the known output is computed, (for example, using a resource intensive, accurate process). The predictor is retrained using the known output and the plurality of inputs of the step as training data. For example, computing the prediction is fast and efficient as compared with computing the known output.

Interface engine for efficient machine learning

Technologies are generally provided far a hierarchical, feature teed statistical model that cm be used for personalized classification or predictions within a community of users. Personalization refers to learning about the habits and characteristics of individual users and adapting user experiences based on that learning. The model may be used in a communication application to predict user actions on incoming email messages and to help users triage email by making personalized suggestions based on the model predictions. A community of users associated together with the communication application may be incorporated together into a single model to enable for continuous fine-grain interaction between intelligence learned from the community of users as a whole and that learned from individual users. The single model may allow a seamless progression between predictions for a completely new user based on community observations and highly personalized predictions for a long-term user based on individual observations.

Hierarchical statistical model for behavior prediction and classification

Probabilistic parsing is described for calculating information about the structure of text and other ordered sequences of items to enable downstream systems such as machine translation systems, information retrieval systems, document classification systems and others to use the structure information. In various embodiments, a parsing inference component comprises inference algorithm(s) compiled from a probabilistic program which defines a stochastic process for generating text or other ordered sequences of items. In examples, the parsing inference component receives one or more observations or examples of text that are compatible with the stochastic process defined by the probabilistic program. The parsing inference component may apply the inference algorithms to the text to update one or more probability distributions over strings or other values relevant to the parse. In some examples, the parsing inference component uses the inference results to complete partial examples to assist a user with information retrieval tasks.

Probabilistic parsing

A system is provided for automatically predicting actions a user is likely to take in response to receiving data. The system may be configured to monitor and observe a user's interactions with incoming data and to identify patterns of actions the user may take in response to the incoming data. The system may enable a trainer component and a classifier component to determine the probability a user may take a particular action and to make predictions of likely user actions based on the observations of the user and the identified pattern of the user's actions. The system may also be configured to continuously observe the user's actions to fine-tune and adjust the identified patterns of user actions and to update the probabilities of likely user actions in order increase the accuracy of the predicted user action in response to incoming data.

Prediction of user response actions to received data

Systems and methods for editing digital images using information about objects in those images are described. For example, the information about objects comprises depth ordering information and/or information about the class each object is a member of. Examples of classes include sky, building, aeroplane, grass and person. This object-level information is used to provide new and/or improved editing functions such as cut and paste, filling-in image regions using tiles or patchworks, digital tapestry, alpha matte generation, super resolution, auto cropping, auto color balance, object selection, depth of field manipulation, and object replacement. In addition improvements to user interfaces for image editing systems are described which use object-level information.

Object-level image editing

Growing community of inventors

Cambridge, United Kingdom

John Michael Winn