Dr. Florian Seiffarth
Contact
Room 1.034, Friedrich-Hirzebruch-Allee 8, 53115 Bonn.
seiffarth[at]cs.uni-bonn.de
+49 228 734505
Research Area
Machine Learning and Data Mining, especially on finite structured data such as graphs (social graphs, molecular graphs) and also abstract finite closure systems.
Vita
2018 - 2023
PhD in Computer Science at the University of Bonn
Dissertation: Theoretical and Practical Aspects of Finite Closure Systems for Mining and Learning (Supervisors: Prof. Dr. Stefan Wrobel, Dr. Tamas Horvath)
2016 - 2017
Master in Mathematics at the University of Bonn
Master Thesis: On KLR and quiver Schur algebras (Supervisor: Prof. Dr. Catharina Stroppel)
2012 - 2015
Bachelor in Mathematics at the University of Bonn
Publications
Theoretical and Practical Aspects of Finite Closure Systems for Mining and Learning
Florian Seiffarth
Dissertation
Maximal closed set and half-space separations in finite closure systems
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
Theor. Comput. Sci. 973: 114105 (2023)
A Fast Heuristic for Computing Geodesic Closures in Large Networks.
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
DS 2022: 476-490
A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining.
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
LWDA 2022: 21-32
HOPS: Probabilistic Subtree Mining for Small and Large Graphs.
Pascal Welke, Florian Seiffarth , Michael Kamp, Stefan Wrobel
KDD 2020: 1275-1284
Maximum Margin Separations in Finite Closure Systems.
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
ECML/PKDD (1) 2020: 3-18
Maximal Closed Set and Half-Space Separations in Finite Closure Systems.
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
ECML/PKDD (1) 2019: 21-37