Sciweavers

743 search results - page 37 / 149
» Solving the Multiple-Instance Problem: A Lazy Learning Appro...
Sort
View
AAAI
2011
12 years 8 months ago
A Feasible Nonconvex Relaxation Approach to Feature Selection
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
Cuixia Gao, Naiyan Wang, Qi Yu, Zhihua Zhang
NIPS
2007
13 years 10 months ago
Multi-Task Learning via Conic Programming
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama, ...
ICDM
2005
IEEE
134views Data Mining» more  ICDM 2005»
14 years 2 months ago
A Preference Model for Structured Supervised Learning Tasks
The preference model introduced in this paper gives a natural framework and a principled solution for a broad class of supervised learning problems with structured predictions, su...
Fabio Aiolli
APIN
2008
108views more  APIN 2008»
13 years 9 months ago
Achieving self-healing in service delivery software systems by means of case-based reasoning
Abstract Self-healing, i.e. the capability of a system to autonomously detect failures and recover from them, is a very attractive property that may enable large-scale software sys...
Stefania Montani, Cosimo Anglano
TNN
2010
171views Management» more  TNN 2010»
13 years 3 months ago
Sensitivity versus accuracy in multiclass problems using memetic Pareto evolutionary neural networks
This paper proposes a multiclassification algorithm using multilayer perceptron neural network models. It tries to boost two conflicting main objectives of multiclassifiers: a high...
Juan Carlos Fernández Caballero, Francisco ...