Florian Seiffarth

Orcid: 0009-0004-5251-0894

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Rule Based Learning with Dynamic (Graph) Neural Networks.
CoRR, 2024

2023
Maximal closed set and half-space separations in finite closure systems.
Theor. Comput. Sci., September, 2023

Theoretical and Practical Aspects of Finite Closure Systems for Mining and Learning
PhD thesis, 2023

2022
A Fast Heuristic for Computing Geodesic Cores in Large Networks.
CoRR, 2022

A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining.
Proceedings of the LWDA 2022 Workshops: FGWM, 2022

A Fast Heuristic for Computing Geodesic Closures in Large Networks.
Proceedings of the Discovery Science - 25th International Conference, 2022

2020
Maximum Margin Separations in Finite Closure Systems.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

HOPS: Probabilistic Subtree Mining for Small and Large Graphs.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020


  Loading...