Sciweavers

62 search results - page 5 / 13
» Convergence analysis of convex incremental neural networks
Sort
View
ICANN
2005
Springer
14 years 1 months ago
The LCCP for Optimizing Kernel Parameters for SVM
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
Sabri Boughorbel, Jean-Philippe Tarel, Nozha Bouje...
ICASSP
2011
IEEE
12 years 11 months ago
Performance limits of LMS-based adaptive networks
In this work we analyze the mean-square performance of different strategies for adaptation over two-node least-mean-squares (LMS) networks. The results highlight some interesting ...
Xiaochuan Zhao, Ali H. Sayed
CISS
2008
IEEE
14 years 1 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
IJCNN
2006
IEEE
14 years 1 months ago
A Columnar Competitive Model with Simulated Annealing for Solving Combinatorial Optimization Problems
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
Eu Jin Teoh, Huajin Tang, Kay Chen Tan
ESWA
2008
119views more  ESWA 2008»
13 years 7 months ago
Incremental clustering of mixed data based on distance hierarchy
Clustering is an important function in data mining. Its typical application includes the analysis of consumer's materials. Adaptive resonance theory network (ART) is very pop...
Chung-Chian Hsu, Yan-Ping Huang