Next Priority Concept: A new and generic algorithm computing concepts from complex and heterogeneous data. (arXiv:1912.11038v1 [cs.AI])

In this article, we present a new data type agnostic algorithm calculating a
concept lattice from heterogeneous and complex data. Our NextPriorityConcept
algorithm is first introduced and proved in the binary case as an extension of
Bordat’s algorithm with the notion of strategies to select only some
predecessors of each concept, avoiding the generation of unreasonably large
lattices. The algorithm is then extended to any type of data in a generic way.
It is inspired from pattern structure theory, where data are locally described
by predicates independent of their types, allowing the management of
heterogeneous data.

Source link

Related posts

Finally, a Neural Network Can Turn a Bunch of Sheep Into Some Decent Giraffes – Gizmodo


Abnormal expression of long non-coding RNAs in myocardial infarction.


Creating a Magic 8 Ball for Discord [1/2]


This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish. Accept Read More

Privacy & Cookies Policy