220 search results - page 2 / 44 » SMOS L1 algorithms |
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
The least mean squares (LMS) algorithm is one of the most popular recursive parameter estimation methods. In its standard form it does not take into account any special characteri...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
JMLR
2010
13 years 1 days ago
2010
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...