简介
Machine Learning 是 Artificial Intelligence 的一个子领域。该数据集参考了ACM分类树,在此基础上进行了调整以及大量的扩充,形成了共7层包含406个machine learning领域相关概念的层次分类树。数据如下所示。
Learning paradigms
Learning paradigms
- Supervised learning
- Learning To Rank
- pointwise approach
- pairwise approach
- listwise approach
- Preference Learning
- Supervised learning by classification
- Supervised learning by regression
- Structured outputs
- Cost-sensitive learning
- Learning To Rank
- Unsupervised learning
- Clustering
-
average linkage clusteringfuzzy clusteringcombinatorial data analysissignal clusteringspace-time clusteringMulti-view clustering
-
-
Mixture modelingTopic modelingSource separationMotif discoveryDimensionality reductionmanifold learning
- Clustering
-
Reinforcement learning
-
Reward technique
-
Multi-arm banditsMarkov decision processes
- Gittins Index
- Sequential decision making
- Inverse reinforcement learning
- Apprenticeship learning
- Multi-agent reinforcement learning
- Robot Control
- Trajectory Optimization
-
- Adversarial learning
- Multi-task learning
- Transfer learning
- Lifelong machine learning
- Learning under covariate shift
- Online machine learning
- Ensemble methods
-
BoostingBagging
-
-
Spectral methodsDiscriminative Model
- Generative Model
- Bayesian concept learning
- beta-binomial model
- Dirichlet-multinomial model
- representation learning
- Sparse coding
- dictionary learning
-
-
Machine learning approaches
Machine learning approaches
- Supervised learning by regression
- Linear regression
- Robust linear regression
- Ridge regression
- Bayesian linear regression
- log-linear regression
- generalized linear model
- multivariate linear regression
- Kernel methods
- Kernel functions
- RBF kernels
- Mercer kernels
- Linear kernels
- Matern kernels
- String kernels
- Pyramid match kernels
- Kernels derived from probabilistic generative models
- kernel trick
- Kernelized nearest neighbor classification
- Kernelized K-medoids clustering
- Kernelized ridge regression
- Kernel Principal component analysis (PCA)
- Support vector machines (SVMs)
- SVMs for regression
- SVMs for classification
- Maximum margin
- Convex quadratic programming
- Sequential minimal optimization
- Soft margin
- Ranking SVM
- Gaussian models
- Gaussian discriminant analysis
- Quadratic discriminant analysis
- Linear discriminant analysis (LDA)
- Two-class LDA
- Regularized LDA
- Diagonal LDA
- Nearest shrunken centroids classifier
- Logical and relational learning
- Inductive logic learning
- Statistical relational learning
-
Factorization methods
- Non-negative matrix factorization
- Factor analysis
-
Principal component analysis (PCA)
- Singular value decomposition (SVD)
- Probabilistic PCA
- Independent Component Analysis (ICA)
- Canonical correlation analysis
-
Latent Dirichlet allocation
-
Hierarchical dirichlet processDynamic topic modelCorrelated topic modelLDA-HMMSupervised LDA
- Dynamic topic model
-
-
Rule learningInstance-based learning
- Kernel smoother
-
Graphical models
-
Directed graphical model (Bayes nets)
- d-separation
- Markov blanket
- Naive Bayes classifiers
- Markov model
-
Hidden Markov model
- Variable duration (semi-Markov) HMMs
- Hierarchical HMMs
- Auto-regressive and buried HMMs
- Factorial HMM
- Coupled HMM
- Dynamic Bayesian networks (DBNs)
- Directed Gaussian graphical models
-
-
Mixture models
-
Mixture of multinoullisMixtures of expert
- Mixtures of Gaussians
-
- Undirected graphical model (Markov random fields)
-
Ising modelHopfield networksPotts modelGaussian MRFsMarkov logic networksConditional random fieldFactor graphical modelMEMMsStructural SVM
-
-
Learning in probabilistic graphical models
- Maximum likelihood Estimation (MLE)
- Maximum entropy modeling
- Maximum a posteriori modeling (MAP)
- Expectation Maximization (EM)
- structure learning
-
-
Learning tree structuresLearning DAG structures Markov equivalenceLearning DAG structure with latent variables Structural EMLearning causal DAGsLearning undirected Gaussian graphical modelsLearning undirected discrete graphical modelsInferenceViterbi algorithmforwards-backwards algorithmForwards filteringbackwards samplingKalman filtering algorithmKalman smoothing algorithmBelief propagation (BP) Gaussian belief propagation Loopy belief propagation Generalized belief propagation Convex belief propagationVariable elimination algorithmJunction tree algorithmMessage passingVariational inferenceMean field method Structured mean fieldVariational BayesVariational Bayes EMVariational message passingExpectation propagationMAP state estimationLinear programming relaxationMax-product belief propagationDual decompositionMonte Carlo inferenceRejection samplingImportance samplingSampling importance resampling (SIR)Particle filteringSequential importance samplingRao-Blackwellised particle filtering (RBPF)Markov chain Monte Carlo (MCMC) inferenceGibbs samplingCollapsed Gibbs samplingImputation Posterior (IP) algorithmBlocking Gibbs samplingMetropolis Hastings algorithmAuxiliary variable MCMCSlice samplingSwendsen WangHybrid/Hamiltonian MCMCAnnealing methodsSimulated annealingAnnealed importance samplingParallel temperingApproximating the marginal likelihoodThe candidate methodHarmonic mean estimateAnnealed importance samplingClusteringDirichlet process mixture modelsChinese restaurant processGaussian processesGP latent variable modelAffinity propagationSpectral clusteringGraph LaplacianNormalized graph LaplacianHierarchical clusteringAgglomerative clusteringDivisive clusteringBayesian hierarchical clusteringK-means clusteringCanopy Clustering Algorithmstochastic block modelDensity-based spatial clustering of applications with noiseMarkov decision processesBellman equationDiscounted rewardAverage rewardModel-based methodDynamic programmingDifferential dynamic programmingAsynchronous dynamic programmingValue iterationPolicy iterationApproximate dynamic programming methodsModel-free methodMonte Carlo methodMonte Carlo predictionMonte Carlo controlSamplingImportance samplingDiscounting-aware importance samplingPer-decision importance samplingMonte Carlo samplingThompson samplingTemporal difference learningValue-based methodSarsaQ-learningDeep Q-learning networkDistributional reinforcement learning with quantileregressionHindsight experience replayn-step bootstrappingn-step Sarsan-step off-policy learningn-step tree backup algorithmn-step Q(σ)Approximation MethodSemi-gradient n-step SarsaDifferential semi-gradient n-step SarsaTD(λ)Sarsa(λ)Tree-Backup(λ)Robbins-Monro stochastic approximationPolicy-gradientREINFORCEActor-Critic methodsAdvantage Actor-CriticAsynchronous Advantage Actor-Critic Actor-CriticProximal policy optimizationTrust region policy optimizationSemi-Markov decision problemStochastic gamesHierarchical Markov decision processFactored Markov Decision ProcessPartially-observable Markov decision processesMulti-arm banditsK-armed banditContextual banditsUpper-Confidence-Bound action selectionGradient bandit algorithmNeural networksBackpropagation (BP)PerceptronMulti-layer perceptronFeedforward neural networkDeep learningRecurrent neural networkLong short term memoryConvolutional LSTM (ConvLSTM)Gated recurrent unitConvolutional neural networkLeNetAlexNetZFNetNetwork in NetworkVGGNETGoogLetNetResidual Network (ResNet)DenseNetFractalNetCapsuleNetAuto-encoderVariational autoencoderGraph neural networkMemory networkBoltzmann machineDeep belief networksConvolutional deep belief networkGenerative adversarial network (GAN)Deep Reinforcement learning (DRL)Ensemble methodsBoostingForward stagewise additive modelingL2boostinglogitboostBootstrap AggregatingBrownboostGradient boostingSparse boostingAdaBoostBaggingRandom forestStackingFeature selectionAkaike information criterionBonferroni correctionFalse discovery rateFamilywise error rateMultiple correlationRank correlationStepwise regressionBio-inspired approachesArtificial lifeEvolvable hardwareGenetic algorithmsGenetic programmingEvolutionary roboticsGenerative and developmental approaches
-
- Gaussian discriminant analysis
- Kernel functions
- Linear regression
Machine Learning Theory
Machine learning theory
- Model evaluation and selection
- The curse of dimensionality
- Structural risk minimization
- Empirical risk minimization (ERM)
- Regret bounds
- Generalization error
- Inductive bias
- Complexity
- Sample complexity
- Rademacher complexity
- Generalization bounds
- Variance
- VC-dimension
- Inductive inference
- Probably approximately correct (PAC)
- Online learning theory
- Cross-validation
- K-fold cross-validation
- Bootstrapping
- Model selection
- No free lunch theorem
- Hypothesis testing
- Binomial test
- T-test
- Normal distribution test
- Model Setting
- Hyperparameter optimization
- Batch learning
- Online learning settings
- Learning from demonstrations
- Learning from critiques
- Learning from implicit feedback
- Active learning settings
- Semi-supervised learning settings
- Model fitting
- Overfitting
- Early stopping
- Dropout
- Regularization
- L1 regularization
- Group lasso
- Fused lasso
- L2 regularization
- Elastic net
- Non-convex regularizers
- Bridge regression
- Hierarchical adaptive lasso
- L1 regularization
- Underfitting
- Optimization method
- Maximum likelihood estimation (MLE)
- Least square method
- Steepest descent
- Gradient descent
- Stochastic gradient descent
- Newton’s method
- Quasi-Newton (variable metric) methods
下载地址
请耐心等待