Sciweavers

3143 search results - page 366 / 629
» Minimization of entropy functionals
Sort
View
COLT
2005
Springer
16 years 3 days ago
Learning Convex Combinations of Continuously Parameterized Basic Kernels
We study the problem of learning a kernel which minimizes a regularization error functional such as that used in regularization networks or support vector machines. We consider thi...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
GECCO
2005
Springer
197views Optimization» more  GECCO 2005»
16 years 3 days ago
Breeding swarms: a GA/PSO hybrid
Abstract. In this paper we propose a novel hybrid (GA/PSO) algorithm, Breeding Swarm, combining the strengths of particle swarm optimization with genetic algorithms. The hybrid alg...
Matthew Settles, Terence Soule
ICDT
2005
ACM
149views Database» more  ICDT 2005»
16 years 2 days ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
ICIC
2005
Springer
16 years 2 days ago
Methods of Decreasing the Number of Support Vectors via k-Mean Clustering
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...
Xiao-Lei Xia, Michael R. Lyu, Tat-Ming Lok, Guang-...
WEA
2005
Springer
105views Algorithms» more  WEA 2005»
16 years 1 days ago
Inferring AS Relationships: Dead End or Lively Beginning?
Recent techniques for inferring business relationships between ASs [3, 8] have yielded maps that have extremely few invalid BGP paths in the terminology of Gao [9]. However, some ...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, B...