Image Memorability Prediction Model Based on Low-Rank Representation Learning

2018 ◽  
Vol 55 (7) ◽  
pp. 071002
Author(s):  
褚晶辉 Chu Jinghui ◽  
顾慧敏 Gu Huimin ◽  
苏育挺 Su Yuting
2018 ◽  
Vol 27 (1) ◽  
pp. 335-348 ◽  
Author(s):  
Bo Li ◽  
Risheng Liu ◽  
Junjie Cao ◽  
Jie Zhang ◽  
Yu-Kun Lai ◽  
...  

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Gui Yuan ◽  
Shali Huang ◽  
Jing Fu ◽  
Xinwei Jiang

Purpose This study aims to assess the default risk of borrowers in peer-to-peer (P2P) online lending platforms. The authors propose a novel default risk classification model based on data cleaning and feature extraction, which increases risk assessment accuracy. Design/methodology/approach The authors use borrower data from the Lending Club and propose the risk assessment model based on low-rank representation (LRR) and discriminant analysis. Firstly, the authors use three LRR models to clean the high-dimensional borrower data by removing outliers and noise, and then the authors adopt a discriminant analysis algorithm to reduce the dimension of the cleaned data. In the dimension-reduced feature space, machine learning classifiers including the k-nearest neighbour, support vector machine and artificial neural network are used to assess and classify default risks. Findings The results reveal significant noise and redundancy in the borrower data. LRR models can effectively clean such data, particularly the two LRR models with local manifold regularisation. In addition, the supervised discriminant analysis model, termed the local Fisher discriminant analysis model, can extract low-dimensional and discriminative features, which further increases the accuracy of the final risk assessment models. Originality/value The originality of this study is that it proposes a novel default risk assessment model, based on data cleaning and feature extraction, for P2P online lending platforms. The proposed approach is innovative and efficient in the P2P online lending field.


2020 ◽  
Vol 57 (22) ◽  
pp. 221012
Author(s):  
吕卫 Lü Wei ◽  
李德盛 Li Desheng ◽  
谭浪 Tan Lang ◽  
井佩光 Jing Peiguang ◽  
苏育挺 Su Yuting

Author(s):  
Zhao Zhang ◽  
Jiahuan Ren ◽  
Haijun Zhang ◽  
Zheng Zhang ◽  
Guangcan Liu ◽  
...  

Low-rank coding-based representation learning is powerful for discovering and recovering the subspace structures in data, which has obtained an impressive performance; however, it still cannot obtain deep hidden information due to the essence of single-layer structures. In this article, we investigate the deep low-rank representation of images in a progressive way by presenting a novel strategy that can extend existing single-layer latent low-rank models into multiple layers. Technically, we propose a new progressive Deep Latent Low-Rank Fusion Network (DLRF-Net) to uncover deep features and the clustering structures embedded in latent subspaces. The basic idea of DLRF-Net is to progressively refine the principal and salient features in each layer from previous layers by fusing the clustering and projective subspaces, respectively, which can potentially learn more accurate features and subspaces. To obtain deep hidden information, DLRF-Net inputs shallow features from the last layer into subsequent layers. Then, it aims at recovering the hierarchical information and deeper features by respectively congregating the subspaces in each layer of the network. As such, one can also ensure the representation learning of deeper layers to remove the noise and discover the underlying clean subspaces, which will be verified by simulations. It is noteworthy that the framework of our DLRF-Net is general and is applicable to most existing latent low-rank representation models, i.e., existing latent low-rank models can be easily extended to the multilayer scenario using DLRF-Net. Extensive results on real databases show that our framework can deliver enhanced performance over other related techniques.


2014 ◽  
Vol 7 (1) ◽  
pp. 107
Author(s):  
Ilyes Elaissi ◽  
Okba Taouali ◽  
Messaoud Hassani

Sign in / Sign up

Export Citation Format

Share Document