Sciweavers

2183 search results - page 119 / 437
» On Combining Dissimilarity Representations
Sort
View
ILP
2000
Springer
13 years 12 months ago
Searching the Subsumption Lattice by a Genetic Algorithm
A framework for combining Genetic Algorithms with ILP methods is introduced and a novel binary representation and relevant genetic operators are discussed. It is shown that the pro...
Alireza Tamaddoni-Nezhad, Stephen Muggleton
UAI
2004
13 years 9 months ago
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space
The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with con...
Rina Dechter, Robert Mateescu
ENTCS
2008
91views more  ENTCS 2008»
13 years 8 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
JMLR
2008
117views more  JMLR 2008»
13 years 8 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
JMLR
2010
137views more  JMLR 2010»
13 years 3 months ago
HOP-MAP: Efficient Message Passing with High Order Potentials
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
Daniel Tarlow, Inmar Givoni, Richard S. Zemel