Sciweavers

184 search results - page 22 / 37
» Horn-Representation of a Concept Lattice
Sort
View
FSS
2007
176views more  FSS 2007»
14 years 9 months ago
Set approximations in fuzzy formal concept analysis
Formal concept analysis and rough set theory are two important tools in knowledge representation and knowledge discovery in relational information systems. The purpose of this pap...
Ming-Wen Shao, Min Liu, Wen-Xiu Zhang
ICFCA
2007
Springer
15 years 1 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...
ECCC
2006
97views more  ECCC 2006»
14 years 9 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
Adam R. Klivans, Alexander A. Sherstov
COOPIS
2004
IEEE
15 years 1 months ago
Aligning Ontologies and Evaluating Concept Similarities
An innate characteristic of the development of ontologies is that they are often created by independent groups of expertise, which generates the necessity of merging and aligning o...
Kleber Xavier Sampaio de Souza, Joseph Davis
CLA
2004
14 years 11 months ago
Binary Factor Analysis with Help of Formal Concepts
Binary factor analysis (BFA, also known as Boolean Factor Analysis) is a nonhierarchical analysis of binary data, based on reduction of binary space dimension. It allows us to find...
Ales Keprt, Václav Snásel