Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICFCA
2007
Springer
12 years 9 months ago
A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data
Recent advances in data and knowledge engineering have emphasized the need for formal concept analysis (FCA) tools taking into account structured data. There are a few adaptations ...
Mohamed Rouane Hacene, Marianne Huchard, Amedeo Na...
ICFCA
2007
Springer
12 years 9 months ago
On Multi-adjoint Concept Lattices: Definition and Representation Theorem
Several fuzzifications of formal concept analysis have been proposed to deal with uncertainty or incomplete information. In this paper, we focus on the new paradigm of multi-adjoin...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
ICFCA
2007
Springer
12 years 9 months ago
Performances of Galois Sub-hierarchy-building Algorithms
Abstract. The Galois Sub-hierarchy (GSH) is a polynomial-size representation of a concept lattice which has been applied to several fields, such as software engineering and linguis...
Gabriela Arévalo, Anne Berry, Marianne Huch...
ICFCA
2007
Springer
12 years 9 months ago
A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets
Different rule semantics have been successively defined in many contexts such as implications in artificial intelligence, functional dependencies in databases or association rules...
Marie Agier, Jean-Marc Petit
ICFCA
2007
Springer
12 years 11 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...
ICFCA
2007
Springer
12 years 11 months ago
Some Notes on Pseudo-closed Sets
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for ļ¬nding minimal representations of impli...
Sebastian Rudolph
ICFCA
2007
Springer
12 years 11 months ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos
books