dorsal/arxiv
View SchemaA global algorithm for clustering univariate observations
| Authors | Paul Terre Fety |
|---|---|
| Categories | |
| ArXiv ID | physics/0703281 |
| URL | https://arxiv.org/abs/physics/0703281 |
Abstract
This paper deals with the clustering of univariate observations: given a set of observations coming from $K$ possible clusters, one has to estimate the cluster means. We propose an algorithm based on the minimization of the "KP" criterion we introduced in a previous work. In this paper, we show that the global minimum of this criterion can be reached by first solving a linear system then calculating the roots of some polynomial of order $K$. The KP global minimum provides a first raw estimate of the cluster means, and a final clustering step enables to recover the cluster means. Our method's relevance and superiority to the Expectation-Maximization algorithm is illustrated through simulations of various Gaussian mixtures. \keywords{unsupervised clustering \and non-iterative algorithm \and optimization criterion \and univariate observations
{
"annotation_id": "91df744f-7f2c-49af-916e-16e0450cf903",
"date_created": "2026-03-02T18:01:17.810000Z",
"date_modified": "2026-03-02T18:01:17.810000Z",
"file_hash": "fff89ec18c0fab6ece37881c0669cdbb726fe1df677cd6fdcfe1527d69152ecc",
"private": false,
"record": {
"abstract": "This paper deals with the clustering of univariate observations: given a set\nof observations coming from $K$ possible clusters, one has to estimate the\ncluster means. We propose an algorithm based on the minimization of the \"KP\"\ncriterion we introduced in a previous work. In this paper, we show that the\nglobal minimum of this criterion can be reached by first solving a linear\nsystem then calculating the roots of some polynomial of order $K$. The KP\nglobal minimum provides a first raw estimate of the cluster means, and a final\nclustering step enables to recover the cluster means. Our method\u0027s relevance\nand superiority to the Expectation-Maximization algorithm is illustrated\nthrough simulations of various Gaussian mixtures. \\keywords{unsupervised\nclustering \\and non-iterative algorithm \\and optimization criterion \\and\nunivariate observations",
"arxiv_id": "physics/0703281",
"authors": [
"Paul Terre Fety"
],
"categories": [
"physics.data-an"
],
"title": "A global algorithm for clustering univariate observations",
"url": "https://arxiv.org/abs/physics/0703281"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "59bcc16f-ec72-4bfa-900e-c955e38ad2d1",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}