Deep Dictionary Learning
نویسندگان
چکیده
منابع مشابه
Greedy Deep Dictionary Learning
—In this work we propose a new deep learning tool – deep dictionary learning. Multi-level dictionaries are learnt in a greedy fashion – one layer at a time. This requires solving a simple (shallow) dictionary learning problem; the solution to this is well known. We apply the proposed technique on some benchmark deep learning datasets. We compare our results with other deep learning tools like s...
متن کاملDeep Dictionary Learning: A PARametric NETwork Approach
Deep dictionary learning seeks multiple dictionaries at different image scales to capture complementary coherent characteristics. We propose a method for learning a hierarchy of synthesis dictionaries with an image classification goal. The dictionaries and classification parameters are trained by a classification objective, and the sparse features are extracted by reducing a reconstruction loss...
متن کاملData Cleaning by Deep Dictionary Learning
The soundness of training data is important to the performance of a learning model. However in recommender systems, the training data are usually noisy, because of the randomness nature of users’ behaviors and the sparseness of the users’ feedback towards the recommendations. In this work, we would like to propose a noise elimination model to preprocess the training data in recommender systems....
متن کاملDeep Learning from Web-Scale Corpora for Better Dictionary Interfaces
This paper explores advanced learning mechanisms – neural networks trained by the Word2Vec method – for predicting word associations. We discuss how the approach can be built into dictionary interfaces to help tip-of-the-tongue searches. We also describe our contribution to the CogALex 2014 shared task. We argue that the reverse response-stimulus word associations chosen for the shared task are...
متن کاملTensor-Dictionary Learning with Deep Kruskal-Factor Analysis
A multi-way factor analysis model is introduced for tensor-variate data of any order. Each data item is represented as a (sparse) sum of Kruskal decompositions, a Kruskalfactor analysis (KFA). KFA is nonparametric and can infer both the tensor-rank of each dictionary atom and the number of dictionary atoms. The model is adapted for online learning, which allows dictionary learning on large data...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2016
ISSN: 2169-3536
DOI: 10.1109/access.2016.2611583