Sciweavers

683 search results - page 108 / 137
» Generalization Bounds for Learning Kernels
Sort
View
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient and Numerically Stable Sparse Learning
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
Sihong Xie, Wei Fan, Olivier Verscheure, Jiangtao ...
PR
2011
12 years 10 months ago
A novel multi-view learning developed from single-view patterns
The existing Multi-View Learning (MVL) learns how to process patterns with multiple information sources. In generalization this MVL is proven to have a significant advantage over...
Zhe Wang, Songcan Chen, Daqi Gao
ICML
2007
IEEE
14 years 8 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
14 years 7 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo
JMLR
2010
112views more  JMLR 2010»
13 years 2 months ago
Reduced-Rank Hidden Markov Models
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon