Sciweavers

1214 search results - page 111 / 243
» Labeling Points with Weights
Sort
View
91
Voted
ISNN
2007
Springer
15 years 7 months ago
Neural Networks Training with Optimal Bounded Ellipsoid Algorithm
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...
José de Jesús Rubio, Wen Yu
94
Voted
ICDM
2005
IEEE
117views Data Mining» more  ICDM 2005»
15 years 6 months ago
On Learning Asymmetric Dissimilarity Measures
Many practical applications require that distance measures to be asymmetric and context-sensitive. We introduce Context-sensitive Learnable Asymmetric Dissimilarity (CLAD) measure...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
109
Voted
COLT
2005
Springer
15 years 6 months ago
From Graphs to Manifolds - Weak and Strong Pointwise Consistency of Graph Laplacians
In the machine learning community it is generally believed that graph Laplacians corresponding to a finite sample of data points converge to a continuous Laplace operator if the s...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
EUROGP
1999
Springer
166views Optimization» more  EUROGP 1999»
15 years 5 months ago
Adapting the Fitness Function in GP for Data Mining
In this paper we describe how the Stepwise Adaptation of Weights (saw) technique can be applied in genetic programming. The saw-ing mechanism has been originally developed for and ...
Jeroen Eggermont, A. E. Eiben, Jano I. van Hemert
FPL
2004
Springer
115views Hardware» more  FPL 2004»
15 years 4 months ago
Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices
We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of...
Ali Ahmadinia, Christophe Bobda, Sándor P. ...