聚类算法 Resources

Showing items tagged with "聚类算法"

K-Medoids Clustering Algorithm: An object-based clustering approach using medoids as cluster representatives. Implementation steps include medoid initialization, data point assignment, and iterative medoid swapping based on cost minimization. This method is robust to noise and outliers, suitable for small datasets.

MATLAB 257 views Tagged

This implementation presents a clustering algorithm utilizing Genetic Simulated Annealing methodology. Detailed explanations and tutorials are included internally, though high-definition tutorials may require contacting the author via 1066146635@qq.com due to file size constraints. The algorithm combines genetic operations with simulated annealing to optimize cluster centroids and assignment.

MATLAB 231 views Tagged

A clustering algorithm integrating Genetic Algorithm (GA) with Simulated Annealing (SA) for enhanced optimization. By combining GA's population-based search and SA's probabilistic acceptance of suboptimal solutions, the algorithm effectively mitigates premature convergence issues in traditional GA. Key implementations include customized genetic encoding for cluster centers, a fitness function based on intra-cluster variance minimization, and adaptive cooling schedules, ensuring efficient convergence to global optima in clustering tasks.

MATLAB 224 views Tagged