Patents by Inventor Reinhold Keuler

Reinhold Keuler 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: 6954756
    Abstract: A method and system for automatically detecting deviations in a data table comprising a multitude of records and a multitude of columns. A column of the data table is selected as a classification column and a classification tree is calculated with respect to the classification column. Each edge of the classification tree is associated with a predicate. The leaf nodes of the classification tree are associated with a leaf record set comprising the subset of records for which the class predicate comprising all predicates along a path from a root node of the classification tree to the leaf nodes evaluates to TRUE. Leaf nodes are associated with a leaf label representing an expected value in the classification column for the corresponding leaf record sets. From the leaf record sets all records deviating with respect to the corresponding classification column from the leaf label are determined as deviation sets.
    Type: Grant
    Filed: August 16, 2001
    Date of Patent: October 11, 2005
    Assignee: International Business Machines Corporation
    Inventors: Andreas Arning, Toni Bollinger, Reinhold Keuler, Friedemann Harald Schwenkreis
  • Publication number: 20020049740
    Abstract: A method and system for automatically detecting deviations in a data table comprising a multitude of records and a multitude of columns. A column of the data table is selected as a classification column and a classification tree is calculated with respect to the classification column. Each edge of the classification tree is associated with a predicate. The leaf nodes of the classification tree are associated with a leaf record set comprising the subset of records for which the class predicate comprising all predicates along a path from a root node of the classification tree to the leaf nodes evaluates to TRUE. Leaf nodes are associated with a leaf label representing an expected value in the classification column for the corresponding leaf record sets. From the leaf record sets all records deviating with respect to the corresponding classification column from the leaf label are determined as deviation sets.
    Type: Application
    Filed: August 16, 2001
    Publication date: April 25, 2002
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andreas Arning, Toni Bollinger, Reinhold Keuler, Friedemann Harald Schwenkreis