Sciweavers

232 search results - page 12 / 47
» Set approximations in fuzzy formal concept analysis
Sort
View
KDID
2004
140views Database» more  KDID 2004»
14 years 10 months ago
Mining Formal Concepts with a Bounded Number of Exceptions from Transactional Data
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
Jérémy Besson, Céline Robarde...
ICFCA
2009
Springer
15 years 4 months ago
Exploring Finite Models in the Description Logic
Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finit...
Franz Baader, Felix Distel
ER
2006
Springer
99views Database» more  ER 2006»
15 years 1 months ago
Ontology with Likeliness and Typicality of Objects in Concepts
Ontologies play an indispensable role in the Semantic Web by specifying the definitions of concepts and individual objects. However, most of the existing methods for constructing o...
Ching-man Au Yeung, Ho-fung Leung
EUSFLAT
2003
206views Fuzzy Logic» more  EUSFLAT 2003»
14 years 10 months ago
Analysis of multi-product break-even with uncertain information
We revise the classic methodology to find the multi-product break-even point. In the current paper we propose a solution to the problem under uncertainty conditions, based on Dur...
Luisa L. Lazzari, María Silvia Moriñ...
CVPR
2007
IEEE
15 years 11 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...