Multiple-Kernel Dictionary Learning for Reconstruction and Clustering of Unseen Multivariate Time-series
There exist many approaches for description and recognition of unseen classes in datasets. Nevertheless, it becomes a challenging problem when we deal with multivariate time-series (MTS) (e.g., motion data), where we cannot apply the vectorial algorithms directly to the inputs. In this work, we propose a novel multiple-kernel dictionary learning (MKD) which learns semantic attributes based on specific combinations of MTS dimensions in the feature space. Hence, MKD can fully/partially reconstructs the unseen classes based on the training data (seen classes). Furthermore, we obtain sparse encodings for unseen classes based on the learned MKD attributes, and upon which we propose a simple but effective incremental clustering algorithm to categorize the unseen MTS classes in an unsupervised way. According to the empirical evaluation of our MKD framework on real benchmarks, it provides an interpretable reconstruction of unseen MTS data as well as a high performance regarding their online clustering.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDictionary LearningOnline ClusteringTime SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
PET Image Reconstruction with Multiple Kernels and Multiple Kernel Space Regularizers
Kernelized maximum-likelihood (ML) expectation maximization (EM) methods have recently gained prominence in PET image reconstruction, outperforming many previous state-of-the-art methods. But they are not immune to the p…
Dictionary LearningImage ReconstructionSensitivityMultiple Kernel Sparse Representations for Supervised and Unsupervised Learning
In complex visual recognition tasks it is typical to adopt multiple descriptors, that describe different aspects of the images, for obtaining an improved recognition performance. Descriptors that have diverse forms can b…
ClusteringDictionary LearningGraph EmbeddingImage Clustering+1Replicating Kernels with a Short Stride Allows Sparse Reconstructions with Fewer Independent Kernels
In sparse coding it is common to tile an image into nonoverlapping patches, and then use a dictionary to create a sparse representation of each tile independently. In this situation, the overcompleteness of the dictionar…
Robust Non-Linear Matrix Factorization for Dictionary Learning, Denoising, and Clustering
Low dimensional nonlinear structure abounds in datasets across computer vision and machine learning. Kernelized matrix factorization techniques have recently been proposed to learn these nonlinear structures for denoisin…
ClusteringDenoisingDictionary LearningImputationDistributed Adaptive Sampling for Kernel Matrix Approximation
Most kernel-based methods, such as kernel or Gaussian process regression, kernel PCA, ICA, or $k$-means clustering, do not scale to large datasets, because constructing and storing the kernel matrix $\mathbf{K}_n$ requir…
Clustering