Search Results for author: Sergei Obiedkov

Found 4 papers, 0 papers with code

Probably approximately correct learning of Horn envelopes from queries

no code implementations16 Jul 2018 Daniel Borchmann, Tom Hanika, Sergei Obiedkov

We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain.

Attribute

Neologisms on Facebook

no code implementations13 Apr 2018 Nikita Muravyev, Alexander Panchenko, Sergei Obiedkov

In this paper, we present a study of neologisms and loan words frequently occurring in Facebook user posts.

Marketing

On the Usability of Probably Approximately Correct Implication Bases

no code implementations4 Jan 2017 Daniel Borchmann, Tom Hanika, Sergei Obiedkov

We revisit the notion of probably approximately correct implication bases from the literature and present a first formulation in the language of formal concept analysis, with the goal to investigate whether such bases represent a suitable substitute for exact implication bases in practical use-cases.

Cannot find the paper you are looking for? You can Submit a new open access paper.