Patents by Inventor Harsh Shrivastava
Harsh Shrivastava 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).
-
Publication number: 20240320479Abstract: This disclosure relates to a time series segmentation system that automatically segments multivariate time series data. For example, the time series segmentation system is capable of converting complex and noisy multivariate time series data into segmented multivariate time series by identifying distinct segments within the data. The time series segmentation system operates with linear time complexity in terms of sequence length, which is significantly more efficient than the typical quadratic time complexity required by conventional systems. To illustrate, the time series segmentation system first divides a multivariate time series into portions using time-based windows. The time series segmentation system then converts the windowed subsequences into graph objects using a sparse graph recovery model and utilizes a similarity model to determine segmentation timestamps from the graph objects.Type: ApplicationFiled: March 20, 2023Publication date: September 26, 2024Inventors: Shima IMANI, Harsh SHRIVASTAVA
-
Publication number: 20240296351Abstract: The present disclosure relates to propagating knowledge between nodes of a feature graph in inferring or otherwise predicting attribute values for various features represented within the feature graph. This enables analysis of the feature graph beyond direct dependencies and for domain spaces that are increasingly complex. The present disclosure includes generating a transition matrix based on correlations within the feature graph to determine distribution of weights to apply to an attribute matrix including a combination of known and unknown attribute values. Features described herein provide a computationally inexpensive and flexible approach to evaluating graphs of complex domains while considering combinations of features that are not necessarily directly correlated to other features.Type: ApplicationFiled: June 1, 2023Publication date: September 5, 2024Inventors: Urszula Stefania CHAJEWSKA, Harsh SHRIVASTAVA
-
Publication number: 20240296294Abstract: Disclosed are techniques for an AI system with a large language mode (LLM) with improved accuracy and reliability in solving mathematical problems. An initial query is transformed into a template query by replacing the original input values with variables. Multiple prompts are sent to the LLM, each being different from one another, and contextually related to the template query. Multiple results are responsively received from the LLM, each result including an analytical expression to solve the mathematical problem. Each of the expressions is evaluated using a numerical evaluation tool with variables of the expression being assigned a common set of randomly sampled values. A consensus is achieved when the evaluated expressions satisfy a consensus condition, such as when all outputs match consistently over N experiments or trials. After the consensus condition is reached, the original inputs are evaluated with one or more of the expressions, and the solution is output.Type: ApplicationFiled: May 8, 2023Publication date: September 5, 2024Inventors: Shima IMANI, Harsh SHRIVASTAVA, Liang DU
-
Publication number: 20240281643Abstract: The present disclosure relates to recovering a sparse feature graph based on input data having a collection of samples and associated features. In particular, the systems described herein utilize a fully connected neural network to learn a regression of the input data and determine direct connections between features of the input data while the neural network satisfies one or more sparsity constraints. This regression may be used to recover a feature graph indicating direct connections between the features of the input data. In addition, the feature graph may be presented via an interactive presentation that enables a user to navigate nodes and edges of the graph to gain insights of the input data and associated features.Type: ApplicationFiled: May 8, 2023Publication date: August 22, 2024Inventors: Harsh SHRIVASTAVA, Urszula Stefania CHAJEWSKA
-
Publication number: 20240193440Abstract: The present disclosure relates to utilizing a dynamic knowledge graph enrichment system to dynamically and automatically maintain knowledge graphs shared between groups of user identifiers with up-to-date findings and discoveries. In particular, the dynamic knowledge graph enrichment system changes static shared knowledge graphs into dynamically evolving ones utilizing statistical guarantees that automatically incorporate new edge connections into a shared knowledge graph after verifying the reliability and veracity of the proposed edge connections being offered. Further, the dynamic knowledge graph enrichment system facilitates forming new connections between different shared knowledge graphs that previously went undetected by flexibly facilitating exploration over multiple knowledge graphs and providing synergistic knowledge graph updates.Type: ApplicationFiled: December 12, 2022Publication date: June 13, 2024Inventors: Harsh SHRIVASTAVA, Sarah PANDA, Liang DU
-
Publication number: 20240193911Abstract: The present disclosure relates to utilizing a style-matching image generation system to generate large datasets of style-matching images having matching styles and content to an initial small sample set of input images. For example, the style-matching image generation system utilizes a selection of style-mixed stored images with a generative machine-learning model to produce large datasets of synthesized images. Further, the style-matching image generation system utilizes the generative machine-learning model to conditionally sample synthesized images that accurately match the style, content, characteristics, and patterns of the initial small sample set and that also provide added variety and diversity to the large image dataset.Type: ApplicationFiled: December 12, 2022Publication date: June 13, 2024Inventors: Maurice DIESENDRUCK, Harsh SHRIVASTAVA
-
Publication number: 20240111988Abstract: The present disclosure relates to methods and systems for providing a neural graphical model. The methods and systems generate a neural view of the neural graphical model for a domain. The input data is generated from the domain and includes generic input data. The input data also includes a combination of different data types of input data. The neural view of the neural graphical model represents the functions of the different features of the domain using a neural network. The functions are learned for the features of the domain using a dependency structure of an input graph for the input data and the neural network. The methods and systems use the neural graphical model to perform inference tasks. The methods and systems also use the neural graphical model to perform sampling tasks.Type: ApplicationFiled: September 21, 2022Publication date: April 4, 2024Inventors: Harsh SHRIVASTAVA, Urszula Stefania CHAJEWSKA
-
Publication number: 20240112000Abstract: The present disclosure relates to methods and systems for providing a neural graphical model. The methods and systems generate a neural view of the neural graphical model for input data. The neural view of the neural graphical model represents the functions of the different features of the domain using a neural network. The functions are learned for the features of the domain using a dependency structure of an input graph for the input data using neural network training for the neural view. The methods and systems use the neural graphical model to perform inference tasks. The methods and systems also use the neural graphical model to perform sampling tasks.Type: ApplicationFiled: September 21, 2022Publication date: April 4, 2024Inventors: Harsh SHRIVASTAVA, Urszula Stefania CHAJEWSKA
-
Publication number: 20240005181Abstract: The present disclosure relates to systems, methods, and computer-readable media for utilizing a network graph exploration system to facilitate improved exploration of network graphs via inferencing and improved visualization. For example, the network graph exploration system utilizes inferencing to accurately facilitate question and answer explorations, impute missing data in data sets, and perform accurate evaluations. Additionally, in various implementations, the network graph exploration system compresses large, busy, complex, and unreadable network graphs into smaller structures that offer better readability while preserving the primary properties and structure of the domain of a network graph.Type: ApplicationFiled: June 29, 2022Publication date: January 4, 2024Inventors: Urszula Stefania CHAJEWSKA, Harsh SHRIVASTAVA
-
Publication number: 20230418845Abstract: The interpretation of a graph data structure represented on a computing system in which the connection between a pair of nodes in the graph may be interpreted by which intermediary entity (node or edge) on a path (e.g., a shortest path) between the node pair is most dominant. That is, if the intermediary entity were not present, a detour path is determined. The greater the difference between the detour path and the original path, the more significant that intermediary entity is. The significance of multiple intermediary entities in the original path may be determined in this way.Type: ApplicationFiled: September 11, 2023Publication date: December 28, 2023Inventors: Leo Moreno BETTHAUSER, Maurice DIESENDRUCK, Harsh SHRIVASTAVA
-
Publication number: 20230394221Abstract: The present disclosure relates to methods and systems for converting Portable Document Format (PDF) documents to LaTeX files. The methods and systems use machine learning models to identify and extract PDF portions of a PDF document. The methods and systems create a LaTeX file for the PDF document using the PDF portions extracted by the machine learning models. The methods and systems provide an output with the LaTeX file for the PDF document. The LaTeX file is used to perform different actions on the PDF document.Type: ApplicationFiled: June 6, 2022Publication date: December 7, 2023Inventors: Harsh SHRIVASTAVA, Sarah PANDA, Liang DU, Robin ABRAHAM
-
Publication number: 20230394239Abstract: The present disclosure relates to systems, methods, and computer-readable media for utilizing a concept graphing system to determine and provide relationships between concepts within document collections or corpora. For example, the concept graphing system can generate and utilize machine-learning models, such as a sparse graph recovery machine-learning model, to identify less-obvious correlations between concepts, including positive and negative concept connections, as well as provide these connections within a visual concept graph. Additionally, the concept graphing system can provide a visual concept graph that determines and displays concept correlations based on the input of a single concept, multiple concepts, or no concepts.Type: ApplicationFiled: June 6, 2022Publication date: December 7, 2023Inventors: Harsh SHRIVASTAVA, Maurice DIESENDRUCK, Robin ABRAHAM
-
Publication number: 20230394722Abstract: The present disclosure relates to systems, methods, and computer-readable media for utilizing an interactive graphing system to achieve improved dataset exploration utilizing an intelligent workflow and an interactive user interface. More specifically, the interactive graphing system facilitates generating updated network graphs that include inferred user influences based on implicit user action. Indeed, the interactive graphing system can automatically generate and present a user with an updated network graph that includes added, removed, or subsetted elements and relationships that are otherwise hidden from a user. Additionally, the interactive graphing system facilitates network graph exploration and processing of customized combined network graphs that join otherwise separate network graphs.Type: ApplicationFiled: June 6, 2022Publication date: December 7, 2023Inventors: Harsh SHRIVASTAVA, Maurice DIESENDRUCK, Robin ABRAHAM
-
Publication number: 20230342629Abstract: The present disclosure relates to methods and systems for exploring textual data. The methods and systems identify entities and the relations among the entities within the text of an initial data source and generate knowledge graphs on-the-fly for the identified entities and the relations. The methods and systems apply one or more functions on the nodes of an initial knowledge graph and extend the initial knowledge graph in response to the one or more functions applied. The methods and systems use a different data source to generate a second knowledge graph for the extended initial knowledge graph. The methods and systems generate a merged knowledge graph with the initial knowledge graph and the second knowledge graph.Type: ApplicationFiled: April 26, 2022Publication date: October 26, 2023Inventors: Sarah PANDA, Harsh SHRIVASTAVA
-
Patent number: 11797580Abstract: The interpretation of a graph data structure represented on a computing system in which the connection between a pair of nodes in the graph may be interpreted by which intermediary entity (node or edge) on a path (e.g., a shortest path) between the node pair is most dominant. That is, if the intermediary entity were not present, a detour path is determined. The greater the difference between the detour path and the original path, the more significant that intermediary entity is. The significance of multiple intermediary entities in the original path may be determined in this way.Type: GrantFiled: December 20, 2021Date of Patent: October 24, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Leo Moreno Betthauser, Maurice Diesendruck, Harsh Shrivastava
-
Publication number: 20230195758Abstract: The interpretation of a graph data structure represented on a computing system in which the connection between a pair of nodes in the graph may be interpreted by which intermediary entity (node or edge) on a path (e.g., a shortest path) between the node pair is most dominant. That is, if the intermediary entity were not present, a detour path is determined. The greater the difference between the detour path and the original path, the more significant that intermediary entity is. The significance of multiple intermediary entities in the original path may be determined in this way.Type: ApplicationFiled: December 20, 2021Publication date: June 22, 2023Inventors: Leo Moreno BETTHAUSER, Maurice DIESENDRUCK, Harsh SHRIVASTAVA
-
Patent number: 11087879Abstract: According to embodiments illustrated herein, there is provided a system for predicting a health condition of a patient. The system further includes one or more processors configured to separately cluster data points from a set of medical records associated with a first class of patients and a second class of patients. A similarity value of each of the clustered data points with respect to a pre-selected subset of data points that represents landmark points may be determined, using a parameterized similarity measure. One or more classifiers are trained using the determined similarity value of each data point. The trained one or more classifiers are adapted to learn one or more parameters of the parameterized similarity measure during the training. An occurrence of the health condition of the patient may be predicted based on the trained one or more classifiers and one or more medical records of the patient.Type: GrantFiled: August 22, 2016Date of Patent: August 10, 2021Assignee: Conduent Business Services, LLCInventors: Harsh Shrivastava, Vijay Huddar, Sakyajit Bhattacharya, Vaibhav Rajan
-
Patent number: 10463312Abstract: Disclosed are embodiments of methods and systems for predicting mortality of a first patient. The method comprises categorizing a historical data into a first category and a second category. The method further comprises determining a first test parameter and a second test parameter based on at least one of a sample data of a first patient and the historical data corresponding to at least one of the first category and the second category. The method further comprises determining a probability score based on a cumulative distribution of at least one of the first test parameter and the second test parameter. The method further comprises categorizing the sample data in one of the first category and the second category based on the probability score. Further, the method comprises predicting the mortality of the first patient based on at least the categorization of the sample data of the first patient.Type: GrantFiled: September 1, 2015Date of Patent: November 5, 2019Assignee: CONDUENT BUSINESS SERVICES, LLCInventors: Sakyajit Bhattacharya, Vaibhav Rajan, Harsh Shrivastava
-
Publication number: 20180052961Abstract: According to embodiments illustrated herein, there is provided a system for predicting a health condition of a patient. The system further includes one or more processors configured to separately cluster data points from a set of medical records associated with a first class of patients and a second class of patients. A similarity value of each of the clustered data points with respect to a pre-selected subset of data points that represents landmark points may be determined, using a parameterized similarity measure. One or more classifiers are trained using the determined similarity value of each data point. The trained one or more classifiers are adapted to learn one or more parameters of the parameterized similarity measure during the training. An occurrence of the health condition of the patient may be predicted based on the trained one or more classifiers and one or more medical records of the patient.Type: ApplicationFiled: August 22, 2016Publication date: February 22, 2018Inventors: Harsh Shrivastava, Vijay Huddar, Sakyajit Bhattacharya, Vaibhav Rajan
-
Publication number: 20170055916Abstract: Disclosed are embodiments of methods and systems for predicting mortality of a first patient. The method comprises categorizing a historical data into a first category and a second category. The method further comprises determining a first test parameter and a second test parameter based on at least one of a sample data of a first patient and the historical data corresponding to at least one of the first category and the second category. The method further comprises determining a probability score based on a cumulative distribution of at least one of the first test parameter and the second test parameter. The method further comprises categorizing the sample data in one of the first category and the second category based on the probability score. Further, the method comprises predicting the mortality of the first patient based on at least the categorization of the sample data of the first patient.Type: ApplicationFiled: September 1, 2015Publication date: March 2, 2017Inventors: Sakyajit Bhattacharya, Vaibhav Rajan, Harsh Shrivastava