On the Usability of Probably Approximately Correct Implication Bases

January 04, 2017 Β· Declared Dead Β· πŸ› International Conference on Formal Concept Analysis

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Daniel Borchmann, Tom Hanika, Sergei Obiedkov arXiv ID 1701.00877 Category cs.AI: Artificial Intelligence Cross-listed cs.LG, cs.LO Citations 7 Venue International Conference on Formal Concept Analysis Last Checked 4 months ago
Abstract
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. To this end, we quantitatively examine the behavior of probably approximately correct implication bases on artificial and real-world data sets and compare their precision and recall with respect to their corresponding exact implication bases. Using a small example, we also provide qualitative insight that implications from probably approximately correct bases can still represent meaningful knowledge from a given data set.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Artificial Intelligence

Died the same way β€” πŸ‘» Ghosted