4.1. Introduction4.2. New semi-supervised algorithm using the cluster and label strategy4.2.1. Block diagram4.2.1.1. Dataset4.2.1.2. Clustering4.2.1.3. Optimum cluster labeling4.2.1.4. Classification4.3. Optimum cluster labeling4.3.1. Problem definition4.3.2. The Hungarian algorithm4.3.2.1. Weighted complete bipartite graph4.3.2.2. Matching, perfect matching and maximum weight matching4.3.2.3. Objective of Hungarian method4.3.2.4. Complexity considerations4.3.3. Genetic algorithms4.3.3.1. Reproduction operators4.3.3.1.1. Crossover4.3.3.1.2. Mutation4.3.3.2. Forming the next generation4.3.3.2.1. Generational replacement4.3.3.2.2. Elitism with generational replacement4.3.3.2.3. Steady state representation4.3.3.3. GAs applied to optimum cluster labeling4.3.3.4. Comparison of methods4.4. Supervised classification block4.4.1. Support vector machines4.4.1.1. The kernel trick for nonlinearly separable classes4.4.1.2. Multi-class classification4.4.2. Example4.5. Datasets4.5.1. Mixtures of Gaussians4.5.2. Datasets from the UCI repository4.5.2.1. Iris dataset (Iris)4.5.2.2. Wine dataset (wine)4.5.2.3. Wisconsin breast cancer dataset (breast)4.5.2.4. Handwritten digits dataset (Pendig)4.5.2.5. Pima Indians diabetes (diabetes)4.5.3. Utterance dataset4.6. An analysis of the bounds for the cluster and label approaches4.7. Extension through cluster pruning4.7.1. Determination of silhouette thresholds4.7.2. Evaluation of the cluster pruning approach4.8. Simulations and results4.9. Summary