Name
Abstract | ||
|---|---|---|
The articles in this special section focus on learning adaptive models. Over the past few years, sparsity has become one of the most widely used and successful forms of regularization for learning adaptive representations for descriptive and discriminative tasks. One of the most prominent and successful forms of regularization is based on the sparsity prior, which promotes solutions that can be expressed as a linear combination of only a few atoms belonging to a dictionary. Sparsity has become one of the leading approaches for learning adaptive representations for both descriptive and discriminative tasks, and has been shown to be particularly effective when dealing with structured, complex and high-dimensional data, in numerous fields including statistics, signal processing and computational intelligence. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/MCI.2016.2602071 | IEEE Comp. Int. Mag. |
Keywords | Field | DocType |
Special issues and sections,Sparse matrices,Machine learning,Computational complexity,Adaptation models | Linear combination,Signal processing,Computational intelligence,Computer science,Regularization (mathematics),Artificial intelligence,Discriminative model,Sparse matrix,Machine learning,Model complexity,Computational complexity theory | Journal |
Volume | Issue | ISSN |
11 | 4 | 1556-603X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cesare Alippi | 1 | 1040 | 115.84 |
| Giacomo Boracchi | 2 | 324 | 30.49 |
| Brendt Wohlberg | 3 | 685 | 55.53 |