Sciweavers

142 search results - page 18 / 29
» An Experimental Comparison of Symbolic and Connectionist Lea...
Sort
View
CVPR
2011
IEEE
14 years 9 months ago
A Non-convex Relaxation Approach to Sparse Dictionary Learning
Dictionary learning is a challenging theme in computer vision. The basic goal is to learn a sparse representation from an overcomplete basis set. Most existing approaches employ a...
Jianping Shi, Xiang Ren, Jingdong Wang, Guang Dai,...
ECAI
2006
Springer
15 years 9 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
SIGIR
2008
ACM
15 years 5 months ago
A study of learning a merge model for multilingual information retrieval
This paper proposes a learning approach for the merging process in multilingual information retrieval (MLIR). To conduct the learning approach, we also present a large number of f...
Ming-Feng Tsai, Yu-Ting Wang, Hsin-Hsi Chen
CEC
2009
IEEE
15 years 10 months ago
Parallel BMDA with an aggregation of probability models
—The paper is focused on the problem of aggregation of probability distribution applicable for parallel Bivariate Marginal Distribution Algorithm (pBMDA). A new approach based on...
Jirí Jaros, Josef Schwarz
IJCAI
2001
15 years 6 months ago
Adaptive Information Extraction from Text by Rule Induction and Generalisation
(LP)2 is a covering algorithm for adaptive Information Extraction from text (IE). It induces symbolic rules that insert SGML tags into texts by learning from examples found in a u...
Fabio Ciravegna