Patents by Inventor Sunit SIVARAJ

Sunit SIVARAJ 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: 20240419653
    Abstract: In some aspects, a record-matching computing system for detecting fragmented records is provided. The record-matching system is configured to identify a list of candidate records for merging from a set of data records. The record-matching system determines a matching decision for each pair of candidate records in the list and generates a graph. The graph includes nodes representing respective candidate records and edges connecting the nodes. Each edge represents a match between a pair of nodes connected by the edge according to the matching decisions. The record-matching system detects a connected component in the graph from which a qualified connected component is identified based on the minimum connectivity of the qualified connected component. The record-matching system updates the set of data records stored by merging candidate records represented by the nodes in the qualified connected component.
    Type: Application
    Filed: October 13, 2021
    Publication date: December 19, 2024
    Inventors: Sunit Sivaraj, Marek Cyzio, Piyush Patel, Michele King, Rajkumar Bondugula
  • Publication number: 20240411753
    Abstract: In some aspects, a record-matching computing system for matching records to facilitate database search and fragmented records detection is provided. The record-matching computing system is configured to search for a data record that matches a query record. The record-matching computing system retrieves a reference record from data records and generates multiple identifier attributes for the query record and reference record, including identifier scores and compound scores. Each identifier score measures a degree of matching between the corresponding identifiers in the query record and reference record. A compound score is generated by combining two or more identifier scores. The record-matching computing system applies the identifier attributes to a machine learning model configured to predict a match classification based on input identifier attributes for a pair of data records.
    Type: Application
    Filed: October 13, 2021
    Publication date: December 12, 2024
    Inventors: Sunit Sivaraj, Marek Cyzio, Piyush Patel, Michele King, Rajkumar Bondugula
  • Publication number: 20240411737
    Abstract: In some aspects, a record-matching computing system for matching records to facilitate database search and fragmented records detection is provided. The record-matching computing system is configured to receiving a query record and search in a data repository storing data records for a record that matches the query record. The record-matching computing system retrieves a reference record from the data records and generates multiple identifier scores. Each identifier score measures a degree of matching between the corresponding identifiers in the query record and the reference record. The record-matching computing system generates an overall matching score by combining at least two of the identifier scores and determines the reference record as a match to the query record based on the overall matching score exceeding a threshold value.
    Type: Application
    Filed: October 13, 2021
    Publication date: December 12, 2024
    Inventors: Sunit Sivaraj, Marek Cyzio, Piyush Patel, Michele King, Rajkumar Bondugula
  • Publication number: 20240303274
    Abstract: Search indexes can be automatically generated and used for expediting searching of a computerized database. For example, a system can access an inquiry dataset that includes relationships between prior inquiries and returned records from a database. The system can then generate a set of Boolean indexes based on the prior inquiries. The system can then identify frequent indexes that occur at least a threshold number of times in the set of Boolean indexes and that have estimated candidate sizes that are less than a threshold size. The system can then select the frequent index with the highest frequency from among the frequent indexes. The selected frequent index can be subsequently used to expedite searching of the database in response to receiving a search query associated with the frequent index from a client device.
    Type: Application
    Filed: March 10, 2023
    Publication date: September 12, 2024
    Inventors: Sunit SIVARAJ, Marek Ludomir CYZIO, Haroon SYED, Khizer Daniyal SYED
  • Publication number: 20210357707
    Abstract: A unit-classification system receives a data set with identity data objects corresponding to personal identity components. Feature vectors are determined for the identity data objects. A trained classifier model determines, based on a feature vector for each identity data object, whether the corresponding personal identity components are included in a identity component (“IC”) category. The unit-classification system generates an IC identification for a first IC category, and associates the IC identification with a first identity data object corresponding to a first personal identity component. The unit-classification system identifies a second identity data object corresponding to a second personal identity component included in the first IC category. The unit-classification system modifies the first and second identity data objects to include the IC identification.
    Type: Application
    Filed: March 24, 2020
    Publication date: November 18, 2021
    Inventors: Rajkumar BONDUGULA, Piyushkumar PATEL, Sunit SIVARAJ