Sciweavers

3378 search results - page 411 / 676
» Learning in Friedberg Numberings
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Scalable training of L1-regularized log-linear models
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...
Galen Andrew, Jianfeng Gao
ICML
2007
IEEE
16 years 7 months ago
Cluster analysis of heterogeneous rank data
Cluster analysis of ranking data, which occurs in consumer questionnaires, voting forms or other inquiries of preferences, attempts to identify typical groups of rank choices. Emp...
Ludwig M. Busse, Peter Orbanz, Joachim M. Buhmann
ICML
2007
IEEE
16 years 7 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
ICML
2007
IEEE
16 years 7 months ago
A novel orthogonal NMF-based belief compression for POMDPs
High dimensionality of POMDP's belief state space is one major cause that makes the underlying optimal policy computation intractable. Belief compression refers to the method...
Xin Li, William Kwok-Wai Cheung, Jiming Liu, Zhili...
ICML
2007
IEEE
16 years 7 months ago
Asymmetric boosting
A cost-sensitive extension of boosting, denoted as asymmetric boosting, is presented. Unlike previous proposals, the new algorithm is derived from sound decision-theoretic princip...
Hamed Masnadi-Shirazi, Nuno Vasconcelos