Sciweavers

126 search results - page 21 / 26
» Improving heuristic mini-max search by supervised learning
Sort
View
ICMLA
2007
13 years 9 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira
CVPR
2008
IEEE
14 years 9 months ago
Semi-supervised distance metric learning for Collaborative Image Retrieval
Typical content-based image retrieval (CBIR) solutions with regular Euclidean metric usually cannot achieve satisfactory performance due to the semantic gap challenge. Hence, rele...
Steven C. H. Hoi, Wei Liu, Shih-Fu Chang
AAAI
2008
13 years 10 months ago
Markov Blanket Feature Selection for Support Vector Machines
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...
Jianqiang Shen, Lida Li, Weng-Keen Wong
CIKM
2009
Springer
14 years 2 months ago
Adaptive relevance feedback in information retrieval
Relevance Feedback has proven very effective for improving retrieval accuracy. A difficult yet important problem in all relevance feedback methods is how to optimally balance the...
Yuanhua Lv, ChengXiang Zhai
ML
2002
ACM
123views Machine Learning» more  ML 2002»
13 years 7 months ago
Feature Generation Using General Constructor Functions
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
Shaul Markovitch, Dan Rosenstein