Sciweavers

1419 search results - page 232 / 284
» Approximation Methods for Supervised Learning
Sort
View
NIPS
2008
13 years 11 months ago
Global Ranking Using Continuous Conditional Random Fields
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...
Tao Qin, Tie-Yan Liu, Xu-Dong Zhang, De-Sheng Wang...
CORR
2010
Springer
275views Education» more  CORR 2010»
13 years 10 months ago
Dictionary Optimization for Block-Sparse Representations
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
TSP
2010
13 years 4 months ago
Gaussian multiresolution models: exploiting sparse Markov and covariance structure
We consider the problem of learning Gaussian multiresolution (MR) models in which data are only available at the finest scale and the coarser, hidden variables serve both to captu...
Myung Jin Choi, Venkat Chandrasekaran, Alan S. Wil...
SDM
2008
SIAM
130views Data Mining» more  SDM 2008»
13 years 11 months ago
Mining Sequence Classifiers for Early Prediction
Supervised learning on sequence data, also known as sequence classification, has been well recognized as an important data mining task with many significant applications. Since te...
Zhengzheng Xing, Jian Pei, Guozhu Dong, Philip S. ...
BMCBI
2005
161views more  BMCBI 2005»
13 years 9 months ago
Non-linear mapping for exploratory data analysis in functional genomics
Background: Several supervised and unsupervised learning tools are available to classify functional genomics data. However, relatively less attention has been given to exploratory...
Francisco Azuaje, Haiying Wang, Alban Chesneau