HAL (France)
open access
Strong bounds for large-scale Minimum Sum-of-Squares Clustering
Clustering is a fundamental technique in data analysis and machine learning, used to group similar data points together. Among various clustering methods, the Minimum Sum-of-Squares Clustering (MSSC) is one of the most widely used. MSSC aims to minimize the total squared Euclidean distance between d
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scalable and Robust Spatial Prediction via Multi-Resolution Ensembles of Predictive Processes#1187345
- From Data to Methods: Statistical Learning on Networks and Complex Dependencies in Healthcare and Social Systems#965672
- Unsupervised Machine Learning for Clustering of Septic Patients to Determine Optimal Treatment#856513
- A Short Proof of a Theorem of Pan and Zhang#1141830
- Siamese Foundation Models for Crystal Structure Prediction#141712
Record · ID 1312625
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive