Sciweavers

119 search results - page 11 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
CSDA
2007
114views more  CSDA 2007»
13 years 8 months ago
Relaxed Lasso
The Lasso is an attractive regularisation method for high dimensional regression. It combines variable selection with an efficient computational procedure. However, the rate of co...
Nicolai Meinshausen
TKDE
2012
270views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 9 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
ICML
2006
IEEE
14 years 9 months ago
Practical solutions to the problem of diagonal dominance in kernel document clustering
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...
Derek Greene, Padraig Cunningham
TNN
2010
176views Management» more  TNN 2010»
13 years 3 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao