May 2024 S M T W T F S 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 Pages
- 1-bit measurements
- Bregman iteration
- classification
- clustering
- compressed sensing
- computer vision
- conical hull problem
- convex optimization
- dimension reduction
- Divide-and-Conquer
- elastic net
- fast algorithm
- fast SVD
- feature selection
- fixed point continuation
- game
- greedy search
- group sparsity
- Hamming Compressed Sensing
- iterative thresholding
- K-means
- latent variable model
- low-rank
- manifold learning
- matrix completion
- matrix factorization
- multi-label learning
- N-cut
- Nesterov's method
- NIPS 2011
- Nonnegative Matrix Factorization
- optimization
- Quantization recovery
- randomized optimization
- robust principal component analysis
- SDP
- Separable assumption
- sparse learning
- Spectral clustering
- structured learning
- SVM
ClustrMaps
-
What’s new
- List of Submodular Optimization on Streaming Data (In Update)
- Divide-and-Conquer Learning by Anchoring a Conical Hull
- Multi-task Copula – A semiparametric joint prediction model for multiple outputs with sparse graph structure
- NeSVM (Nesterov’s method for SVM) code for our ICDM 2010 paper
- AISTATS 2013 GreBsmo code is released
Articles
Tag Archives: manifold learning
Our DMKD paper is selected as Top 5 Editor’s Choice Article for Free Reading
Prof. Geoff Webb, the Editor-in-Chief of Data Mining and Knowledge Discovery (Springer) announced in his kdnuggets website that our paper “Manifold Elastic Net: A Unified Framework for Sparse Dimension Reduction”, which was published on DMKD journal in 2011 and cited … Continue reading
Posted in Tianyi's work
Tagged dimension reduction, elastic net, fast algorithm, feature selection, manifold learning, sparse learning
1 Comment
Manifold Elastic Net: A Unified Framework for Sparse Dimension Reduction
Manifold Elastic Net is the work we have done one year ago and it is about to be published on Data Mining and Knowledge Discovery (Springer) recently. You can either find it on the website of DMKD: http://www.springerlink.com/content/bk6301u1938104q6/ or the … Continue reading