{"id":28089246,"url":"https://github.com/stdlib-js/ml-incr-kmeans","last_synced_at":"2025-05-13T12:55:32.683Z","repository":{"id":41365844,"uuid":"377266968","full_name":"stdlib-js/ml-incr-kmeans","owner":"stdlib-js","description":"Incrementally partition data into `k` clusters.","archived":false,"fork":false,"pushed_at":"2025-03-30T22:59:17.000Z","size":3098,"stargazers_count":5,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"main","last_synced_at":"2025-04-12T23:56:31.400Z","etag":null,"topics":["correlation","cosine","data-mining","euclidean","javascript","k-means","kmeans","learning","lloyds-algorithm","machine","math","mathematics","ml","node","node-js","nodejs","quantization","statistics","stats","stdlib"],"latest_commit_sha":null,"homepage":"https://github.com/stdlib-js/stdlib","language":"JavaScript","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/stdlib-js.png","metadata":{"files":{"readme":"README.md","changelog":"CHANGELOG.md","contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":"CITATION.cff","codeowners":null,"security":"SECURITY.md","support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null},"funding":{"github":["stdlib-js"],"open_collective":"stdlib","tidelift":"npm/@stdlib/stdlib"}},"created_at":"2021-06-15T19:01:17.000Z","updated_at":"2025-03-30T22:57:30.000Z","dependencies_parsed_at":"2024-01-23T21:41:00.673Z","dependency_job_id":"b14602ee-9cfc-4364-a4be-54abd485ea4a","html_url":"https://github.com/stdlib-js/ml-incr-kmeans","commit_stats":{"total_commits":37,"total_committers":1,"mean_commits":37.0,"dds":0.0,"last_synced_commit":"921cea833b8a92bc77725ab793312675d28e4b10"},"previous_names":[],"tags_count":18,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stdlib-js%2Fml-incr-kmeans","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stdlib-js%2Fml-incr-kmeans/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stdlib-js%2Fml-incr-kmeans/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stdlib-js%2Fml-incr-kmeans/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/stdlib-js","download_url":"https://codeload.github.com/stdlib-js/ml-incr-kmeans/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":253948333,"owners_count":21988953,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["correlation","cosine","data-mining","euclidean","javascript","k-means","kmeans","learning","lloyds-algorithm","machine","math","mathematics","ml","node","node-js","nodejs","quantization","statistics","stats","stdlib"],"created_at":"2025-05-13T12:55:32.063Z","updated_at":"2025-05-13T12:55:32.671Z","avatar_url":"https://github.com/stdlib-js.png","language":"JavaScript","funding_links":["https://github.com/sponsors/stdlib-js","https://opencollective.com/stdlib","https://tidelift.com/funding/github/npm/@stdlib/stdlib"],"categories":[],"sub_categories":[],"readme":"\u003c!--\n\n@license Apache-2.0\n\nCopyright (c) 2018 The Stdlib Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n   http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\n--\u003e\n\n\n\u003cdetails\u003e\n  \u003csummary\u003e\n    About stdlib...\n  \u003c/summary\u003e\n  \u003cp\u003eWe believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.\u003c/p\u003e\n  \u003cp\u003eThe library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.\u003c/p\u003e\n  \u003cp\u003eWhen you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.\u003c/p\u003e\n  \u003cp\u003eTo join us in bringing numerical computing to the web, get started by checking us out on \u003ca href=\"https://github.com/stdlib-js/stdlib\"\u003eGitHub\u003c/a\u003e, and please consider \u003ca href=\"https://opencollective.com/stdlib\"\u003efinancially supporting stdlib\u003c/a\u003e. We greatly appreciate your continued support!\u003c/p\u003e\n\u003c/details\u003e\n\n# incrkmeans\n\n[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] \u003c!-- [![dependencies][dependencies-image]][dependencies-url] --\u003e\n\n\u003e Incrementally partition data into `k` [clusters][k-means-clustering].\n\n\u003csection class=\"intro\"\u003e\n\n\u003c/section\u003e\n\n\u003c!-- /.intro --\u003e\n\n\u003csection class=\"installation\"\u003e\n\n## Installation\n\n```bash\nnpm install @stdlib/ml-incr-kmeans\n```\n\nAlternatively,\n\n-   To load the package in a website via a `script` tag without installation and bundlers, use the [ES Module][es-module] available on the [`esm`][esm-url] branch (see [README][esm-readme]).\n-   If you are using Deno, visit the [`deno`][deno-url] branch (see [README][deno-readme] for usage intructions).\n-   For use in Observable, or in browser/node environments, use the [Universal Module Definition (UMD)][umd] build available on the [`umd`][umd-url] branch (see [README][umd-readme]).\n\nThe [branches.md][branches-url] file summarizes the available branches and displays a diagram illustrating their relationships.\n\nTo view installation and usage instructions specific to each branch build, be sure to explicitly navigate to the respective README files on each branch, as linked to above.\n\n\u003c/section\u003e\n\n\u003csection class=\"usage\"\u003e\n\n## Usage\n\n```javascript\nvar incrkmeans = require( '@stdlib/ml-incr-kmeans' );\n```\n\n#### incrkmeans( k\\[, ndims]\\[, options] )\n\nReturns an accumulator `function` which incrementally partitions `k` [clusters][k-means-clustering].\n\n```javascript\n// Create an accumulator for partitioning 2-dimensional data into 5 clusters:\nvar accumulator = incrkmeans( 5, 2 );\n```\n\nTo specify initial centroids, provide a 2-dimensional `k`-by-`ndims` [`ndarray`][@stdlib/ndarray/ctor] containing centroid locations.\n\n\u003c!-- eslint-disable array-element-newline --\u003e\n\n```javascript\nvar Float64Array = require( '@stdlib/array-float64' );\nvar ndarray = require( '@stdlib/ndarray-ctor' );\n\n// Specify initial centroids:\nvar buffer = new Float64Array([\n    0.0, 0.0,\n    1.0, 1.0,\n    1.0, -1.0,\n    -1.0, -1.0,\n    -1.0, 1.0\n]);\nvar shape = [ 5, 2 ];\nvar strides = [ 2, 1 ];\n\nvar centroids = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );\n\n// Create an accumulator for partitioning 2-dimensional data into 5 clusters:\nvar accumulator = incrkmeans( centroids );\n```\n\nThe function accepts the following `options`:\n\n-   **metric**: distance metric. Must be one of the following:\n\n    -   `'euclidean'`: Euclidean distance (default).\n    -   `'cosine'`: cosine distance.\n    -   `'correlation`': correlation distance.\n\n-   **init**: an `array` containing the centroid initialization method and associated (optional) parameters. The first array element specifies the initialization method and must be one of the following:\n\n    -   `'kmeans++'`: k-means++ initialization (default).\n    -   `'sample'`: randomly sample from a specified number of data points.\n    -   `'forgy'`: randomly assign data points to one of `k` clusters and compute cluster centroids.\n\n    The second array element specifies the number of data points to use when calculating initial centroids. When performing kmeans++ initialization, the third array element specifies the number of trials to perform when randomly selecting candidate centroids. Typically, more trials is correlated with initial centroids which lead to better clustering; however, a greater number of trials increases computational overhead. Default: `[ 'kmeans++', k, 2+⌊ln(k)⌋ ]`.\n\n-   **normalize**: `boolean` indicating whether to normalize incoming data. This option is only relevant for non-Euclidean distance metrics. If set to `true`, an accumulator partitioning data based on cosine distance normalizes provided data to unit Euclidean length. If set to `true`, an accumulator partitioning data based on correlation distance first centers provided data and then normalizes data dimensions to have zero mean and unit variance. If this option is set to `false` and the metric is either cosine or correlation distance, then incoming data **must** already be normalized. Default: `true`.\n\n-   **copy**: `boolean` indicating whether to copy incoming data to prevent **mutation** during normalization. Default: `true`.\n\n-   **seed**: PRNG seed. Setting this option is useful when wanting reproducible centroid initialization.\n\n#### accumulator( \\[vector] )\n\nIf provided a data point vector, the accumulator function returns updated cluster results. If not provided a data point vector, the accumulator function returns the current cluster results.\n\n```javascript\nvar Float64Array = require( '@stdlib/array-float64' );\nvar ndarray = require( '@stdlib/ndarray-ctor' );\n\n// Create a data vector:\nvar buffer = new Float64Array( 2 );\nvar shape = [ 2 ];\nvar strides = [ 1 ];\nvar vec = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );\n\n// Create an accumulator for partitioning 2-dimensional data into 5 clusters:\nvar accumulator = incrkmeans( 5, 2 );\n\n// Provide data to the accumulator:\nvec.set( 0, 2.0 );\nvec.set( 1, 1.0 );\n\nvar out = accumulator( vec );\n// e.g., returns {...}\n\nvec.set( 0, 1.0 );\nvec.set( 1, -5.0 );\n\nout = accumulator( vec );\n// e.g., returns {...}\n\nvec.set( 0, 3.0 );\nvec.set( 1, 3.14 );\n\nout = accumulator( vec );\n// e.g., returns {...}\n\nout = accumulator();\n// e.g., returns {...}\n```\n\nIf not provided initial centroids, an accumulator caches data point vectors for subsequent centroid initialization. Until an accumulator computes initial centroids, an accumulator returns `null`. Once an accumulator has initial centroids (either provided or computed), an accumulator returns cluster results.\n\nCluster results are comprised of the following:\n\n-   **centroids**: a `k`-by-`ndims` matrix containing centroid locations. Each centroid is the component-wise mean of the data points assigned to a centroid's corresponding cluster.\n-   **stats**: a `k`-by-`4` matrix containing cluster statistics.\n\nCluster statistics consists of the following columns:\n\n-   `0`: number of data points assigned to a cluster.\n-   `1`: total within-cluster sum of squared distances.\n-   `2`: arithmetic mean of squared distances.\n-   `3`: corrected sample standard deviation of squared distances.\n\n#### accumulator.predict( \\[out,] X )\n\nPredicts centroid assignment for each data point in a provided matrix `X`.\n\n```javascript\nvar Float64Array = require( '@stdlib/array-float64' );\nvar ndarray = require( '@stdlib/ndarray-ctor' );\n\n// Create a data vector:\nvar buffer = new Float64Array( 2 );\nvar shape = [ 2 ];\nvar strides = [ 1 ];\nvar vec = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );\n\n// Create an accumulator for partitioning 2-dimensional into 2 clusters:\nvar accumulator = incrkmeans( 2, 2, {\n    'init': [ 'sample', 2 ]\n});\n\n// Provide data to the accumulator:\nvec.set( 0, 2.0 );\nvec.set( 1, 1.0 );\naccumulator( vec );\n\nvec.set( 0, 1.0 );\nvec.set( 1, -5.0 );\naccumulator( vec );\n\nvec.set( 0, 3.0 );\nvec.set( 1, 3.14 );\naccumulator( vec );\n\n// Create a matrix containing the data points for which we want to predict cluster assignment:\nbuffer = new Float64Array( 4 );\nshape = [ 2, 2 ];\nstrides = [ 2, 1 ];\nvar mat = ndarray( 'float64', buffer, shape, strides, 0, 'row-major' );\n\nmat.set( 0, 0, 0.0 );\nmat.set( 0, 1, 0.0 );\n\nmat.set( 1, 0, 0.5 );\nmat.set( 1, 1, -0.5 );\n\nvar out = accumulator.predict( mat );\n// returns \u003cndarray\u003e\n```\n\nTo specify an output vector, provide a 1-dimensional [`ndarray`][@stdlib/ndarray/ctor] as the first argument. Each element in the returned vector corresponds to a predicted cluster index for a respective data point.\n\n\u003c/section\u003e\n\n\u003c!-- /.usage --\u003e\n\n\u003csection class=\"notes\"\u003e\n\n## Notes\n\n-   Because an accumulator incrementally partitions data, one should **not** expect cluster statistics to match similar statistics had provided data been analyzed via a batch algorithm. In an incremental context, data points which would not be considered part of a particular cluster when analyzed via a batch algorithm may contribute to that cluster's statistics when analyzed incrementally. In general, the more data provided to an accumulator, the more reliable the cluster statistics.\n-   Forgy's method for centroid initialization is generally discouraged, as the method generates initial clusters without internal homogeneity and no theoretical basis. The method's inclusion is due to its historical usage.\n\n\u003c/section\u003e\n\n\u003c!-- /.notes --\u003e\n\n\u003csection class=\"examples\"\u003e\n\n## Examples\n\n\u003c!-- eslint-disable array-element-newline --\u003e\n\n\u003c!-- eslint no-undef: \"error\" --\u003e\n\n```javascript\nvar discreteUniform = require( '@stdlib/random-base-discrete-uniform' );\nvar normal = require( '@stdlib/random-base-normal' ).factory;\nvar ndarray = require( '@stdlib/ndarray-ctor' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar Int8Array = require( '@stdlib/array-int8' );\nvar incrkmeans = require( '@stdlib/ml-incr-kmeans' );\n\n// Define the number of data points to simulate:\nvar N = 1e4;\n\n// Define the number of clusters:\nvar k = 5;\n\n// Define cluster properties:\nvar clusters = new Float64Array([\n    0.0, 1.0, 0.0, 1.0, // meanX, stdevX, meanY, stdevY\n    -5.0, 1.0, 5.0, 1.0,\n    5.0, 1.0, 5.0, 1.0,\n    5.0, 1.0, -5.0, 1.0,\n    -5.0, 1.0, -5.0, 1.0\n]);\nclusters = ndarray( 'float64', clusters, [ k, 4 ], [ 4, 1 ], 0, 'row-major' );\n\n// Define accumulator options:\nvar opts = {\n    'metric': 'euclidean',\n    'init': [ 'kmeans++', 100 ]\n};\n\n// Initialize a 2-dimensional k-means accumulator:\nvar acc = incrkmeans( k, 2, opts );\n\n// Create PRNGs for generating pseudorandom numbers drawn from 2-d uncorrelated normal distributions...\nvar randn = ndarray( 'generic', new Array( k*2 ), [ k, 2 ], [ 2, 1 ], 0, 'row-major' );\nvar i;\nfor ( i = 0; i \u003c k; i++ ) {\n    randn.set( i, 0, normal( clusters.get( i, 0 ), clusters.get( i, 1 ) ) );\n    randn.set( i, 1, normal( clusters.get( i, 2 ), clusters.get( i, 3 ) ) );\n}\n\n// Create a vector for storing simulated data:\nvar v = ndarray( 'float64', new Float64Array( 2 ), [ 2 ], [ 1 ], 0, 'row-major' );\n\n// Wrap the vector in a matrix for generating cluster predictions:\nvar m = ndarray( 'float64', v.data, [ 1, 2 ], [ 2, 1 ], 0, 'row-major' );\n\n// Create a vector for storing cluster predictions:\nvar p = ndarray( 'int8', new Int8Array( 1 ), [ 1 ], [ 1 ], 0, 'row-major' );\n\n// Simulate data points and incrementally perform k-means clustering...\nvar totals = [ 0, 0, 0, 0, 0 ];\nvar X = [];\nvar Y = [];\nfor ( i = 0; i \u003c k; i++ ) {\n    X.push( [] );\n    Y.push( [] );\n}\n\nvar results;\nvar x;\nvar y;\nvar c;\nvar r;\nfor ( i = 0; i \u003c N; i++ ) {\n    // Pick a random cluster from which to sample:\n    c = discreteUniform( 0, k-1 );\n    totals[ c ] += 1;\n\n    // Generate a random cluster data point:\n    x = randn.get( c, 0 )();\n    v.set( 0, x );\n    X[ c ].push( x );\n\n    y = randn.get( c, 1 )();\n    v.set( 1, y );\n    Y[ c ].push( y );\n\n    // Generate a cluster prediction:\n    r = acc.predict( p, m );\n    if ( r ) {\n        console.log( 'Data point: (%d, %d). Prediction: %d.', x.toFixed( 3 ), y.toFixed( 3 ), r.get( 0 )+1 );\n    }\n    // Update the accumulator:\n    results = acc( v );\n}\n\n// Print cluster results:\nresults = acc();\nif ( results ) {\n    console.log( '' );\n    for ( i = 0; i \u003c k; i++ ) {\n        console.log( 'Cluster %d', i+1 );\n        console.log( '  centroid: (%d, %d)', results.centroids.get( i, 0 ), results.centroids.get( i, 1 ) );\n        console.log( '  size: %d', results.stats.get( i, 0 ) );\n    }\n    console.log( '' );\n}\n\nconsole.log( '' );\nconsole.log( 'True cluster distribution: %s', totals.join( ', ' ) );\nconsole.log( '' );\n```\n\n\u003c/section\u003e\n\n\u003c!-- /.examples --\u003e\n\n\u003csection class=\"references\"\u003e\n\n## References\n\n-   Forgy, E. 1965. \"Cluster Analysis of Multivariate Data: Efficiency versus Interpretability of Classification.\" _Biometrics_ 21 (3): 768–69.\n-   MacQueen, J. 1967. \"Some methods for classification and analysis of multivariate observations.\" In _Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Statistics_, 281–97. Berkeley, California, USA: University of California Press. \u003chttps://projecteuclid.org/euclid.bsmsp/1200512992\u003e.\n-   Lloyd, S. 1982. \"Least Squares Quantization in PCM.\" _IEEE Transactions on Information Theory_ 28 (2). Piscataway, NJ, USA: IEEE Press: 129–37. doi:[10.1109/TIT.1982.1056489][@lloyd:1982a].\n-   Arthur, David, and Sergei Vassilvitskii. 2007. \"K-means++: The Advantages of Careful Seeding.\" In _Proceedings of the Eighteenth Annual Acm-Siam Symposium on Discrete Algorithms_, 1027–35. SODA '07. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics. \u003chttp://dl.acm.org/citation.cfm?id=1283383.1283494\u003e.\n\n\u003c/section\u003e\n\n\u003c!-- /.references --\u003e\n\n\u003c!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. --\u003e\n\n\u003csection class=\"related\"\u003e\n\n\u003c/section\u003e\n\n\u003c!-- /.related --\u003e\n\n\u003c!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. --\u003e\n\n\n\u003csection class=\"main-repo\" \u003e\n\n* * *\n\n## Notice\n\nThis package is part of [stdlib][stdlib], a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.\n\nFor more information on the project, filing bug reports and feature requests, and guidance on how to develop [stdlib][stdlib], see the main project [repository][stdlib].\n\n#### Community\n\n[![Chat][chat-image]][chat-url]\n\n---\n\n## License\n\nSee [LICENSE][stdlib-license].\n\n\n## Copyright\n\nCopyright \u0026copy; 2016-2025. The Stdlib [Authors][stdlib-authors].\n\n\u003c/section\u003e\n\n\u003c!-- /.stdlib --\u003e\n\n\u003c!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. --\u003e\n\n\u003csection class=\"links\"\u003e\n\n[npm-image]: http://img.shields.io/npm/v/@stdlib/ml-incr-kmeans.svg\n[npm-url]: https://npmjs.org/package/@stdlib/ml-incr-kmeans\n\n[test-image]: https://github.com/stdlib-js/ml-incr-kmeans/actions/workflows/test.yml/badge.svg?branch=main\n[test-url]: https://github.com/stdlib-js/ml-incr-kmeans/actions/workflows/test.yml?query=branch:main\n\n[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/ml-incr-kmeans/main.svg\n[coverage-url]: https://codecov.io/github/stdlib-js/ml-incr-kmeans?branch=main\n\n\u003c!--\n\n[dependencies-image]: https://img.shields.io/david/stdlib-js/ml-incr-kmeans.svg\n[dependencies-url]: https://david-dm.org/stdlib-js/ml-incr-kmeans/main\n\n--\u003e\n\n[chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg\n[chat-url]: https://app.gitter.im/#/room/#stdlib-js_stdlib:gitter.im\n\n[stdlib]: https://github.com/stdlib-js/stdlib\n\n[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors\n\n[umd]: https://github.com/umdjs/umd\n[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules\n\n[deno-url]: https://github.com/stdlib-js/ml-incr-kmeans/tree/deno\n[deno-readme]: https://github.com/stdlib-js/ml-incr-kmeans/blob/deno/README.md\n[umd-url]: https://github.com/stdlib-js/ml-incr-kmeans/tree/umd\n[umd-readme]: https://github.com/stdlib-js/ml-incr-kmeans/blob/umd/README.md\n[esm-url]: https://github.com/stdlib-js/ml-incr-kmeans/tree/esm\n[esm-readme]: https://github.com/stdlib-js/ml-incr-kmeans/blob/esm/README.md\n[branches-url]: https://github.com/stdlib-js/ml-incr-kmeans/blob/main/branches.md\n\n[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/ml-incr-kmeans/main/LICENSE\n\n[k-means-clustering]: https://en.wikipedia.org/wiki/K-means_clustering\n\n[@stdlib/ndarray/ctor]: https://github.com/stdlib-js/ndarray-ctor\n\n[@lloyd:1982a]: https://doi.org/10.1109/TIT.1982.1056489\n\n\u003c/section\u003e\n\n\u003c!-- /.links --\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstdlib-js%2Fml-incr-kmeans","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstdlib-js%2Fml-incr-kmeans","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstdlib-js%2Fml-incr-kmeans/lists"}