Sciweavers

1839 search results - page 242 / 368
» Feature Selection in Clustering Problems
Sort
View
COMPSAC
2005
IEEE
14 years 3 months ago
Recovering "Lack of Words" in Text Categorization for Item Banks
PKIP, Patterned Keywords in Phrase, is our feature selection approach to text categorization (TC) for item banks. An item bank is a collection of textual data in which each item c...
Atorn Nuntiyagul, Nick Cercone, Kanlaya Naruedomku...
FPL
1997
Springer
242views Hardware» more  FPL 1997»
14 years 2 months ago
Technology mapping by binate covering
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
Michal Servít, Kang Yi
SIROCCO
2010
13 years 11 months ago
On the Impact of Local Taxes in a Set Cover Game
Given a collection C of weighted subsets of a ground set E, the set cover problem is to find a minimum weight subset of C which covers all elements of E. We study a strategic game ...
Bruno Escoffier, Laurent Gourvès, Jé...
NIPS
2008
13 years 11 months ago
An interior-point stochastic approximation method and an L1-regularized delta rule
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Peter Carbonetto, Mark Schmidt, Nando de Freitas
IJON
2007
134views more  IJON 2007»
13 years 10 months ago
Analysis of SVM regression bounds for variable ranking
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
Alain Rakotomamonjy