33 search results - page 4 / 7 » Structured Sparsity with Group-Graph Regularization |
KDD
2009
ACM
14 years 4 months ago
2009
ACM
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
PKDD
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an 1-regularized linear regression prob...
ACL
2010
13 years 7 months ago
2010
Conditional Random Fields (CRFs) are a widely-used approach for supervised sequence labelling, notably due to their ability to handle large description spaces and to integrate str...