Simplicity of Kmeans Versus Deepness of Deep Learning: A Case of Unsupervised Feature Learning with Limited Data
暂无分享,去创建一个
Murat Dundar | Qiang Kou | Baichuan Zhang | Yicheng He | Bartek Rajwa | Bartek Rajwa | M. Dundar | Qiang Kou | Yicheng He | Baichuan Zhang
[1] Xiaoyang Tan,et al. C-SVDDNet: An Effective Single-Layer Network for Unsupervised Feature Learning , 2014, ArXiv.
[2] Honglak Lee,et al. An Analysis of Single-Layer Networks in Unsupervised Feature Learning , 2011, AISTATS.
[3] Robert M. Haralick,et al. Textural Features for Image Classification , 1973, IEEE Trans. Syst. Man Cybern..
[4] Rajat Raina,et al. Efficient sparse coding algorithms , 2006, NIPS.
[5] Simon Haykin,et al. GradientBased Learning Applied to Document Recognition , 2001 .
[6] Martin A. Riedmiller,et al. On the Applicability of Unsupervised Feature Learning for Object Recognition in RGB-D Data , 2011 .
[7] Andrew Y. Ng,et al. Learning Feature Representations with K-Means , 2012, Neural Networks: Tricks of the Trade.
[8] Alireza Khotanzad,et al. Invariant Image Recognition by Zernike Moments , 1990, IEEE Trans. Pattern Anal. Mach. Intell..
[9] J. Paul Robinson,et al. Feature extraction from light-scatter patterns of Listeria colonies for identification and classification. , 2006, Journal of biomedical optics.
[10] Shai Shalev-Shwartz,et al. K-means recovers ICA filters when independent components are sparse , 2014, ICML.
[11] Yoshua Bengio,et al. Extracting and composing robust features with denoising autoencoders , 2008, ICML '08.
[12] Nitish Srivastava,et al. Dropout: a simple way to prevent neural networks from overfitting , 2014, J. Mach. Learn. Res..
[13] Chih-Jen Lin,et al. LIBLINEAR: A Library for Large Linear Classification , 2008, J. Mach. Learn. Res..