Core Methods
51,083 papers (8 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Representation Learning (22,308)
Classification (15,497)
Regression (5,281)
Clustering (3,809)
Embedding Learning (3,795)
Metric Learning (2,938)
Graph Neural Networks (1,211)
Graphical Models (1,093)
Feature Learning (891)
Kernel Methods (795)
Dimensionality Reduction (780)
Interpretability (512)
Feature Selection (511)
Matrix Factorization (408)
Ranking (315)
Ensemble Methods (300)
Support Vector Machine (295)
Anomaly Detection (281)
Sequence Modeling (244)
Structured Prediction (237)
Sequence Labeling (157)
Topic Modeling (150)
Sparse Coding (140)
Matrix Completion (131)
Neural Networks (114)
Retrieval (105)
Density Estimation (104)
Estimation (83)
Inference (56)
Decision Tree (50)
Feature Extraction (40)
Model Selection (39)
Prediction (35)
Information Extraction (7)
Papers per year
4
21
30
55
40
51
225
219
249
257
357
364
480
942
818
966
1,394
2,092
3,114
4,415
4,853
5,064
5,371
5,992
6,412
5,823
1,475
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
A Simpler Approach to Matrix Completion
JMLR 2011
A Spike and Slab Restricted Boltzmann Machine
AISTATS 2011
Assisting Main Task Learning by Heterogeneous Auxiliary Tasks with Applications to Skin Cancer Screening
AISTATS 2011
Asymptotic Theory for Linear-Chain Conditional Random Fields
AISTATS 2011
Automatic Calibration of Multiple Coplanar Sensors
RSS 2011
Bagged Structure Learning of Bayesian Network
AISTATS 2011
Bayesian Co-Training
JMLR 2011
Bayesian Hierarchical Cross-Clustering
AISTATS 2011
Bayesian Partitioning of Large-Scale Distance Data
NeurIPS 2011
Bayesian Spike-Triggered Covariance Analysis
NeurIPS 2011
Beating SGD: Learning SVMs in Sublinear Time
NeurIPS 2011
Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts
NeurIPS 2011
Boosting with Maximum Adaptive Sampling
NeurIPS 2011
CAKE: Convex Adaptive Kernel Density Estimation
AISTATS 2011
CARP: Software for Fishing Out Good Clustering Algorithms
JMLR 2011
Clustered Multi-Task Learning Via Alternating Structure Optimization
NeurIPS 2011
Clustering Algorithms for Chains
JMLR 2011
Clustering via Dirichlet Process Mixture Models for Portable Skill Discovery
NeurIPS 2011
Collaborative Filtering with the Trace Norm: Learning, Bounding, and Transducing
COLT 2011
Collective Graphical Models
NeurIPS 2011
Comparative Analysis of Viterbi Training and Maximum Likelihood Estimation for HMMs
NeurIPS 2011
Composite Multiclass Losses
NeurIPS 2011
Computationally Efficient Convolved Multiple Output Gaussian Processes
JMLR 2011
Computationally Efficient Sufficient Dimension Reduction via Squared-Loss Mutual Information
ACML 2011
Confidence Sets for Network Structure
NeurIPS 2011