Patents by Inventor Daniel Kocher

Daniel Kocher 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: 12681935
    Abstract: Provided is a computer-implemented method to find similar sets to a selected query set within a collection of sets, wherein each set represents a process. Each set is transformed to a representation in a vector space. Moreover, each set comprises a prefix. The method comprises creating and storing a data structure representing an inverted metric index in a storage device. The similar sets to the selected query set are identified by a probing step followed by a candidate verifying step. In the probing step, the inverted metric index is filtered by means of a predefined subspace of the vector space. In the candidate verifying step, each set of the filtered inverted metric index is identified as a similar set if its distance value is smaller or equal to a predefined distance threshold value.
    Type: Grant
    Filed: February 16, 2023
    Date of Patent: July 14, 2026
    Assignee: CELONIS SE
    Inventors: Manuel Widmoser, Nikolaus Augsten, Daniel Kocher, Willi Mann
  • Patent number: 12517910
    Abstract: Provided is a method for the set similarity join, wherein each set represents a process and each token represents a process step. The process comprises a series of process steps executed in at least one source computer system. Hence, similar sets represent similar processes within a collection of processes. The method is based on a two-level signature scheme. Having indexed the sets using a first signature into inverted lists, selected lists, in particular long lists, are reindexed using a second signature. As a result, the number of candidates and thus the number of required distance calculations can be effectively reduced. Its experimental evaluation has shown that the method consistently outperforms state-of-the-art algorithms on datasets with diverging characteristics, suggesting a stable solution for a wide range of applications.
    Type: Grant
    Filed: April 25, 2023
    Date of Patent: January 6, 2026
    Assignee: CELONIS SE
    Inventors: Daniel Schmitt, Nikolaus Augsten, Daniel Kocher, Willi Mann, Alexander Miller
  • Publication number: 20250284693
    Abstract: Provided is a method for the set similarity join, wherein each set represents a process and each token represents a process step. The process comprises a series of process steps executed in at least one source computer system. Hence, similar sets represent similar processes within a collection of processes. The method is based on a two-level signature scheme. Having indexed the sets using a first signature into inverted lists, selected lists, in particular long lists, are reindexed using a second signature. As a result, the number of candidates and thus the number of required distance calculations can be effectively reduced. Its experimental evaluation has shown that the method consistently outperforms state-of-the-art algorithms on datasets with diverging characteristics, suggesting a stable solution for a wide range of applications.
    Type: Application
    Filed: April 25, 2023
    Publication date: September 11, 2025
    Inventors: Daniel SCHMITT, Nikolaus AUGSTEN, Daniel KOCHER, Willi MANN, Alexander MILLER
  • Publication number: 20250156447
    Abstract: Provided is a computer-implemented method for computing an index for a first density-based clustering of a collection of records, wherein the index is stored with a storage device. The index supports the extraction of exact clusterings for any selected threshold distance ?* less than or equal to a predefined threshold distance ? and a predefined number of records MinPts, which forms the pair of input parameters for which the index is computed.
    Type: Application
    Filed: February 16, 2023
    Publication date: May 15, 2025
    Inventors: Konstantin Emil THIEL, Nikolaus AUGSTEN, Daniel KOCHER, Willi MANN
  • Publication number: 20250156424
    Abstract: Provided is a computer-implemented method to find similar sets to a selected query set within a collection of sets, wherein each set represents a process. Each set is transformed to a representation in a vector space. Moreover, each set comprises a prefix. The method comprises creating and storing a data structure representing an inverted metric index in a storage device. The similar sets to the selected query set are identified by a probing step followed by a candidate verifying step. In the probing step, the inverted metric index is filtered by means of a predefined subspace of the vector space. In the candidate verifying step, each set of the filtered inverted metric index is identified as a similar set if its distance value is smaller or equal to a predefined distance threshold value.
    Type: Application
    Filed: February 16, 2023
    Publication date: May 15, 2025
    Inventors: Manuel WIDMOSER, Nikolaus AUGSTEN, Daniel KOCHER, Willi MANN
  • Publication number: 20110215744
    Abstract: The invention relates to a method for providing information on a rotor position of a rotor of an electric machine (2) for utilization in a function connected downstream, comprising the following steps: —determining at least one electric operating variable of a stator winding of the electric machine, particularly a phase current and/or a phase voltage; —determining a rotor position as a function of the electric operating variable—providing information on the rotor position determined as a function of the electric operating variable for the function connected downstream if the rotational speed of the electric machine (2) exceeds a threshold rotational speed (SW).
    Type: Application
    Filed: July 30, 2009
    Publication date: September 8, 2011
    Applicant: ROBERT BOSCH GMBH
    Inventors: Daniel Kocher, Rolf Jaros, Kurt Reutlinger