Volume 11, Issue 2 (4-2019)                   IJICTR 2019, 11(2): 29-37 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Farajian N, Adibi P. Sparse, Robust and Discriminative Representation by Supervised Regularized Auto-encoder. IJICTR. 2019; 11 (2) :29-37
URL: http://ijict.itrc.ac.ir/article-1-304-en.html
1- PHD Candidate Department of Computer Engineering, Faculty of Computer and Electrical Engineering University of Kashan
2- Artificial Intelligence Department, Computer Engineering Faculty University of Isfahan Isfahan, Iran , adibi@eng.ui.ac.ir
Abstract:   (405 Views)
Recent researches have determined that regularized auto-encoders can provide a good representation of data which improves the performance of data classification. These type of auto-encoders which are usually over-complete, provide a representation of data that has some degree of sparsity and is robust against variation of data to extract meaningful information and reveal the underlying structure of data by making a change in classic auto- encoders’ structure and/or adding regularizing terms to the objective function. The present study aimed to propose a novel approach to generate sparse, robust, and discriminative features through supervised regularized auto-encoders, in which unlike most existing auto-encoders, the data labels are used during feature extraction to improve discrimination of the representation and also, the sparsity ratio of the representation is completely adaptive and dynamically determined based on data distribution and complexity. Results reveal that this method has better performance in comparison to other regularized auto-encoders regarding data classification. 
Full-Text [PDF 1136 kb]   (192 Downloads)    
Type of Study: Research | Subject: Information Technology

Add your comments about this article : Your username or Email:
CAPTCHA code

Send email to the article author