Sciweavers

577 search results - page 25 / 116
» New interval methods for constrained global optimization
Sort
View
178
Voted
ICMLA
2004
15 years 5 months ago
A new discrete binary particle swarm optimization based on learning automata
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
Reza Rastegar, Mohammad Reza Meybodi, Kambiz Badie
141
Voted
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
15 years 10 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
159
Voted
MICCAI
2005
Springer
16 years 4 months ago
Tissue Classification of Noisy MR Brain Images Using Constrained GMM
We present an automated algorithm for tissue segmentation of noisy, low contrast magnetic resonance (MR) images of the brain. We use a mixture model composed of a large number of G...
Amit Ruf, Hayit Greenspan, Jacob Goldberger
126
Voted
ISCAS
2005
IEEE
114views Hardware» more  ISCAS 2005»
15 years 9 months ago
Structured stochastic optimization strategies for problems with ill-conditioned error surfaces
—This paper compares the performance of several structured optimization strategies in adaptive signal processing problems that are characterized by ill-conditioned error surfaces...
S. Pal, Dean J. Krusienski, W. Kenneth Jenkins
156
Voted
BMCBI
2011
14 years 7 months ago
Elastic SCAD as a novel penalization method for SVM classification tasks in high-dimensional data
Background: Classification and variable selection play an important role in knowledge discovery in highdimensional data. Although Support Vector Machine (SVM) algorithms are among...
Natalia Becker, Grischa Toedt, Peter Lichter, Axel...