Sciweavers

7 search results - page 1 / 2
» Background knowledge in formal concept analysis: constraints...
Sort
View
SAC
2010
ACM
13 years 11 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
SAC
2008
ACM
13 years 3 months ago
Adding background knowledge to formal concept analysis via attribute dependency formulas
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
Radim Belohlávek, Vilém Vychodil
ICCS
2007
Springer
13 years 10 months ago
Using FCA for Encoding Closure Operators into Neural Networks
After decades of concurrent development of symbolic and connectionist methods, recent years have shown intensifying efforts of integrating those two paradigms. This paper contribu...
Sebastian Rudolph
DKE
2002
218views more  DKE 2002»
13 years 4 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
ALIFE
2006
13 years 4 months ago
Axiomatic Scalable Neurocontroller Analysis via the Shapley Value
One of the major challenges in the field of neurally driven evolved autonomous agents is deciphering the neural mechanisms underlying their behavior. Aiming at this goal, we have d...
Alon Keinan, Ben Sandbank, Claus C. Hilgetag, Isaa...