Florian Seiffarth

According to our database, Florian Seiffarth authored at least 8 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Rule Based Learning with Dynamic (Graph) Neural Networks.

Florian Seiffarth

CoRR, 2024

2023

Maximal closed set and half-space separations in finite closure systems.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

Theor. Comput. Sci., September, 2023

Theoretical and Practical Aspects of Finite Closure Systems for Mining and Learning

Florian Seiffarth

PhD thesis, 2023

2022

A Fast Heuristic for Computing Geodesic Cores in Large Networks.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

CoRR, 2022

A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

Proceedings of the LWDA 2022 Workshops: FGWM, 2022

A Fast Heuristic for Computing Geodesic Closures in Large Networks.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

Proceedings of the Discovery Science - 25th International Conference, 2022

2020

Maximum Margin Separations in Finite Closure Systems.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

HOPS: Probabilistic Subtree Mining for Small and Large Graphs.

Pascal Welke, Florian Seiffarth, Michael Kamp, Stefan Wrobel

Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020