7648 search results - page 18 / 1530 » A Data Locality Optimizing Algorithm |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
UAI
2003
14 years 11 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper considers a recently proposed method for unsupervised learning and dimensionality reduction, locally linear embedding (LLE). LLE computes a compact representation of hi...
NIPS
2007
14 years 11 months ago
2007
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...