A1 Refereed original research article in a scientific journal
Stochastic limited memory bundle algorithm for clustering in big data
Authors: Karmitsa, Napsu; Eronen, Ville-Pekka; Mäkelä, Marko M.; Pahikkala, Tapio; Airola, Antti
Publisher: Elsevier BV
Publishing place: London
Publication year: 2025
Journal: Pattern Recognition
Journal name in source: Pattern Recognition
Journal acronym: PATTERN RECOGN
Article number: 111654
Volume: 165
Number of pages: 13
ISSN: 0031-3203
eISSN: 1873-5142
DOI: https://doi.org/10.1016/j.patcog.2025.111654
Web address : https://doi.org/10.1016/j.patcog.2025.111654
Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/491806564
Clustering is a crucial task in data mining and machine learning. In this paper, we propose an efficient algorithm, BIG-CLuST, for solving minimum sum-of-squares clustering problems in large and big datasets. We first develop a novel stochastic limited memory bundle algorithm (SLMBA) for large-scale nonsmooth finite-sum optimization problems and then formulate the clustering problem accordingly. The BIG-CLuST algorithm - a stochastic adaptation of the incremental clustering methodology - aims to find the global or a high-quality local solution for the clustering problem. It detects good starting points, i.e., initial cluster centers, for the SLMBA, applied as an underlying solver. We evaluate BIG-CLuST on several real-world datasets with numerous data points and features, comparing its performance with other clustering algorithms designed for large and big data. Numerical results demonstrate the efficiency of the proposed algorithm and the high quality of the found solutions on par with the best existing methods.
Downloadable publication This is an electronic reprint of the original article. |  |
Funding information in the publication:
The work was financially supported by the Research Council of Finland , Projects No. #345804 and #345805 led by Tapio Pahikkala and Antti Airola.
