Levine, Z.
and Morris, B.
(2016),
The Poisson-Influenced K-Means Algorithm, a Maximum-Likelihood Procedure for Clusters with a Known Probability Distribution, The Mathematica Journal, [online], https://doi.org/10.3888/tmj.18-3
(Accessed December 4, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
The Poisson-Influenced K-Means Algorithm, a Maximum-Likelihood Procedure for Clusters with a Known Probability Distribution
Published
Author(s)
,
Abstract
We present an implementation of the Poisson-Influenced K-Means Algorithm (PIKA), first developed to characterize the output of a superconducting transition edge sensor (TES) in the few-photon- counting regime. The algorithm seeks to group a number of data into several clusters that minimize their distances from their means, as in classical K-means clustering, but with the added knowledge that the cluster sizes should follow a Poisson distribution.Citation
The Mathematica Journal
Volume
18
Issue
4
Pub Type
Journals
Download Paper
Keywords
The Poisson-Influenced K-Means Algorithm , Maximum-Likelihood , transition edge sensor , TES
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created April 25, 2016, Updated November 10, 2018