Difference between revisions of "Dimensional Reduction"

From
Jump to: navigation, search
Line 10: Line 10:
 
Algorithms:
 
Algorithms:
 
* [[Principal Component Analysis (PCA)]]
 
* [[Principal Component Analysis (PCA)]]
* [[Pooling / Sub-sampling: Max, Mean]]
+
* [http://en.wikipedia.org/wiki/Independent_component_analysis[Independent Component Analysis (ICA)]
* [[Kernel Trick]]
 
* [[Isomap]]
 
* [[Local Linear Embedding (LLE)]]
 
* [[t-Distributed Stochastic Neighbor Embedding (t-SNE)]]
 
* [[Softmax]]
 
 
* [http://en.wikipedia.org/wiki/Canonical_correlation Canonical Correlation Analysis (CCA)]
 
* [http://en.wikipedia.org/wiki/Canonical_correlation Canonical Correlation Analysis (CCA)]
* [http://en.wikipedia.org/wiki/Independent_component_analysis[Independent Component Analysis (ICA)]
 
 
* [http://en.wikipedia.org/wiki/Linear_discriminant_analysis Linear Discriminant Analysis (LDA)]
 
* [http://en.wikipedia.org/wiki/Linear_discriminant_analysis Linear Discriminant Analysis (LDA)]
 
* [http://en.wikipedia.org/wiki/Multidimensional_scaling Multidimensional Scaling (MDS)]
 
* [http://en.wikipedia.org/wiki/Multidimensional_scaling Multidimensional Scaling (MDS)]
Line 25: Line 19:
 
* [http://en.wikipedia.org/wiki/Projection_pursuit Projection Pursuit]
 
* [http://en.wikipedia.org/wiki/Projection_pursuit Projection Pursuit]
 
* [http://en.wikipedia.org/wiki/Sammon_mapping Sammon Mapping/Projection]
 
* [http://en.wikipedia.org/wiki/Sammon_mapping Sammon Mapping/Projection]
 +
 +
 +
* [[Pooling / Sub-sampling: Max, Mean]]
 +
* [[Kernel Trick]]
 +
* [[Isomap]]
 +
* [[Local Linear Embedding (LLE)]]
 +
* [[t-Distributed Stochastic Neighbor Embedding (t-SNE)]]
 +
* [[Softmax]]
 +
 
* [http://github.com/JonTupitza/Data-Science-Process/blob/master/06-Dimensionality-Reduction.ipynb Dimensionality Reduction Techniques Jupyter Notebook |] [http://github.com/jontupitza Jon Tupitza]
 
* [http://github.com/JonTupitza/Data-Science-Process/blob/master/06-Dimensionality-Reduction.ipynb Dimensionality Reduction Techniques Jupyter Notebook |] [http://github.com/jontupitza Jon Tupitza]
  

Revision as of 05:26, 27 June 2019

Youtube search... ...Google search

Algorithms:


Related:

Some datasets may contain many variables that may cause very hard to handle. Especially nowadays data collecting in systems occur at very detailed level due to the existence of more than enough resources. In such cases, the data sets may contain thousands of variables and most of them can be unnecessary as well. In this case, it is almost impossible to identify the variables which have the most impact on our prediction. Dimensional Reduction Algorithms are used in this kind of situations. It utilizes other algorithms like Random Forest, Decision Tree to identify the most important variables. 10 Machine Learning Algorithms You need to Know | Sidath Asir @ Medium