Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations 论文

2011IEEE Transactions on Information Theory引用 250

Sparse and Compressive Sensing TechniquesMachine Learning and AlgorithmsBlind Source Separation Techniques

人工智能 Machine Learning and Algorithms Blind Source Separation Techniques Sparse and Compressive Sensing Techniques

作者

摘要

Given a large number of basis functions that can be potentially more than the number of samples, we consider the problem of learning a sparse target function that can be expressed as a linear combination of a small number of these basis functions. We are interested in two closely related themes: <orderedlist continuation="restarts" numeration="bullet" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <listitem><para>feature selection, or identifying the basis functions with nonzero coefficients;</para></listitem></orderedlist>

作者

暂无数据

Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations 论文

详细信息

摘要

作者

相关技术查看全部 (1)

相关事件

相关文章