A Sparse Coding Based Similarity Measure
暂无分享,去创建一个
[1] D. Donoho. For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution , 2006 .
[2] Frédéric Ferraty,et al. Nonparametric Functional Data Analysis: Theory and Practice (Springer Series in Statistics) , 2006 .
[3] D. Donoho,et al. Counting faces of randomly-projected polytopes when the projection radically lowers dimension , 2006, math/0607364.
[4] Graham J. Williams,et al. Data Mining , 2000, Communications in Computer and Information Science.
[5] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[6] Trevor Hastie,et al. The Elements of Statistical Learning , 2001 .
[7] Yoshua Bengio,et al. Pattern Recognition and Neural Networks , 1995 .
[8] Robert D. Nowak,et al. Compressive Sampling for Signal Detection , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.
[9] B. Silverman,et al. Functional Data Analysis , 1997 .
[10] Stephen P. Boyd,et al. Graph Implementations for Nonsmooth Convex Programs , 2008, Recent Advances in Learning and Control.
[11] Allen Y. Yang,et al. Robust Face Recognition via Sparse Representation , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] J. Haupt,et al. Compressive Sampling for Signal Classification , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.
[13] Karl Rihaczek,et al. 1. WHAT IS DATA MINING? , 2019, Data Mining for the Social Sciences.
[14] Allen Y. Yang,et al. Feature Selection in Face Recognition: A Sparse Representation Perspective , 2007 .
[15] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..