Machine Learning and Data Mining

trRow_img Andreas Maunz received his masters in computer science from Albert-Ludwigs University, Freiburg. He is currently a PhD student at the chair of Prof. Stefan Kramer. His main interests are machine learning and data mining in large amounts of data using (sub)symbolic representation, especially mining and modeling of discrete data with pattern recognition techniques, including frequency- and generality-based as well as statistical filters.

Software

  • LibBBRC for mining backbone refinement class representatives [API, Supporting Website]
  • LibLAST for latent structure pattern mining, [API, Supporting Website]
  • Ready-to-use appliance with both BBRC and LAST, based on VirtualBox.
  • Multi-View Clustering (Bickel und Scheffer, ICDM 2004) in R (also available from CRAN).

Publications

Items not available as download may be obtained upon request. See also my indexed entries on PubMed and DBLP.

Unpublished Material

  • Related to Publications:
    • Maunz A: “A Quantitative Extension to the Lazar Algorithm for the Prediction of Chemical Properties.” [pdf diplomarbeit.pdf].
    • Maunz A: “On the Number of Backbone Refinement Classes”, derivation and proof of a formula for counting the number of BBRCs in a perfect binary tree. Comparison to the total number of subtrees [pdf bbrc-no.pdf].
    • Maunz A: “On the Co-Occurrence and Diversity of Backbone Refinement Classes”, euclidean embedding of BBRC features and instances in 2D as well as feature similarity alike to ORIGAMI approach [pdf bbrc-rep.pdf].
    • Maunz A: “Support Vectors and the Margin in a Nutshell”,
      brief outline of support vector theory and the
      concept of margin. (see ch. 1,2 and 7 of
      Schölkopf and Smola, 2002) [pdf sv-margin.pdf].

Links

  • Related to Publications:
    • “Virtuelle Versuchskaninchen”, in Deutschlandradio about Lazar [html].
    • “Mehr Tierversuche durch Chemikalienrichtlinie Reach”, TV report in 3sat about animal testing and alternative test methods in the EU, featuring an interview with Christoph Helma. [html].
  • Other material:
    • “Machine Learning”, course by Andrew Ng in Stanford University 2009 [html].
    • “Graph Mining and Graph Kernels”, video lecture by Karsten Borgwardt and Xifeng Yan in KDD ’08 [html].

Comments are closed.