1419 search results - page 148 / 284 » Approximation Methods for Supervised Learning |
103
click to vote
ICML
1996
IEEE
16 years 1 months ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
139
click to vote
EMNLP
2006
15 years 2 months ago
2006
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
70
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
116
Voted
PERVASIVE
2011
Springer
14 years 3 months ago
2011
Springer
We contribute a method for approximating users’ interruptibility costs to use for experience sampling and validate the method in an application that learns when to automatically ...
142
click to vote
ICDM
2010
IEEE
14 years 10 months ago
2010
IEEE
: D-LDA: A Topic Modeling Approach without Constraint Generation for Semi-Defined Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhongzhi Shi HP Labo...