Sciweavers

716 search results - page 131 / 144
» Optimizing Sorting with Machine Learning Algorithms
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 11 months ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari
MP
2011
14 years 6 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
ICML
2004
IEEE
16 years 15 days ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 5 months ago
Is negative selection appropriate for anomaly detection?
Negative selection algorithms for hamming and real-valued shape-spaces are reviewed. Problems are identified with the use of these shape-spaces, and the negative selection algori...
Thomas Stibor, Philipp H. Mohr, Jonathan Timmis, C...
97
Voted
IJBRA
2007
80views more  IJBRA 2007»
14 years 11 months ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip