Sciweavers

2842 search results - page 352 / 569
» Expansion and Search in Networks
Sort
View
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
16 years 1 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
IJCNN
2007
IEEE
16 years 1 months ago
Distance-based Disagreement Classifiers Combination
— We present a methodology to analyze Multiple Classifiers Systems (MCS) performance, using the diversity concept. The goal is to define an alternative approach to the convention...
Cinthia Obladen de Almendra Freitas, João M...
IJCNN
2007
IEEE
16 years 1 months ago
Evaluation of Performance Measures for SVR Hyperparameter Selection
— To obtain accurate modeling results, it is of primal importance to find optimal values for the hyperparameters in the Support Vector Regression (SVR) model. In general, we sea...
Koen Smets, Brigitte Verdonk, Elsa Jordaan
ICANN
2007
Springer
16 years 1 months ago
Selection of Basis Functions Guided by the L2 Soft Margin
Support Vector Machines (SVMs) for classification tasks produce sparse models by maximizing the margin. Two limitations of this technique are considered in this work: firstly, th...
Ignacio Barrio, Enrique Romero, Lluís Belan...
SEMWEB
2007
Springer
16 years 28 days ago
SALT: Weaving the Claim Web
In this paper we present a solution for “weaving the claim web”, i.e. the creation of knowledge networks via so-called claims stated in scientific publications created with th...
Tudor Groza, Knud Möller, Siegfried Handschuh...