Sciweavers

100 search results - page 17 / 20
» Learning distance function by coding similarity
Sort
View
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
14 years 1 months ago
Kernel based automatic clustering using modified particle swarm optimization algorithm
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
Ajith Abraham, Swagatam Das, Amit Konar
COLT
2010
Springer
13 years 5 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
ML
2010
ACM
119views Machine Learning» more  ML 2010»
13 years 6 months ago
A cooperative coevolutionary algorithm for instance selection for instance-based learning
This paper presents a cooperative evolutionary approach for the problem of instance selection for instance based learning. The presented model takes advantage of one of the most r...
Nicolás García-Pedrajas, Juan Antoni...
IEEEPACT
2008
IEEE
14 years 2 months ago
Feature selection and policy optimization for distributed instruction placement using reinforcement learning
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
Katherine E. Coons, Behnam Robatmili, Matthew E. T...
TNN
2008
106views more  TNN 2008»
13 years 7 months ago
Unsupervised Segmentation With Dynamical Units
In this paper, we present a novel network to separate mixtures of inputs that have been previously learned. A significant capability of the network is that it segments the componen...
A. Ravishankar Rao, Guillermo A. Cecchi, Charles C...