Sciweavers

3050 search results - page 369 / 610
» On-line Algorithms in Machine Learning
Sort
View
ICML
2007
IEEE
16 years 6 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
2006
IEEE
16 years 6 months ago
Spectral clustering for multi-type relational data
Clustering on multi-type relational data has attracted more and more attention in recent years due to its high impact on various important applications, such as Web mining, e-comm...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
ICML
2006
IEEE
16 years 6 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
ICML
2003
IEEE
16 years 6 months ago
SimpleSVM
We present a fast iterative support vector training algorithm for a large variety of different formulations. It works by incrementally changing a candidate support vector set usin...
S. V. N. Vishwanathan, Alex J. Smola, M. Narasimha...
ALT
2008
Springer
16 years 3 months ago
Entropy Regularized LPBoost
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
Manfred K. Warmuth, Karen A. Glocer, S. V. N. Vish...