The CART data mining algorithm is part of a longer article about many more data mining algorithms. CART stands for classification and regression trees.  It is a decision tree learning technique that outputs either classification or regression trees. Like C4.5, CART …

The Naive Bayes data mining algorithm is part of a longer article about many more data mining algorithms. Naive Bayes is not a single algorithm, but a family of classification algorithms that share one common assumption: Every feature of the …

The kNN data mining algorithm is part of a longer article about many more data mining algorithms. kNN, or k-Nearest Neighbors, is a classification algorithm. However, it differs from the classifiers previously described because it’s a lazy learner. A lazy …

The AdaBoost data mining algorithm is part of a longer article about many more data mining algorithms. AdaBoost is a boosting algorithm which constructs a classifier. As you probably remember, a classifier takes a bunch of data and attempts to …

The PageRank data mining algorithm is part of a longer article about many more data mining algorithms. PageRank is a link analysis algorithm designed to determine the relative importance of some object linked within a network of objects. It’s a type …

The EM data mining algorithm is part of a longer article about many more data mining algorithms. In data mining, expectation-maximization (EM) is generally used as a clustering algorithm (like k-means) for knowledge discovery. In statistics, the EM algorithm iterates and …

The Apriori data mining algorithm is part of a longer article about many more data mining algorithms. The Apriori algorithm learns association rules and is applied to a database containing a large number of transactions. Association rule learning is a …

The SVM data mining algorithm is part of a longer article about many more data mining algorithms. Support vector machine (SVM) learns a hyperplane to classify data into 2 classes. At a high-level, SVM performs a similar task like C4.5 …