Sciweavers

184 search results - page 25 / 37
» Horn-Representation of a Concept Lattice
Sort
View
MLQ
2007
72views more  MLQ 2007»
14 years 9 months ago
Mass problems and almost everywhere domination
We examine the concept of almost everywhere domination from the viewpoint of mass problems. Let AED and MLR be the set of reals which are almost everywhere dominating and Martin-L...
Stephen G. Simpson
FCT
1991
Springer
15 years 1 months ago
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
We report on improved practical algorithms for lattice basis reduction. We propose a practical oating point version of the L3{algorithm of Lenstra, Lenstra, Lovasz (1982). We pres...
Claus-Peter Schnorr, M. Euchner
CLA
2007
14 years 11 months ago
Policies Generalization in Reinforcement Learning using Galois Partitions Lattices
The generalization of policies in reinforcement learning is a main issue, both from the theoretical model point of view and for their applicability. However, generalizing from a se...
Marc Ricordeau, Michel Liquiere
DIS
2008
Springer
14 years 11 months ago
Constructing Iceberg Lattices from Frequent Closures Using Generators
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, R...
DATAMINE
2010
166views more  DATAMINE 2010»
14 years 9 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont