DeepAI AI Chat
Log In Sign Up

NNK-Means: Dictionary Learning using Non-Negative Kernel regression

by   Sarath Shekkizhar, et al.
University of Southern California

An increasing number of systems are being designed by first gathering significant amounts of data, and then optimizing the system parameters directly using the obtained data. Often this is done without analyzing the dataset structure. As task complexity, data size, and parameters all increase to millions or even billions, data summarization is becoming a major challenge. In this work, we investigate data summarization via dictionary learning, leveraging the properties of recently introduced non-negative kernel regression (NNK) graphs. Our proposed NNK-Means, unlike competing techniques, such askSVD, learns geometric dictionaries with atoms that lie in the input data space. Experiments show that summaries using NNK-Meanscan provide better discrimination compared to linear and kernel versions of kMeans and kSVD. Moreover, NNK-Means has a scalable implementation, with runtime complexity similar to that of kMeans.


Study of Manifold Geometry using Multiscale Non-Negative Kernel Graphs

Modern machine learning systems are increasingly trained on large amount...

Non-negative representation based discriminative dictionary learning for face recognition

In this paper, we propose a non-negative representation based discrimina...

Kernelized Supervised Dictionary Learning

In this paper, we propose supervised dictionary learning (SDL) by incorp...

Non-negative Tensor Patch Dictionary Approaches for Image Compression and Deblurring Applications

In recent work (Soltani, Kilmer, Hansen, BIT 2016), an algorithm for non...

Compressed Dictionary Learning

In this paper we show that the computational complexity of the Iterative...

Graph Construction from Data using Non Negative Kernel regression (NNK Graphs)

Data driven graph constructions are often used in various applications, ...