Sciweavers

37 search results - page 4 / 8
» Steplength selection in interior-point methods for quadratic...
Sort
View
ICDM
2003
IEEE
91views Data Mining» more  ICDM 2003»
13 years 11 months ago
MPIS: Maximal-Profit Item Selection with Cross-Selling Considerations
In the literature of data mining, many different algorithms for association rule mining have been proposed. However, there is relatively little study on how association rules can ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Ke Wang
JMLR
2006
89views more  JMLR 2006»
13 years 6 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel
NIPS
2003
13 years 7 months ago
Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
Claudio Gentile
JMLR
2006
145views more  JMLR 2006»
13 years 6 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
ICML
2007
IEEE
14 years 7 months ago
Multiclass multiple kernel learning
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kern...
Alexander Zien, Cheng Soon Ong