Fast algorithms for implication bases and attribute exploration using proper premises U Ryssel, F Distel, D Borchmann Annals of Mathematics and Artificial Intelligence 70, 25-53, 2014 | 45 | 2014 |

Learning terminological knowledge with high confidence from erroneous data D Borchmann Saechsische Landesbibliothek-Staats-und Universitaetsbibliothek Dresden, 2014 | 28 | 2014 |

Mining of EL-gcis D Borchmann, F Distel 2011 IEEE 11th International Conference on Data Mining Workshops, 1083-1090, 2011 | 25 | 2011 |

Some Experimental Results on Randomly Generating Formal Contexts. D Borchmann, T Hanika CLA 1624, 57-69, 2016 | 19 | 2016 |

Probably approximately correct learning of Horn envelopes from queries D Borchmann, T Hanika, S Obiedkov Discrete Applied Mathematics 273, 30-42, 2020 | 18 | 2020 |

NextClosures: Parallel Computation of the Canonical Base. F Kriegel, D Borchmann CLA, 181-192, 2015 | 18 | 2015 |

Fast Computation of Proper Premises. U Ryssel, F Distel, D Borchmann CLA 959, 100-113, 2011 | 18 | 2011 |

Axiomatisation of general concept inclusions from finite interpretations D Borchmann, F Distel, F Kriegel Journal of Applied Non-Classical Logics 26 (1), 1-46, 2016 | 17 | 2016 |

On the usability of probably approximately correct implication bases D Borchmann, T Hanika, S Obiedkov International Conference on Formal Concept Analysis, 72-88, 2017 | 12 | 2017 |

A general form of attribute exploration D Borchmann arXiv preprint arXiv:1202.4824, 2012 | 12 | 2012 |

NextClosures: parallel computation of the canonical base with background knowledge F Kriegel, D Borchmann International Journal of General Systems 46 (5), 490-510, 2017 | 10 | 2017 |

Towards an error-tolerant construction of-ontologies from data using formal concept analysis D Borchmann International Conference on Formal Concept Analysis, 60-75, 2013 | 10 | 2013 |

A Generalized Next-Closure Algorithm--Enumerating Semilattice Elements from a Generating Set D Borchmann arXiv preprint arXiv:1111.3975, 2011 | 10 | 2011 |

Individuality in social networks D Borchmann, T Hanika Formal Concept Analysis of Social Networks, 19-40, 2017 | 8 | 2017 |

Decomposing finite closure operators by attribute exploration D Borchmann Contributions to ICFCA, 24-37, 2011 | 8 | 2011 |

Preliminary Results on the Identity Problem in Description Logic Ontologies. F Baader, D Borchmann, A Nuradiansyah Description Logics, 2017 | 7 | 2017 |

Implications and dependencies between attributes B Ganter, R Wille, D Borchmann, J Prochaska Formal Concept Analysis: 14th International Conference, ICFCA 2017, Rennes …, 2017 | 7 | 2017 |

Axiomatizing Confident ℰℒK gfp-GCIs of Finite Interpretations D Borchmann Report MATH-AL-08-2012, Chair of Algebraic Structure Theory, Institute of …, 2012 | 7 | 2012 |

Towards an FCA-based Recommender System for Black-Box Optimization. J Asmus, D Borchmann, IF Sbalzarini, D Walther FCA4AI@ ECAI, 35-42, 2014 | 6 | 2014 |

Concept lattice orbifolds–first steps D Borchmann, B Ganter Formal Concept Analysis: 7th International Conference, ICFCA 2009 Darmstadt …, 2009 | 6 | 2009 |