Patents by Inventor Arun Kumar Parayatham

Arun Kumar Parayatham 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: 20220036222
    Abstract: System pre-processes and computes class distribution of decision attribute and statistics for discretization of continuous attributes through use of compute buckets. System computes the variability of each of the attributes and considers only the non-zero variability attributes. System computes the discernibility strength of each attribute. The software system generates size 1 patterns using compute bucket and calculates if each pattern of size 1 is a reliable pattern for any class. The system calculates if reliable pattern of size 1 is a significant pattern for any class. The system generates size k patterns from size k?1 patterns checking for significance of size k patterns and refinability. The system readjusts pattern statistics for only significant patterns for size k?1 patterns. The system computes a cumulative coverage of the sorted relevant patterns of up to size k by finding out the union of records of that particular class.
    Type: Application
    Filed: September 2, 2021
    Publication date: February 3, 2022
    Applicant: Innominds Inc.
    Inventors: Arun Kumar Parayatham, Ravi Kumar Meduri
  • Patent number: 10733183
    Abstract: The software system processes extracts reliable, significant and relevant patterns. System runs through preprocessing steps. System then generates the size 1 patterns. It then checks for both reliability and refinability of the size 1 patterns. System grows the refinable patterns by increasing the attributes and its values in the pattern by one at a time to find a size 2 pattern. The system then uses the number of pattern occurrences of size 2 pattern as a basis to find the reliable patterns. System also checks for statistical significance over the size 1 patterns and once again for the refinability of the size 2 patterns. System checks for relevance of the size 1 patterns by obtaining the disjointed record complement set. Software system readjusts the pattern statistics of size 1 and removes the non-relevant super-patterns. This process is repeated from size 2 to N.
    Type: Grant
    Filed: December 6, 2015
    Date of Patent: August 4, 2020
    Inventors: Arun Kumar Parayatham, Ravi Kumar Meduri
  • Patent number: 10733156
    Abstract: The software system discretises continuous attributes by initially sorting attribute value pairs. The system creates partitions based on unique attribute index. The computing system adds attribute value records to the partition element until minimum frequency has been reached. The system calculates whether new partition element is mutually insignificant compared with each of partition elements in a bucket. The system adds the mutually insignificant partition element into the bucket; otherwise, the system closes the bucket and creates a new bucket to add the mutually significant partition element to the new bucket. After all the buckets have been created, the system groups buckets of continuous attributes in to a bucket group so that the buckets in a group are mutually insignificant. If bucket is mutually significant, the system creates a new bucket group and adds subsequent mutually significant bucket to said new bucket group.
    Type: Grant
    Filed: August 14, 2017
    Date of Patent: August 4, 2020
    Inventors: Arun Kumar Parayatham, Ravi Kumar Meduri
  • Publication number: 20190050429
    Abstract: The software system discretises continuous attributes by initially sorting attribute value pairs. The system creates partitions based on unique attribute index. The computing system adds attribute value records to the partition element until minimum frequency has been reached. The system calculates whether new partition element is mutually insignificant compared with each of partition elements in a bucket. The system adds the mutually insignificant partition element into the bucket; otherwise, the system closes the bucket and creates a new bucket to add the mutually significant partition element to the new bucket. After all the buckets have been created, the system groups buckets of continuous attributes in to a bucket group so that the buckets in a group are mutually insignificant. If bucket is mutually significant, the system creates a new bucket group and adds subsequent mutually significant bucket to said new bucket group.
    Type: Application
    Filed: August 14, 2017
    Publication date: February 14, 2019
    Applicant: Innominds Inc.
    Inventors: Arun Kumar Parayatham, Ravi Kumar Meduri
  • Publication number: 20170344890
    Abstract: System pre-processes and computes class distribution of decision attribute and statistics for discretization of continuous attributes through use of compute buckets. System computes the variability of each of the attributes and considers only the non-zero variability attributes. System computes the discernibility strength of each attribute. The software system generates size 1 patterns using compute bucket and calculates if each pattern of size 1 is a reliable pattern for any class. The system calculates if reliable pattern of size 1 is a significant pattern for any class. The system generates size k patterns from size k?1 patterns checking for significance of size k patterns and refinability. The system readjusts pattern statistics for only significant patterns for size k?1 patterns. The system computes a cumulative coverage of the sorted relevant patterns of up to size k by finding out the union of records of that particular class.
    Type: Application
    Filed: May 26, 2016
    Publication date: November 30, 2017
    Inventors: Arun Kumar Parayatham, Ravi Kumar Meduri
  • Publication number: 20170161321
    Abstract: The software system processes extracts reliable, significant and relevant patterns. System runs through preprocessing steps. System then generates the size 1 patterns. It then checks for both reliability and refinability of the size 1 patterns. System grows the refinable patterns by increasing the attributes and its values in the pattern by one at a time to find a size 2 pattern. The system then uses the number of pattern occurrences of size 2 pattern as a basis to find the reliable patterns. System also checks for statistical significance over the size 1 patterns and once again for the refinability of the size 2 patterns. System checks for relevance of the size 1 patterns by obtaining the disjointed record complement set. Software system readjusts the pattern statistics of size 1 and removes the non-relevant super-patterns. This process is repeated from size 2 to N.
    Type: Application
    Filed: December 6, 2015
    Publication date: June 8, 2017
    Applicant: Innominds Inc.
    Inventors: Arun Kumar Parayatham, Ravi Kumar Meduri