86 search results - page 8 / 18 » Pruning Improves Heuristic Search for Cost-Sensitive Learnin... |
ICDM
2003
IEEE
14 years 28 days ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
JMLR
2010
13 years 2 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
DATE
2007
IEEE
14 years 2 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Web spam detection has become one of the top challenges for the Internet search industry. Instead of using some heuristic rules, we propose a feature re-extraction strategy to opt...
IJCAI
2001
13 years 9 months ago
2001
This paper presents a new method for building domain-specific web search engines. Previous methods eliminate irrelevant documents from the pages accessed using heuristics based on...