A review of sparsity-based clustering methods

This publication has 82 references indexed in Scilit:

• Large margin classifiers based on affine hulls
  Neurocomputing, 2010
• Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
  BMC Bioinformatics, 2010
• Compression of facial images using the K-SVD algorithm
  Journal of Visual Communication and Image Representation, 2008
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
  IEEE Transactions on Signal Processing, 2006
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
  Communications on Pure and Applied Mathematics, 2006
• Support-vector networks
  Machine Learning, 1995
• Matching pursuits with time-frequency dictionaries
  IEEE Transactions on Signal Processing, 1993
• Symbolic clustering using a new dissimilarity measure
  Pattern Recognition, 1991
• Distance transformations in digital images
  Computer Vision, Graphics, and Image Processing, 1986
• The perceptron: A probabilistic model for information storage and organization in the brain.
  Psychological Review, 1958