Sciweavers

236 search results - page 16 / 48
» Learning Teleoreactive Logic Programs from Problem Solving
Sort
View
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 9 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye
JMLR
2012
11 years 9 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
SWAP
2008
13 years 8 months ago
Learning SHIQ+log Rules for Ontology Evolution
The definition of new concepts or roles for which extensional knowledge become available can turn out to be necessary to make a DL ontology evolve. In this paper we reformulate thi...
Francesca A. Lisi, Floriana Esposito
JIIS
2008
89views more  JIIS 2008»
13 years 7 months ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag
ICML
1998
IEEE
14 years 8 months ago
Genetic Programming and Deductive-Inductive Learning: A Multi-Strategy Approach
Genetic Programming (GP) is a machine learning technique that was not conceived to use domain knowledge for generating new candidate solutions. It has been shown that GP can bene ...
Ricardo Aler, Daniel Borrajo, Pedro Isasi