Sciweavers

4047 search results - page 227 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
GPEM
2002
95views more  GPEM 2002»
15 years 6 months ago
On Appropriate Adaptation Levels for the Learning of Gene Linkage
A number of algorithms have been proposed aimed at tackling the problem of learning "Gene Linkage" within the context of genetic optimisation, that is to say, the problem...
James Smith
ICPR
2008
IEEE
16 years 26 days ago
On the selection of base prototypes for LAESA and TLAESA classifiers
—The k nearest neighbor (k-NN) classifier has been extensively used as a nonparametric technique in Pattern Recognition. However, in some applications where the training set is l...
Selene Hernández-Rodríguez, Jos&eacu...
NIPS
2007
15 years 7 months ago
Consistent Minimization of Clustering Objective Functions
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
Ulrike von Luxburg, Sébastien Bubeck, Stefa...
CDC
2008
IEEE
206views Control Systems» more  CDC 2008»
16 years 27 days ago
Approximate dynamic programming using support vector regression
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
Brett Bethke, Jonathan P. How, Asuman E. Ozdaglar
CINQ
2004
Springer
182views Database» more  CINQ 2004»
15 years 10 months ago
Mining Constrained Graphs: The Case of Workflow Systems
Abstract. Constrained graphs are directed graphs describing the control flow of processes models. In such graphs, nodes represent activities involved in the process, and edges the ...
Gianluigi Greco, Antonella Guzzo, Giuseppe Manco, ...