Patents by Inventor John Michael Winn
John Michael Winn has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11709878Abstract: 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.Type: GrantFiled: October 14, 2019Date of Patent: July 25, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Dmitriy Meyerzon, Jeffrey Wight, Andrei Razvan Popov, Andrei-Alin Corodescu, Omar Faruk, Jan-Ove Karlberg, Åge Andre Kvalnes, Helge Grenager Solheim, Thuy Duong, Simon Thoresen Hult, Ivan Korostelev, Matteo Venanzi, John Guiver, John Michael Winn, Vladimir V. Gvozdev, Nikita Voronkov, Chia-Jiun Tan, Alexander Armin Spengler
-
Patent number: 11216492Abstract: 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.Type: GrantFiled: January 6, 2020Date of Patent: January 4, 2022Assignee: Microsoft Technology Licensing, LLCInventors: Dmitriy Meyerzon, Nikita Voronkov, John Michael Winn, John Guiver, Hadi Abbass Kotaich
-
Patent number: 11194840Abstract: 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.Type: GrantFiled: October 14, 2019Date of Patent: December 7, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Dmitriy Meyerzon, Jeffrey L. Wight, Nikita Voronkov, Vladimir V. Gvozdev, John Michael Winn, John Guiver, Ivan Korostelev, Matteo Venanzi, Alexander Armin Spengler
-
Publication number: 20210133216Abstract: 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.Type: ApplicationFiled: January 6, 2020Publication date: May 6, 2021Inventors: Dmitriy MEYERZON, Nikita VORONKOV, John Michael WINN, John GUIVER, Hadi Abbass KOTAICH
-
Publication number: 20210110278Abstract: 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.Type: ApplicationFiled: October 14, 2019Publication date: April 15, 2021Inventors: Dmitriy MEYERZON, Jeffrey WIGHT, Andrei Razvan POPOV, Andrei-Alin CORODESCU, Omar FARUK, Jan-Ove KARLBERG, Åge Andre KVALNES, Helge Grenager SOLHEIM, Thuy DUONG, Simon Thoresen HULT, Ivan KOROSTELEV, Matteo VENANZI, John GUIVER, John Michael WINN, Vladimir V. GVOZDEV, Nikita VORONKOV, Chia-Jiun TAN, Alexander Armin SPENGLER
-
Publication number: 20210109952Abstract: 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.Type: ApplicationFiled: October 14, 2019Publication date: April 15, 2021Inventors: Dmitriy MEYERZON, Jeffrey L. Wight, Nikita Voronkov, Vladimir V. Gvozdev, John Michael Winn, John Guiver, Ivan Korostelev, Matteo Venanzi, Alexander Armin Spengler
-
Patent number: 10832163Abstract: 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.Type: GrantFiled: October 28, 2016Date of Patent: November 10, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Jamie Daniel Joseph Shotton, Toby Sharp, Pushmeet Kohli, Reinhard Sebastian Bernhard Nowozin, John Michael Winn, Antonio Criminisi
-
Publication number: 20190213484Abstract: In various examples there is a knowledge base construction and/or maintenance system for use with a probabilistic knowledge base. The system has a probabilistic generative model comprising a process for generating text or other formatted data from the knowledge base. The system has an inference component configured to generate inference results, by carrying out inference using inference algorithms, run on the probabilistic generative model, in either a forward direction whereby text or other formatted data is generated, or a reverse direction whereby text or other formatted data is observed and at least one unobserved variable of the probabilistic generative model is inferred. The inference component is configured to update the knowledge base using at least some of the inference results.Type: ApplicationFiled: February 15, 2018Publication date: July 11, 2019Inventors: John Michael WINN, John GUIVER, Samuel Alexander WEBSTER, Yordan Kirilov ZAYKOV, Maciej KUKLA, Daniel FABIAN
-
Publication number: 20170147947Abstract: 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.Type: ApplicationFiled: October 28, 2016Publication date: May 25, 2017Inventors: Jamie Daniel Joseph Shotton, Toby Sharp, Pushmeet Kohli, Reinhard Sebastian Bernhard Nowozin, John Michael Winn, Antonio Criminisi
-
Patent number: 9489639Abstract: 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.Type: GrantFiled: November 13, 2013Date of Patent: November 8, 2016Assignee: Microsoft Technology Licensing, LLCInventors: Jamie Daniel Joseph Shotton, Toby Sharp, Pushmeet Kohli, Reinhard Sebastian Bernhard Nowozin, John Michael Winn, Antonio Criminisi
-
Patent number: 9251467Abstract: 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.Type: GrantFiled: March 3, 2013Date of Patent: February 2, 2016Assignee: Microsoft Technology Licensing, LLCInventors: John Michael Winn, Thomas Minka
-
Publication number: 20150134576Abstract: 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.Type: ApplicationFiled: November 13, 2013Publication date: May 14, 2015Applicant: Microsoft CorporationInventors: Jamie Daniel Joseph Shotton, Toby Sharp, Pushmeet Kohli, Reinhard Sebastian Bernhard Nowozin, John Michael Winn, Antonio Criminisi
-
Publication number: 20140250046Abstract: 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.Type: ApplicationFiled: March 3, 2013Publication date: September 4, 2014Applicant: Microsoft CorporationInventors: John Michael Winn, Thomas Minka
-
Patent number: 7233801Abstract: A beacon is placed at a specific location, such as a bus stop and has a local communicator which transmits a code to a mobile telephone. The code identifies a predetermined item of information stored on a remote server, such as a bus timetable document. This information is retrieved by the mobile telephone using its network communicator. The mobile telephone then transmits a copy of the information to the beacon which stores it in its cache and also displays the document to its user. A PDA, which lacks a network communicator, is then able to retrieve the cached information directly from the beacon using only its local communicator. The PDA then displays the bus timetable document to its user.Type: GrantFiled: September 22, 2004Date of Patent: June 19, 2007Assignee: Hypertag LimitedInventor: John Michael Winn