Patents by Inventor Shirish Kumar
Shirish Kumar 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: 20260111677Abstract: A system and method utilizes masked language models in order to provide data-type detection, such as (but not limited to) prediction of columnar headings. Two masked language models are pre-trained on example columnar text. One model predicts missing data at the entity level (e.g., masked entity names that may be made up of whole words), while the other predicts missing data at the character level (e.g., masked individual characters). The table with missing column headings is fed into both models, and the output is contextual word embeddings and contextual character embeddings. These results are merged, and then fed into a neural network classifier to then predict the column names.Type: ApplicationFiled: October 2, 2023Publication date: April 23, 2026Inventors: Jaipal Nenavath, Jayakumar Reddy Attur, Putty Vikas, Shirish Kumar
-
Publication number: 20260030279Abstract: This disclosure relates to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data at a massive scale. Incoming data is received and extracted for identifying information (“information”). Multiple dimensionality reducing functions are applied to the information, and based on the function results, the information are grouped into sets of similar information. Filtering rules are applied to the sets to exclude non-matching information in the sets. The sets are then merged into groups of information based on whether the sets contain at least one common information. A common link may be associated with information in a group. If the incoming data includes the identifying information associated with to the common link, the incoming data is assigned the common link. In some embodiments, incoming data are not altered but assigned into domains.Type: ApplicationFiled: July 7, 2025Publication date: January 29, 2026Inventors: Anukool Rege, Prashant Kumar Sahay, Mervyn Lally, Shirish Kumar, Sanskar Sahay
-
Patent number: 12386875Abstract: This disclosure relates to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data at a massive scale. Incoming data is received and extracted for identifying information (“information”). Multiple dimensionality reducing functions are applied to the information, and based on the function results, the information are grouped into sets of similar information. Filtering rules are applied to the sets to exclude non-matching information in the sets. The sets are then merged into groups of information based on whether the sets contain at least one common information. A common link may be associated with information in a group. If the incoming data includes the identifying information associated with to the common link, the incoming data is assigned the common link. In some embodiments, incoming data are not altered but assigned into domains.Type: GrantFiled: May 2, 2023Date of Patent: August 12, 2025Assignee: Experian Information Solutions, Inc.Inventors: Anukool Rege, Prashant Kumar Sahay, Mervyn Lally, Shirish Kumar, Sanskar Sahay
-
Patent number: 12197438Abstract: A computerized method for implementing a matching platform for entities includes a real-time processing layer using real-time linking on an input data stream, and a high-throughput layer linking entities from a batch data source stream. The real-time linking results are stored in a state change store and the high-throughput linking results are stored in a state store. On-demand linking uses the state change store and the state store. A lambda switch ensures that the entity states remain consistent when the on-demand linking switches from an older generation of the state store and the stage change store to a newer generation of the state store and the state change store. These stores are implemented in an entity database that parses queries into instructions and creates an instruction stream to control entity matching.Type: GrantFiled: December 29, 2021Date of Patent: January 14, 2025Assignee: LiveRamp, Inc.Inventor: Shirish Kumar
-
Publication number: 20240061873Abstract: This disclosure relates to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data at a massive scale. Incoming data is received and extracted for identifying information (“information”). Multiple dimensionality reducing functions are applied to the information, and based on the function results, the information are grouped into sets of similar information. Filtering rules are applied to the sets to exclude non-matching information in the sets. The sets are then merged into groups of information based on whether the sets contain at least one common information. A common link may be associated with information in a group. If the incoming data includes the identifying information associated with to the common link, the incoming data is assigned the common link. In some embodiments, incoming data are not altered but assigned into domains.Type: ApplicationFiled: May 2, 2023Publication date: February 22, 2024Inventors: Anukool Rege, Prashant Kumar Sahay, Mervyn Lally, Shirish Kumar, Sanskar Sahay
-
Publication number: 20240045864Abstract: A computerized method for implementing a matching platform for entities includes a real-time processing layer using real-time linking on an input data stream, and a high-throughput layer linking entities from a batch data source stream. The real-time linking results are stored in a state change store and the high-throughput linking results are stored in a state store. On-demand linking uses the state change store and the state store. A lambda switch ensures that the entity states remain consistent when the on-demand linking switches from an older generation of the state store and the stage change store to a newer generation of the state store and the state change store. These stores are implemented in an entity database that parses queries into instructions and creates an instruction stream to control entity matching.Type: ApplicationFiled: December 29, 2021Publication date: February 8, 2024Inventor: Shirish Kumar
-
Patent number: 11829379Abstract: In one aspect, a computerized method for implementing a matching platform for entities includes the step of, in a real-time data processing layer, implementing a real-time linking on an input event stream. The method includes storing an output of the real-time linking in a state change store. The method includes the step of, in a high-throughput layer, implementing a high-throughput linking of entities from a batch data source stream. The method includes storing an output of the high-throughput linking of entities in a state store to generate a unified and consistent view of the entities across a different representation of the entities. The method includes implementing an on-demand linking using the state change store and the state store.Type: GrantFiled: May 13, 2021Date of Patent: November 28, 2023Assignee: LiveRamp, Inc.Inventor: Shirish Kumar
-
Patent number: 11681733Abstract: This disclosure relates to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data at a massive scale. Incoming data is received and extracted for identifying information (“information”). Multiple dimensionality reducing functions are applied to the information, and based on the function results, the information are grouped into sets of similar information. Filtering rules are applied to the sets to exclude non-matching information in the sets. The sets are then merged into groups of information based on whether the sets contain at least one common information. A common link may be associated with information in a group. If the incoming data includes the identifying information associated with to the common link, the incoming data is assigned the common link. In some embodiments, incoming data are not altered but assigned into domains.Type: GrantFiled: December 6, 2021Date of Patent: June 20, 2023Assignee: Experian Information Solutions, Inc.Inventors: Anukool Rege, Prashant Kumar Sahay, Mervyn Lally, Shirish Kumar, Sanskar Sahay
-
Publication number: 20220138238Abstract: This disclosure relates to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data at a massive scale. Incoming data is received and extracted for identifying information (“information”). Multiple dimensionality reducing functions are applied to the information, and based on the function results, the information are grouped into sets of similar information. Filtering rules are applied to the sets to exclude non-matching information in the sets. The sets are then merged into groups of information based on whether the sets contain at least one common information. A common link may be associated with information in a group. If the incoming data includes the identifying information associated with to the common link, the incoming data is assigned the common link. In some embodiments, incoming data are not altered but assigned into domains.Type: ApplicationFiled: December 6, 2021Publication date: May 5, 2022Inventors: Anukool Rege, Prashant Kumar Sahay, Mervyn Lally, Shirish Kumar, Sanskar Sahay
-
Patent number: 11227001Abstract: This disclosure relates to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data at a massive scale. Incoming data is received and extracted for identifying information (“information”). Multiple dimensionality reducing functions are applied to the information, and based on the function results, the information are grouped into sets of similar information. Filtering rules are applied to the sets to exclude non-matching information in the sets. The sets are then merged into groups of information based on whether the sets contain at least one common information. A common link may be associated with information in a group. If the incoming data includes the identifying information associated with to the common link, the incoming data is assigned the common link. In some embodiments, incoming data are not altered but assigned into domains.Type: GrantFiled: January 31, 2018Date of Patent: January 18, 2022Assignee: Experian Information Solutions, Inc.Inventors: Anukool Rege, Prashant Kumar Sahay, Mervyn Lally, Shirish Kumar, Sanskar Sahay
-
Publication number: 20220012258Abstract: In one aspect, a computerized method for implementing a matching platform for entities includes the step of, in a real-time data processing layer, implementing a real-time linking on an input event stream. The method includes storing an output of the real-time linking in a state change store. The method includes the step of, in a high-throughput layer, implementing a high-throughput linking of entities from a batch data source stream. The method includes storing an output of the high-throughput linking of entities in a state store to generate a unified and consistent view of the entities across a different representation of the entities. The method includes implementing an on-demand linking using the state change store and the state store.Type: ApplicationFiled: May 13, 2021Publication date: January 13, 2022Inventor: SHIRISH KUMAR
-
Publication number: 20180218069Abstract: This disclosure relates to data association, attribution, annotation, and interpretation systems and related methods of efficiently organizing heterogeneous data at a massive scale. Incoming data is received and extracted for identifying information (“information”). Multiple dimensionality reducing functions are applied to the information, and based on the function results, the information are grouped into sets of similar information. Filtering rules are applied to the sets to exclude non-matching information in the sets. The sets are then merged into groups of information based on whether the sets contain at least one common information. A common link may be associated with information in a group. If the incoming data includes the identifying information associated with to the common link, the incoming data is assigned the common link. In some embodiments, incoming data are not altered but assigned into domains.Type: ApplicationFiled: January 31, 2018Publication date: August 2, 2018Inventors: Anukool Rege, Prashant Kumar Sahay, Mervyn Lally, Shirish Kumar, Sanskar Sahay
-
Publication number: 20130245930Abstract: A method of operation of a navigation system includes: locating a target POI; generating a relationship for the target POI and a related POI; and generating a travel route based on the relationship to the target POI for displaying on a device.Type: ApplicationFiled: March 13, 2012Publication date: September 19, 2013Applicant: TELENAV, INC.Inventors: Aliasgar Mumtaz Husain, Shirish Kumar