Robust sparse coding via self-paced learning for data representation

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 2021 English Publisher:Elsevier BVJournal:Information Sciences, volume 546, pages 448-468 (issn: 0020-0255,

Copyright policy )

Authors: Xiaodong Feng 0001; Sen Wu 0001;

doi: 10.1016/j.ins.2020.08.097

Robust sparse coding via self-paced learning for data representation

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Beijing University of Technology
China (People's Republic of)
University of Electronic Science and Technology of China
China (People's Republic of)

Keywords

non-convex optimization, sparse coding, Learning and adaptive systems in artificial intelligence, noisy corruption, data representation, self-paced learning, Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science), Nonconvex programming, global optimization

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%