Towards understanding sparse filtering: a theoretical perspective
From MaRDI portal
Publication:2179299
DOI10.1016/j.neunet.2017.11.010zbMath1434.68483arXiv1603.08831OpenAlexW2328604275WikidataQ47323844 ScholiaQ47323844MaRDI QIDQ2179299
Publication date: 12 May 2020
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.08831
soft clusteringinformation preservationcosine metricfeature distribution learningintrinsic structuresparse filtering
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Information geometry and its applications
- Atomic Decomposition by Basis Pursuit
- Sparse and Redundant Representations
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Matching pursuits with time-frequency dictionaries
- Comparing Measures of Sparsity
- Information Theoretic Learning
- A Fast Learning Algorithm for Deep Belief Nets