Demo Data from VLDB 2026 / reviewers in the wild / expert
Yuechen Shang
dblp:299/6091
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Representation and self-supervised learning · 100% | |
| Computer graphics and multimedia
1 paper |
Multimedia analysis and retrieval · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › matrix factorization
low-rank and sparse decomposition |
0.5 | 1 | 2021 | Learning Low-Rank Sparse Representations With Robust Relationship Inference for Image Memorability Prediction · IEEE Trans. Multim. 2021 |
Machine learning › Representation and self-supervised learning › representation learning › robust representation learning
robust feature learning |
0.5 | 1 | 2021 | Learning Low-Rank Sparse Representations With Robust Relationship Inference for Image Memorability Prediction · IEEE Trans. Multim. 2021 |
Multimedia analysis and retrieval › image analysis
image memorability prediction |
0.5 | 1 | 2021 | Learning Low-Rank Sparse Representations With Robust Relationship Inference for Image Memorability Prediction · IEEE Trans. Multim. 2021 |
Methods — techniques the papers use, named apart from their topics
sparse coding · 1.0relationship inference · 1.0low-rank optimization · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Learning Low-Rank Sparse Representations With Robust Relationship Inference for Image Memorability PredictionabstractImage memorability prediction aims to estimate the degree to which an image will be remembered by observers. Generally, the core problem in image memorability prediction is how to obtain effective representations to characterize the visual content of an image. In contrast to existing methods, which focus more on exploring the factors that make images memorable, in this paper, we first propose a general framework for learning joint low-rank and sparse principal feature representations, called the LSPFR framework, to obtain the lowest-rank intrinsic representation for image memorability prediction. By considering the joint optimization of the nuclear and$\ell _{1}$-norms, the global low-rank structure and the local patterns embedded in data can be exploited to make the learned features more robust and informative. To improve our framework based on the exploitation of sample relationship structure information, we present an extended version of LSPFR, named E-LSPFR, in which the underlying relationship structure matrix is inferred through a negative log-likelihood term with a sparsity constraint. The results of experiments conducted on four publicly available datasets confirm the superior performance of our proposed approaches. Peiguang Jing, Yuechen Shang, Liqiang Nie, Yuting Su 0001, Jing Liu 0002, Meng Wang 0001 |
IEEE Trans. Multim. | 2 |