Sciweavers

2884 search results - page 263 / 577
» Evaluating learning algorithms and classifiers
Sort
View
ML
2006
ACM
113views Machine Learning» more  ML 2006»
15 years 13 days ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
14 years 10 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
104
Voted
BMCBI
2005
134views more  BMCBI 2005»
15 years 11 days ago
Systematic feature evaluation for gene name recognition
In task 1A of the BioCreAtIvE evaluation, systems had to be devised that recognize words and phrases forming gene or protein names in natural language sentences. We approach this ...
Jörg Hakenberg, Steffen Bickel, Conrad Plake,...
106
Voted
CEC
2007
IEEE
15 years 4 months ago
A Simulated Evolution-Tabu search hybrid metaheuristic for routing in computer networks
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
Salman A. Khan, Zubair A. Baig
108
Voted
PR
2008
93views more  PR 2008»
15 years 13 days ago
Genetic algorithm-based feature set partitioning for classification problems
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a ...
Lior Rokach