How to Use K-means for Big Data Clustering?

1 code implementation • 14 Apr 2022 • Rustam Mussabayev, Nenad Mladenovic, Bassem Jarboui, Ravil Mussabayev

We propose a new parallel scheme of using K-means and K-means++ algorithms for big data clustering that satisfies the properties of a ``true big data'' algorithm and outperforms the classical and recent state-of-the-art MSSC approaches in terms of solution quality and runtime.

Clustering

Towards an intelligent VNS heuristic for the k-labelled spanning forest problem

no code implementations • 5 Mar 2015 • Sergio Consoli, Josè Andrès Moreno Pèrez, Nenad Mladenovic

In a currently ongoing project, we investigate a new possibility for solving the k-labelled spanning forest (kLSF) problem by an intelligent Variable Neighbourhood Search (Int-VNS) metaheuristic.