Sciweavers

4930 search results - page 66 / 986
» Learning minimal abstractions
Sort
View
78
Voted
NIPS
2007
15 years 2 months ago
Bundle Methods for Machine Learning
We present a globally convergent method for regularized risk minimization problems. Our method applies to Support Vector estimation, regression, Gaussian Processes, and any other ...
Alex J. Smola, S. V. N. Vishwanathan, Quoc V. Le
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
15 years 6 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
ECCV
2010
Springer
15 years 1 months ago
Robust and Fast Collaborative Tracking with Two Stage Sparse Optimization
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
Baiyang Liu, Lin Yang, Junzhou Huang, Peter Meer, ...
TIT
2008
109views more  TIT 2008»
15 years 13 days ago
Statistical Analysis of Bayes Optimal Subset Ranking
Abstract--The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a for...
David Cossock, Tong Zhang
102
Voted
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
15 years 9 days ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...