Berlin Metropolitan Area
313 followers 198 connections

Join to view profile

About

If you would ask for short categorisation of myself, then I would answer:
"I am a…

Experience & Education

  • Afilio - Gesellschaft für Vorsorge mbH

View Richard’s full experience

See their title, tenure and more.

or

By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement, Privacy Policy, and Cookie Policy.

Publications

  • A Subspace Clustering Extension for the KNIME Data Mining Framework

    Proc. IEEE International Conference on Data Mining Workshops (ICDMW), Brussels, Belgium

    Analyzing databases with many attributes per object is a recent challenge. For these highdimensional data it is known that traditional clustering algorithmsfail to detect meaningful patterns. As a solution subspace clustering techniqueswere introduced. They analyze arbitrary subspace projectionsof the data to detect clustering structures.

    In this demonstration, we introduce the first subspace clustering extension for the well-established KNIME data mining framework. While KNIME offers a…

    Analyzing databases with many attributes per object is a recent challenge. For these highdimensional data it is known that traditional clustering algorithmsfail to detect meaningful patterns. As a solution subspace clustering techniqueswere introduced. They analyze arbitrary subspace projectionsof the data to detect clustering structures.

    In this demonstration, we introduce the first subspace clustering extension for the well-established KNIME data mining framework. While KNIME offers a variety of data mining functionalities, subspace clustering is missing so far. Our novel extension provides a multitude of algorithms, data generators, evaluation measures, and visualization techniques specifically designed for subspace clustering.It deeply integrates into the KNIME framework allowing a flexible combination of the existing KNIME features with the novel subspace components. The extension is available on our website.

    See publication

  • Automated Termination Proofs for Java Bytecode with Cyclic Data

    Proceedings of the 24th International Conference on Computer Aided Verification (CAV '12), Berkeley, CA, USA, Lecture Notes in Computer Science (Springer-Verlag)

    In earlier work, we developed a technique to prove termination of Java programs automatically: First, Java programs are automatically transformed to term rewrite systems (TRSs) and then, existing methods and tools are used to prove termination of the resulting TRSs.
    In this paper, we extend our technique in order to prove termination of algorithms on cyclic data such as cyclic lists or graphs automatically. We implemented our technique in the tool AProVE and performed extensive experiments…

    In earlier work, we developed a technique to prove termination of Java programs automatically: First, Java programs are automatically transformed to term rewrite systems (TRSs) and then, existing methods and tools are used to prove termination of the resulting TRSs.
    In this paper, we extend our technique in order to prove termination of algorithms on cyclic data such as cyclic lists or graphs automatically. We implemented our technique in the tool AProVE and performed extensive experiments to evaluate its practical applicability.

    Other authors
    • Marc Brockschmidt
    • Jürgen Giesl
    See publication

Projects

Languages

  • Deutsch

    -

  • Englisch

    -

View Richard’s full profile

  • See who you know in common
  • Get introduced
  • Contact Richard directly
Join to view full profile

Other similar profiles

Explore top content on LinkedIn

Find curated posts and insights for relevant topics all in one place.

View top content