454 search results - page 50 / 91 » On improving approximate solutions by evolutionary algorithm... |
147
click to vote
ISCAS
2008
IEEE
15 years 8 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
101
click to vote
EVOW
2006
Springer
15 years 5 months ago
2006
Springer
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
133
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
108
click to vote
SIGMOD
1999
ACM
15 years 5 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
118
click to vote
ACL
2006
15 years 2 months ago
2006
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...