Sciweavers

234 search results - page 14 / 47
» Rough Set Approximations in Formal Concept Analysis
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
IJCAI
2007
13 years 9 months ago
Encoding Closure Operators into Neural Networks
Motivated by basic ideas from formal concept analysis, we propose two ways to directly encode closure operators on finite sets in a 3-layered feed forward neural network.
Sebastian Rudolph
AMAI
2007
Springer
13 years 7 months ago
Relational concept discovery in structured datasets
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Marianne Huchard, Mohamed Rouane Hacene, Cyril Rou...
WWW
2007
ACM
14 years 8 months ago
Using Google distance to weight approximate ontology matches
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
Risto Gligorov, Warner ten Kate, Zharko Aleksovski...
CLA
2007
13 years 9 months ago
Representing Numeric Values in Concept Lattices
Formal Concept Analysis is based on the occurrence of symbolic attributes in individual objects, or observations. But, when the attribute is numeric, treatment has been awkward. In...
John L. Pfaltz