Sciweavers

63 search results - page 7 / 13
» Computing iceberg concept lattices with T
Sort
View
ICCS
2004
Springer
14 years 1 months ago
A Cartesian Closed Category of Approximable Concept Structures
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
Pascal Hitzler, Guo-Qiang Zhang
CLA
2004
13 years 9 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
ICFCA
2007
Springer
13 years 11 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»
13 years 7 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
CLA
2004
13 years 9 months ago
Using Concept Formal Analysis for Cooperative Information Retrieval
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
Ibtissem Nafkha, Samir Elloumi, Ali Jaoua