Reproducible Research in Machine Learning
Low rank methods
- Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm L1LR code
- Low-rank matrix recovery and completion via convex optimization
- Predictive low-rank decomposition for kernel methods
- Improved Nyström low-rank approximation for scalable manifold learning
- RASL: robust batch alignment of images by sparse and low-rank decomposition
- TILT: rransform invariant low-rank textures
- Nonlocal sparsity regularized image restoration: a low-rank approach NSRIR code
- Bayesian robust matrix factorization for image and video processing
- Motion saliency detection using low-rank and sparse decomposition MotionSaliency code
- Low-rank modeling and its applications in image analysis
- Moving object detection by detecting contiguous outliers in the low-rank representation
Deep Learning
- DeepLearnToolbox
- Deep Belief Networks
- Convolutional Deep Belief Network
- Learning Deep Boltzmann Machines
- Conditional RBMs/DBNs
- Neocognitron
- Convolutional/deconvolutional networks
- Invariant scattering convolution network
- Marginalized stacked denoising autoencoders
- joint deep learning for pedestrian detection
- Pedestrian parsing via deep decompositional neural network
- Deep learning identity preserving face space
- Deep convolutional network cascade for facial point detection
Manifold learning and embedding
- A global geometric framework for nonlinear dimensionality reduction IsoMap code
- Nonlinear dimensionality reduction by locally linear embedding LLE code
- Laplacian eigenmaps LaplacianEigenmaps code
- Diffusion maps DiffMap code
- Manifold learning toolbox & demo
- Learning distance metric
- Diffusion processes for retrieval
Data Clustering
- Unsupervised learning of finite mixture models FMM code
- Affinity propagation
- On spectral clustering: Analysis and an algorithm SpecCluster code SpecCluster code2 SpecCluster code3
- Nonnegative matrix factorization NMF code2 NMF code3
- Computing nonnegative tensor factorizations
- Fast kmeans via triangle inequality
- FastANN and FastCluster for approximate kmeans
- kdtree-based NN/kNN search fast kNN search FastkNN code2
- RANSAC toolbox for robust fitting
- Clustering through ranking On manifolds RoM code
- Correlation clustering optimization
- Hybrid linear modeling via local best flats LBF code
Neural Networks
- Resource collection at UC-Merced
- Belief propagation/sum-product algorithm Code
- Deep Boltzmann Machines
- Shape Boltzmann machine: a strong model of object shapes
- Support vector machine
- Liblinear for large linear classification
- Object detection with boosting
- Convolutional/deconvolutional networks
- Hopfield networks Hopfield code
- Self-organizing Map Toolbox
- Reservoir Computing Toolbox
- Polychronization: Computation with spikes
- Slowly coupled oscillators: phase dynamics and sync
- Liquid state machines LSM code
- Sparse coding neural gas NeuralGas code
- Echo state networks for harnessing nonlinearity ESN code
- Fast approximate nearest beighbors with automatic algorithm configuration
- Sum-product networks: A new deep architecture SPN code
- Deformable graph matching DGM code