What is Principal Component Analysis? Principal Component Analysis (PCA) is a statistical procedure and an Unsupervised Learning Algorithm for reducing the dimensionality of a data set while retaining as much information as possible. PCA does this by finding a set of new variables, called “Principal Components”, that are linear combinations of the original variables. The principal components are chosen so ...

Downloads The download link of this project follows. Implementation of Linear Discriminant Analysis (LDA) in MATLAB Download Citing This Work If you wish, you can cite this content as follows. Cite as: Mostapha Kalami Heris, Linear Discriminant Analysis (LDA) in MATLAB (URL: https://yarpiz.com/430/ypml114-linear-discriminant-analysis), Yarpiz, 2015.

Time-series prediction can be assumed as a special case of nonlinear regression and function approximation. Hence, nonlinear regression approaches, like Artificial Neural Networks and Group Method of Data Handling (GMDH) can be applied to perform time-series forecasting problems. In this post, we are going to share with you, the source codes of time-series prediction using GMDH in MATLAB, which is ...

Feature selection is one of common preprocessing tasks, which is performed to reduce the number of inputs of intelligent algorithms and models. This helps us to simplify the models, reduce the computation cost of model training, and enhance the generalization abilities of the model and prevention of over-training. For more information on feature selection concepts and methods, you can refer ...

Group Method of Data Handling (GMDH) is a family of mathematical modeling and nonlinear regression algorithms, which is originally proposed by Alexey Grigorevich Ivakhnenko, an Ukrainian scientist and mathematician, in 1968. This approach is also known as Polynomial Neural Network and can be assumed as a specific type of supervised Artificial Neural Network (ANN). In addition to modeling specifications, GMDH ...

Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is a density-based clustering algorithm, proposed by Martin Ester et al., 1996. The algorithm finds neighbors of data points, within a circle of radius ε, and adds them into same cluster. For any neighbor point, which its ε-neighborhood contains a predefined number of points, the cluster is expanded to contain its neighbors, ...

Like Apriori algorithm, FP-Growth is an association rule mining approach. The term FP in the name of this approach, is abbreviation of Frequent Pattern. FP-Growth uses a frequent pattern mining technique to build a tree of frequent patterns (FP-Tree), which can be used to extract association rules. Compared to Apriori, the FP-Growth approach is more efficient and it has better ...

Association Rule Mining is a common task in the field of Data Mining, involving the recognition of frequent patterns, usually in transactional databases. For example, discovering a rule like {bread, butter} → {milk} in a sales dataset is a result of association rule mining, and indicates that if a customer buys bread and butter, it is likely that they will buy ...

Neural Gas network is a competitive Artificial Neural Network (ANN), very similar to Self-Organizing Map (SOM), which is proposed by Martinetz and Schulten, 1991. Neural Gas network can be used to solve unsupervised learning tasks, like clustering, dimensionality reduction, and topology learning. It has many applications in the fields of pattern recognition, data compression, speech recognition, and image segmentation. For ...

Clustering is an unsupervised machine learning task and many real world problems can be stated as and converted to this kind of problems. Clustering is grouping a set of  data objects is such a way that similarity of members of a group (or cluster) is maximized and on the other hand, similarity of members in two different groups, is minimized. ...