Sciweavers

648 search results - page 27 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
TWC
2010
13 years 2 months ago
Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting, considerable attention. While several criteria have be...
Virag Shah, Neelesh B. Mehta, Raymond Yim
JMLR
2010
104views more  JMLR 2010»
13 years 2 months ago
Increasing Feature Selection Accuracy for L1 Regularized Linear Models
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
Abhishek Jaiantilal, Gregory Z. Grudic
IWANN
2009
Springer
14 years 2 months ago
A Genetic Algorithm for ANN Design, Training and Simplification
This paper proposes a new evolutionary method for generating ANNs. In this method, a simple real-number string is used to codify both architecture and weights of the networks. Ther...
Daniel Rivero, Julian Dorado, Enrique Ferná...
SLSFS
2005
Springer
14 years 1 months ago
Random Projection, Margins, Kernels, and Feature-Selection
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...
Avrim Blum
ICML
2003
IEEE
14 years 8 months ago
Weighted Low-Rank Approximations
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
Nathan Srebro, Tommi Jaakkola